calc_lmejiav6 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 991e0a2d82c9fb48a296f70e1fb0fcc056f0b084
+  data.tar.gz: 6a239ba9309031958baf46caa7078d1db390f9a9
+SHA512:
+  metadata.gz: ef4de34d3293c36409d6aba6c1f893045d0752ddc64196c722e0b79c9def62564f06011b5b753ad909ad1d1857c062d7900364e1b5ac78b7ae16235ff7638de8
+  data.tar.gz: 09251d57b2e9e1d0ea4e3a016e77ceee10057f740f876c5c2fd0c4c1842ac6c104999e2e2e12848ebd7dd32535c9d3ff690c701ff779b093262e0407c21e33d0

data/bin/calc

@@ -0,0 +1,22 @@
+#!/usr/bin/env ruby
+
+require 'rubygems'
+require 'calculator'
+require 'calcex'
+
+$stdout.print "> "
+$stdout.flush
+
+text = gets
+
+$calc = Calculator.new()
+
+begin
+  puts "= " + $calc.eval(text).to_s
+rescue ParseError
+  puts "Parse Error"
+rescue UnrecognizedTokenException
+  puts "UnrecognizedTokenException"
+rescue
+  puts "Unkown exception"
+end

data/lib/ast.rb

@@ -0,0 +1,87 @@
+require 'set'
+
+class BinaryNode
+  attr_reader :left, :right
+  
+  def initialize(left,right)
+    @left = left
+    @right = right
+  end
+end
+   
+class UnaryNode
+  attr_reader :subTree
+   
+  def initialize(subTree)
+    @subTree = subTree
+  end
+end
+
+class AddNode < BinaryNode
+  def initialize(left, right)
+    super(left,right)
+  end
+   
+  def evaluate() 
+    return @left.evaluate() + @right.evaluate()
+  end
+end
+
+class SubNode < BinaryNode
+  def initialize(left, right)
+    super(left,right)
+  end
+   
+  def evaluate() 
+    return @left.evaluate() - @right.evaluate()
+  end
+end
+
+class TimesNode < BinaryNode
+  def initialize(left, right)
+    super(left,right)
+  end
+   
+  def evaluate() 
+    return @left.evaluate() * @right.evaluate()
+  end
+end
+
+class DivideNode < BinaryNode
+  def initialize(left, right)
+    super(left,right)
+  end
+   
+  def evaluate() 
+    return @left.evaluate() / @right.evaluate()
+  end
+end
+
+class StoreNode < UnaryNode
+  def initialize(subTree)
+    super(subTree)
+  end
+
+  def evaluate()
+    #val = subTree.evaluate
+    #$calc.memory=val
+
+    $calc.memory = subTree.evaluate
+  end
+end
+
+class NumNode 
+  def initialize(num)
+    @num = num
+  end
+   
+  def evaluate() 
+    return @num
+  end
+end
+
+class RecallNode
+   def evaluate()
+     return $calc.memory
+   end
+end

data/lib/calcex.rb

@@ -0,0 +1,3 @@
+
+class ParseError < Exception; end
+class UnrecognizedTokenException < Exception; end

data/lib/calculator.rb

@@ -0,0 +1,16 @@
+require 'parser'
+require 'ast'
+
+class Calculator
+  attr_accessor :memory
+    
+  def initialize()
+    @memory = 0
+  end
+  
+  def eval(expr)
+    parser = Parser.new(StringIO.new(expr))
+    ast = parser.parse()
+    return ast.evaluate()
+  end
+end

data/lib/parser.rb

@@ -0,0 +1,140 @@
+require 'ast'
+require 'scanner'
+require 'token'
+require 'calcex'
+
+class Parser
+  def initialize(istream)
+    @scan = Scanner.new(istream)
+  end
+   
+  def parse
+    return Prog()
+  end
+  
+  private
+  def Prog
+    result = Expr()
+    t = @scan.getToken
+    
+    if t.type != :eof then
+      print "Expected EOF. Found ", t.type, ".\n"
+      raise ParseError.new
+    end
+    
+   # return result
+    result
+  end
+  
+  def Expr() 
+    RestExpr(Term())
+  end
+   
+  def RestExpr(e) 
+    t = @scan.getToken
+    
+    if t.type == :add then
+      #return obligatorio 
+      return RestExpr(AddNode.new(e,Term()))
+    end
+    
+    if t.type == :sub then
+      return RestExpr(SubNode.new(e,Term()))
+    end
+      
+    @scan.putBackToken()
+
+    #return e 
+     e
+  end
+  
+  def Term()
+    # Write your Term() code here. This code is just temporary
+    # so you can try the calculator out before finishing it.
+    
+    #  t = @scan.getToken()
+    
+    #   if t.type == :number then
+    #     val = t.lex.to_i
+    #     return NumNode.new(val)
+    #   end
+    
+    #   puts "Term not implemented\n"
+    
+    #   raise ParseError.new
+    # end
+
+    RestTerm(Storable())
+  end
+
+    
+  def RestTerm(e)
+
+    t = @scan.getToken
+    if t.type == :times then
+      return ResTerm(TimesNode.new(e,Storable()))
+    end
+    
+    if t.type == :divide then
+      return ResTerm(DivideNode.new(e,Storable()))
+    end
+
+    @scan.putBackToken()
+
+    #return e
+    e
+    
+  end
+   
+  def Storable()
+   
+    result = Factor()
+    t = @scan.getToken
+
+    if t.type == :keyword then
+      if t.lex == 'S' then
+        return StoreNode.new(result)
+      end
+    
+      puts "Expected S, found: #{t.lex} at line #{t.line}, col: #{t.col}"
+      raise ParseError.new
+    end
+
+    @scan.putBackToken()
+
+    result
+    
+  end
+  
+  def Factor() 
+
+    t = @scan.getToken
+    if t.type == :number then
+      return NumNode.new(t.lex.to_i)
+    end
+
+    if t.type == :keyword then
+      if t.lex == 'R' then
+        return RecallNode.new
+      end
+      
+      puts "Expected R, found #{t.lex} at line: #{t.line}, col: #{t.col}"
+      raise ParseError.new
+    end
+
+    if t.type == :lparen then
+      result = Expr()
+      t = @scan.getToken
+      if t.type == :rparen then
+        return result
+      end
+
+      puts "Parser Error: expected ) found: #{t.lex}, at line: #{t.line}, col: #{t.col}"
+      raise ParseError.new
+    end
+
+    puts "Parser Error: expected number, R or ( found: #{t.lex}, at line: #{t.line}, col: #{t.col}"
+    raise ParseError.new
+  end         
+
+end

data/lib/scanner.rb

@@ -0,0 +1,128 @@
+require 'stringio'
+require 'calcex'
+
+class Scanner
+  def initialize(inStream)
+    @istream = inStream
+    @keywords = Set.new(%w{S R})
+    @lineCount = 1
+    @colCount = -1
+    @needToken = true
+    @lastToken = nil
+  end
+  
+  def putBackToken
+    @needToken = false
+  end
+
+  def getToken
+    #if !@needToken
+    unless @needToken
+      @needToken = true
+      return @lastToken
+    end
+    
+    state = 0
+    foundOne = false
+    c = @istream.getc
+    
+    if @istream.eof? then
+      @lastToken = Token.new(:eof,@lineCount,@colCount)
+      return @lastToken
+    end
+    
+    until foundOne
+      @colCount += @colCount 
+      case state
+      when 0
+        lex = ""
+        column = @colCount
+        line = @lineCount
+        if isLetter(c) then state=1
+        elsif isDigit(c) then state=2
+        elsif c == ?+ then state = 3
+        elsif c == ?- then state = 4
+        elsif c == ?* then state = 5
+        elsif c == ?/ then state = 6
+        elsif c == ?( then state = 7
+        elsif c == ?) then state = 8
+        elsif c == ?\n then 
+          @colCount = -1
+          @lineCount = @lineCount+1
+        elsif isWhiteSpace(c) then state = state #ignore whitespace
+        elsif @istream.eof() then
+          @foundOne = true
+          type = :eof
+        else
+          puts "Unrecognized Token found at line ",line," and column ",column,"\n"
+          raise UnrecognizedTokenException # "Unrecognized Token"
+        end
+      when 1
+        if isLetter(c) or isDigit(c) then state = 1
+        else
+          if @keywords.include?(lex) then
+            foundOne = true
+            type = :keyword
+          else
+            foundOne = true
+            type = :identifier
+          end
+        end
+      when 2
+        if isDigit(c) then state = 2
+        else
+          type = :number
+          foundOne = true
+        end
+      when 3
+        type = :add
+        foundOne = true
+      when 4
+        type = :sub
+        foundOne = true
+      when 5
+        type = :times
+        foundOne = true
+      when 6
+        type = :divide
+        foundOne = true
+      when 7
+        type = :lparen
+        foundOne = true
+      when 8
+        type = :rparen
+        foundOne = true
+      end
+
+      if !foundOne then
+        lex.concat(c)
+        c = @istream.getc()
+      end
+
+    end
+   
+    @istream.ungetc(c)   
+    @colCount = @colCount - 1
+    if type == :number or type == :identifier or type == :keyword then
+      t = LexicalToken.new(type,lex,line,column)
+    else
+      t = Token.new(type,line,column)
+    end
+
+    @lastToken = t
+    return t 
+  end
+
+  private
+  def isLetter(c) 
+    return ((?a <= c and c <= ?z) or (?A <= c and c <= ?Z))
+  end
+  
+  def isDigit(c)
+    return (?0 <= c and c <= ?9)
+  end
+  
+  def isWhiteSpace(c)
+    return (c == ?\  or c == ?\n or c == ?\t)
+  end
+end

data/lib/token.rb

@@ -0,0 +1,19 @@
+class Token
+  attr_reader :type, :line, :col
+
+  def initialize(type,lineNum,colNum)
+    @type = type
+    @line = lineNum
+    @col = colNum
+  end
+end
+
+class LexicalToken < Token
+  attr_reader :lex
+  
+  def initialize(type,lex,lineNum,colNum)
+    super(type,lineNum,colNum)
+    
+    @lex = lex
+  end
+end

metadata

@@ -0,0 +1,51 @@
+--- !ruby/object:Gem::Specification
+name: calc_lmejiav6
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Kent D. Lee - Juan Francisco Cardona Mc - Laura Mejia
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-11-12 00:00:00.000000000 Z
+dependencies: []
+description: A calculator implementation on ruby
+email: lmejiav6@eafit.edu.co
+executables:
+- calc
+extensions: []
+extra_rdoc_files: []
+files:
+- bin/calc
+- lib/ast.rb
+- lib/calcex.rb
+- lib/calculator.rb
+- lib/parser.rb
+- lib/scanner.rb
+- lib/token.rb
+homepage: http://www1.eafit.edu.co/fcardona/cursos/st0244/rubycal
+licenses:
+- ARTISTIC
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.4.7
+signing_key: 
+specification_version: 4
+summary: Another calculator in ruby
+test_files: []