calc_yaguirre 0.0.2

Sign up to get free protection for your applications and to get access to all the features.
checksums.yaml ADDED
@@ -0,0 +1,7 @@
1
+ ---
2
+ SHA1:
3
+ metadata.gz: e3b600ce95d5a8ad51da528d35783952a3e3315e
4
+ data.tar.gz: da89cd97744084fda0039618d8670afcce994b73
5
+ SHA512:
6
+ metadata.gz: 6b50eb5d913fee9d4ab35689b1a297316459e44a76f31a0780f4639c27560b0b8b32f2ef0c5d6bed7449034e30c70e1377f510717c8c27c2b162fa41fcc7b60a
7
+ data.tar.gz: ddd4a7d9666994a858bf90e800c19d7f3f6a02611b1dfa28550ae36ac374c9387e2aeeb07fd3f37a1d4c78d84d08e06428690ec5a857ce8a777b50aba418acbe
data/bin/calc ADDED
@@ -0,0 +1,90 @@
1
+ #!/usr/bin/env ruby
2
+
3
+ require 'rubygems'
4
+ require 'calculator'
5
+ require 'calcex'
6
+
7
+ def FoundEnvVars
8
+ $calc.changeEnvVars
9
+ ENV.each do |key, value|
10
+ if key.start_with?("CALCVAR") == true then
11
+ envVar = key.slice(7,key.size)
12
+ text = envVar + "=" + value + "\n"
13
+ makeCalc(text)
14
+ end
15
+ end
16
+ $calc.changeEnvVars()
17
+ end
18
+
19
+ def ProcesoArgumentos
20
+ args = ARGV.argv
21
+ i = 0
22
+ while i < args.size-1 do
23
+ argumento = args[i]
24
+ if argumento == "-e" then
25
+ $calc.envConf()
26
+ FoundEnvVars
27
+ elsif argumento == "-v" then
28
+ text = args[i+1] + "\n"
29
+ $calc.eval(text)
30
+ i += 1
31
+ else
32
+ linea = ARGF.readlines
33
+ linea.each do |line|
34
+ makeCol(line)
35
+ end
36
+ end
37
+ i += 1
38
+ end
39
+ end
40
+
41
+ def main
42
+ FoundEnvVars()
43
+ ProcesoArgumentos()
44
+ InteractiveMode()
45
+ end
46
+
47
+ def InteractiveMode
48
+ $stdout.print "> "
49
+ $stdout.flush
50
+ text = gets
51
+ makeCalc(text)
52
+ InteractiveMode()
53
+ end
54
+
55
+ def MakeCalc(text)
56
+ @res = $calc.eval(text)
57
+ if $calc.getChange == 1 then
58
+ puts "=> " + @res.to_s + $calc.getVars
59
+ else
60
+ puts "=> " + @res.to_s
61
+ end
62
+ $calc.setChange
63
+ $calc.cleanVars
64
+ end
65
+
66
+ $calc = Calculator.new()
67
+
68
+ $stdout.print "> "
69
+ $stdout.flush
70
+
71
+ while (text = gets)
72
+
73
+ @res = $calc.eval(text)
74
+ begin
75
+ if $calc.getChange == 1 then
76
+ puts "=> " + @res.to_s + $calc.getVars
77
+ else
78
+ puts "=> " + @res.to_s
79
+ end
80
+ $calc.setChange
81
+ $calc.cleanVars
82
+ rescue ParseError
83
+ puts "Parse Error"
84
+ rescue UnrecognizedTokenException
85
+ puts "UnrecognizedTokenException"
86
+ rescue
87
+ puts "Unkown exception"
88
+ end
89
+ $stdout.print "> "
90
+ end
data/lib/ast.rb ADDED
@@ -0,0 +1,140 @@
1
+ require 'set'
2
+
3
+ class BinaryNode
4
+ attr_reader :left, :right
5
+
6
+ def initialize(left,right)
7
+ @left = left
8
+ @right = right
9
+ end
10
+ end
11
+
12
+ class UnaryNode
13
+ attr_reader :subTree
14
+
15
+ def initialize(subTree)
16
+ @subTree = subTree
17
+ end
18
+ end
19
+
20
+ class AddNode < BinaryNode
21
+ def initialize(left, right)
22
+ super(left,right)
23
+ end
24
+
25
+ def evaluate
26
+ left.evaluate + right.evaluate
27
+ end
28
+ end
29
+
30
+ class SubNode < BinaryNode
31
+ def initialize(left, right)
32
+ super(left,right)
33
+ end
34
+
35
+ def evaluate
36
+ left.evaluate - right.evaluate
37
+ end
38
+ end
39
+
40
+ class NumNode
41
+ def initialize(num)
42
+ @num = num
43
+ end
44
+
45
+ def evaluate
46
+ @num
47
+ end
48
+ end
49
+
50
+ class TimesNode < BinaryNode
51
+ def initilize(left, right)
52
+ super(left,right)
53
+ end
54
+
55
+ def evaluate
56
+ left.evaluate * right.evaluate
57
+ end
58
+ end
59
+
60
+ class DivideNode < BinaryNode
61
+ def initilize(left, right)
62
+ super(left,right)
63
+ end
64
+
65
+ def evaluate
66
+ left.evaluate / right.evaluate
67
+ end
68
+ end
69
+
70
+ class ModNode < BinaryNode
71
+ def initialize(left, right)
72
+ super(left,right)
73
+ end
74
+
75
+ def evaluate
76
+ left.evaluate % right.evaluate
77
+ end
78
+ end
79
+
80
+ class StoreNode < UnaryNode
81
+ def initilize (sub)
82
+ super sub
83
+ end
84
+
85
+ def evaluate
86
+ $calc.memory = subTree.evaluate
87
+ end
88
+ end
89
+
90
+ class PlusNode < UnaryNode
91
+ def initialize (sub)
92
+ super sub
93
+ end
94
+
95
+ def evaluate
96
+ $calc.memory += subTree.evaluate
97
+ end
98
+ end
99
+
100
+ class MinusNode < UnaryNode
101
+ def initialize (sub)
102
+ super sub
103
+ end
104
+
105
+ def evaluate
106
+ $calc.memory -= subTree.evaluate
107
+ end
108
+ end
109
+
110
+ class ClearNode
111
+ def evaluate
112
+ $calc.memory = 0
113
+ end
114
+ end
115
+
116
+ class RecallNode
117
+ def evaluate
118
+ $calc.memory
119
+ end
120
+ end
121
+
122
+ class SetNode < UnaryNode
123
+ def initialize(sub,name)
124
+ super sub
125
+ @name = name
126
+ end
127
+ def evaluate
128
+ @val = subTree.evaluate
129
+ $calc.set(@val,@name)
130
+ end
131
+ end
132
+
133
+ class GetNode
134
+ def initialize(key)
135
+ @key = key
136
+ end
137
+ def evaluate
138
+ $calc.get(@key)
139
+ end
140
+ end
data/lib/calcex.rb ADDED
@@ -0,0 +1,3 @@
1
+
2
+ class ParseError < Exception; end
3
+ class UnrecognizedTokenException < Exception; end
data/lib/calculator.rb ADDED
@@ -0,0 +1,72 @@
1
+ require 'parser'
2
+ require 'ast'
3
+ require 'stringio'
4
+
5
+ class Calculator
6
+ attr_accessor :memory, :Vars
7
+
8
+ def initialize()
9
+ @memory = 0
10
+ @Vars = Hash.new
11
+ @caracter = ""
12
+ @count = 0
13
+ @change = 0
14
+ @useEnvVars = false
15
+ @changeEnvVars = false
16
+ end
17
+
18
+ def eval(expr)
19
+ parser = Parser.new(StringIO.new(expr))
20
+ ast = parser.parse()
21
+ return ast.evaluate
22
+ end
23
+
24
+ def set(value, name)
25
+ @change = 1
26
+ if @count == 0 then
27
+ @caracter += "#{name} <- #{value}"
28
+ else
29
+ @caracter += ", #{name} <- #{value}"
30
+ end
31
+ @count += 1
32
+ @Vars[name] = value
33
+ end
34
+
35
+ def get(name)
36
+ tem = @Vars[name]
37
+ if tem != nil then
38
+ return tem.to_i
39
+ else
40
+ return 0
41
+ end
42
+ end
43
+
44
+ def getVars
45
+ return " [" + @caracter + "]"
46
+ end
47
+
48
+ def envConf
49
+ @useEnvVars = true
50
+ end
51
+
52
+ def cleanVars
53
+ @count = 0
54
+ @caracter = ""
55
+ end
56
+
57
+ def changeEnvVars
58
+ if @changeEnvVars == true then
59
+ @changeEnvVars = false
60
+ else
61
+ @changeEnvVars = true
62
+ end
63
+ end
64
+
65
+ def setChange
66
+ @change = 0
67
+ end
68
+
69
+ def getChange
70
+ return @change
71
+ end
72
+ end
data/lib/parser.rb ADDED
@@ -0,0 +1,154 @@
1
+ require 'ast'
2
+ require 'scanner'
3
+ require 'token'
4
+ require 'calcex'
5
+
6
+ class Parser
7
+ def initialize(istream)
8
+ @scan = Scanner.new(istream)
9
+ end
10
+
11
+ def parse()
12
+ return Prog()
13
+ end
14
+
15
+ private
16
+ def Prog()
17
+ result = Expr()
18
+ t = @scan.getToken()
19
+
20
+ if t.type != :eof then
21
+ print "Expected EOF. Found ", t.type, ".\n"
22
+ raise ParseError.new
23
+ end
24
+
25
+ return result
26
+ end
27
+
28
+ def Expr()
29
+ return RestExpr(Term())
30
+ end
31
+
32
+ def RestExpr(e)
33
+ t = @scan.getToken()
34
+
35
+ if t.type == :add then
36
+ return RestExpr(AddNode.new(e,Term()))
37
+ end
38
+
39
+ if t.type == :sub then
40
+ return RestExpr(SubNode.new(e,Term()))
41
+ end
42
+
43
+ @scan.putBackToken()
44
+
45
+ return e
46
+ end
47
+
48
+ def Term()
49
+ RestTerm(Storable())
50
+ end
51
+
52
+ def RestTerm(e)
53
+ t= @scan.getToken
54
+
55
+ if t.type == :times then
56
+ return RestTerm(TimesNode.new(e, Storable()))
57
+ end
58
+
59
+ if t.type == :divides then
60
+ return RestTerm(DivideNode.new(e, Storable()))
61
+ end
62
+
63
+ if t.type == :mod then
64
+ return RestTerm(ModNode.new(e, Storable()))
65
+ end
66
+
67
+ @scan.putBackToken
68
+ e
69
+ end
70
+
71
+ def Storable()
72
+ return MemOperation(Factor())
73
+ end
74
+
75
+ def MemOperation(a)
76
+ t = @scan.getToken
77
+
78
+ if t.type == :keyword then
79
+ if t.lex == "P" then
80
+ return PlusNode.new(a)
81
+ end
82
+
83
+ if t.lex == "M" then
84
+ return MinusNode.new(a)
85
+ end
86
+
87
+ if t.lex == "S" then
88
+ return StoreNode.new(a)
89
+ end
90
+
91
+ puts "Expected S, M, P found: " + t.lex
92
+ raise ParseError.new
93
+ end
94
+
95
+ @scan.putBackToken
96
+ a
97
+ end
98
+
99
+
100
+ def Factor()
101
+ t = @scan.getToken
102
+
103
+ if t.type == :number then
104
+ return NumNode.new t.lex.to_i
105
+ end
106
+
107
+ if t.type == :keyword then
108
+ if t.lex == "R" then
109
+ return RecallNode.new
110
+ end
111
+
112
+ if t.lex == "C" then
113
+ return ClearNode.new
114
+ end
115
+ puts "Expected R, C found: " + t.lex
116
+ raise ParseError.new
117
+ end
118
+
119
+ if t.type == :lparen then
120
+ result = Expr()
121
+ t = @scan.getToken
122
+ if t.type == :rparen then
123
+ return result
124
+ end
125
+ puts "Expected ) found: " + t.type.to_s
126
+ raise ParseError.new
127
+ end
128
+
129
+ if t.type == :identifier then
130
+ return Assignable(t.lex.to_s)
131
+ end
132
+
133
+ puts "Expected number, R, (, identifier found: " + t.type.to_s
134
+ raise ParseError.new
135
+ end
136
+
137
+ def Assignable(name)
138
+ t = @scan.getToken
139
+
140
+ if t.type == :assign then
141
+ return Assign(name)
142
+ end
143
+
144
+ @scan.putBackToken
145
+ return GetNode.new(name)
146
+ end
147
+
148
+ def Assign(name)
149
+ result = Expr()
150
+ return SetNode.new(result, name)
151
+
152
+ @scan.putBackToken
153
+ end
154
+ end
data/lib/scanner.rb ADDED
@@ -0,0 +1,135 @@
1
+ require 'stringio'
2
+ require 'calcex'
3
+
4
+ class Scanner
5
+ def initialize(inStream)
6
+ @istream = inStream
7
+ @keywords = Set.new(["S","R","P","M","C"])
8
+ @lineCount = 1
9
+ @colCount = -1
10
+ @needToken = true
11
+ @lastToken = nil
12
+ end
13
+
14
+ def putBackToken()
15
+ @needToken = false
16
+ end
17
+
18
+ def getToken()
19
+ if !@needToken
20
+ @needToken = true
21
+ return @lastToken
22
+ end
23
+
24
+ state = 0
25
+ foundOne = false
26
+ c = @istream.getc()
27
+
28
+ if @istream.eof() then
29
+ @lastToken = Token.new(:eof,@lineCount,@colCount)
30
+ return @lastToken
31
+ end
32
+
33
+ while !foundOne
34
+ @colCount = @colCount + 1
35
+ case state
36
+ when 0
37
+ lex = ""
38
+ column = @colCount
39
+ line = @lineCount
40
+ if isLetter(c) then state=1
41
+ elsif isDigit(c) then state=2
42
+ elsif c == ?+ then state = 3
43
+ elsif c == ?- then state = 4
44
+ elsif c == ?* then state = 5
45
+ elsif c == ?/ then state = 6
46
+ elsif c == ?( then state = 7
47
+ elsif c == ?) then state = 8
48
+ elsif c == ?% then state = 9
49
+ elsif c == ?= then state = 10
50
+ elsif c == ?\n then
51
+ @colCount = -1
52
+ @lineCount = @lineCount+1
53
+ elsif isWhiteSpace(c) then state = state #ignore whitespace
54
+ elsif @istream.eof() then
55
+ @foundOne = true
56
+ type = :eof
57
+ else
58
+ puts "Unrecognized Token found at line ",line," and column ",column,"\n"
59
+ raise UnrecognizedTokenException # "Unrecognized Token"
60
+ end
61
+ when 1
62
+ if isLetter(c) or isDigit(c) then state = 1
63
+ else
64
+ if @keywords.include?(lex) then
65
+ foundOne = true
66
+ type = :keyword
67
+ else
68
+ foundOne = true
69
+ type = :identifier
70
+ end
71
+ end
72
+ when 2
73
+ if isDigit(c) then state = 2
74
+ else
75
+ type = :number
76
+ foundOne = true
77
+ end
78
+ when 3
79
+ type = :add
80
+ foundOne = true
81
+ when 4
82
+ type = :sub
83
+ foundOne = true
84
+ when 5
85
+ type = :times
86
+ foundOne = true
87
+ when 6
88
+ type = :divide
89
+ foundOne = true
90
+ when 7
91
+ type = :lparen
92
+ foundOne = true
93
+ when 8
94
+ type = :rparen
95
+ foundOne = true
96
+ when 9
97
+ type = :mod
98
+ foundOne = true
99
+ when 10
100
+ type = :assign
101
+ foundOne = true
102
+ end
103
+
104
+ if !foundOne then
105
+ lex.concat(c)
106
+ c = @istream.getc()
107
+ end
108
+
109
+ end
110
+
111
+ @istream.ungetc(c)
112
+ @colCount = @colCount - 1
113
+ if type == :number or type == :identifier or type == :keyword then
114
+ t = LexicalToken.new(type,lex,line,column)
115
+ else
116
+ t = Token.new(type,line,column)
117
+ end
118
+
119
+ @lastToken = t
120
+ return t
121
+ end
122
+
123
+ private
124
+ def isLetter(c)
125
+ return ((?a <= c and c <= ?z) or (?A <= c and c <= ?Z))
126
+ end
127
+
128
+ def isDigit(c)
129
+ return (?0 <= c and c <= ?9)
130
+ end
131
+
132
+ def isWhiteSpace(c)
133
+ return (c == ?\ or c == ?\n or c == ?\t)
134
+ end
135
+ end
data/lib/token.rb ADDED
@@ -0,0 +1,19 @@
1
+ class Token
2
+ attr_reader :type, :line, :col
3
+
4
+ def initialize(type,lineNum,colNum)
5
+ @type = type
6
+ @line = lineNum
7
+ @col = colNum
8
+ end
9
+ end
10
+
11
+ class LexicalToken < Token
12
+ attr_reader :lex
13
+
14
+ def initialize(type,lex,lineNum,colNum)
15
+ super(type,lineNum,colNum)
16
+
17
+ @lex = lex
18
+ end
19
+ end
metadata ADDED
@@ -0,0 +1,51 @@
1
+ --- !ruby/object:Gem::Specification
2
+ name: calc_yaguirre
3
+ version: !ruby/object:Gem::Version
4
+ version: 0.0.2
5
+ platform: ruby
6
+ authors:
7
+ - Kent D. Lee - Juan Francisco Cardona Mc
8
+ autorequire:
9
+ bindir: bin
10
+ cert_chain: []
11
+ date: 2015-10-10 00:00:00.000000000 Z
12
+ dependencies: []
13
+ description: An calculator implementation on ruby
14
+ email: yaguirre@eafit.edu.co
15
+ executables:
16
+ - calc
17
+ extensions: []
18
+ extra_rdoc_files: []
19
+ files:
20
+ - bin/calc
21
+ - lib/ast.rb
22
+ - lib/calcex.rb
23
+ - lib/calculator.rb
24
+ - lib/parser.rb
25
+ - lib/scanner.rb
26
+ - lib/token.rb
27
+ homepage: http://www1.eafit.edu.co/fcardona/cursos/st0244/rubycal
28
+ licenses:
29
+ - ARTISTIC
30
+ metadata: {}
31
+ post_install_message:
32
+ rdoc_options: []
33
+ require_paths:
34
+ - lib
35
+ required_ruby_version: !ruby/object:Gem::Requirement
36
+ requirements:
37
+ - - ">="
38
+ - !ruby/object:Gem::Version
39
+ version: '0'
40
+ required_rubygems_version: !ruby/object:Gem::Requirement
41
+ requirements:
42
+ - - ">="
43
+ - !ruby/object:Gem::Version
44
+ version: '0'
45
+ requirements: []
46
+ rubyforge_project:
47
+ rubygems_version: 2.4.8
48
+ signing_key:
49
+ specification_version: 4
50
+ summary: Another calculator in ruby
51
+ test_files: []