jfranc38-rubycalc 0.0.2
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +7 -0
- data/bin/rubycalc +22 -0
- data/lib/ast.rb +95 -0
- data/lib/calcex.rb +3 -0
- data/lib/calculator.rb +16 -0
- data/lib/parser.rb +126 -0
- data/lib/scanner.rb +140 -0
- data/lib/token.rb +19 -0
- metadata +51 -0
checksums.yaml
ADDED
@@ -0,0 +1,7 @@
|
|
1
|
+
---
|
2
|
+
SHA1:
|
3
|
+
metadata.gz: 10a654805f124af0fa042858cbb8b0e4fac2101c
|
4
|
+
data.tar.gz: 805ee26e9280922431a481e20a2472a7d2396a41
|
5
|
+
SHA512:
|
6
|
+
metadata.gz: 44e8d5e2e1f5bcdf88b209e4104dba1872e69a13301dc54f95dc15747eaa483385d71f1ac0aebfb7da3c7b9ea3808129c5d466ce5324d536df28be7626d159ed
|
7
|
+
data.tar.gz: 6793b690de98f76eba3673c68b88dac1533a583664963d8e930ab04ac29577cd7413e59004225e4fbb52f65cd05eddcbf9aaea6a82ac34fb96b3190bfe4ac175
|
data/bin/rubycalc
ADDED
@@ -0,0 +1,22 @@
|
|
1
|
+
#!/usr/bin/env ruby
|
2
|
+
|
3
|
+
require 'rubygems'
|
4
|
+
require 'calculator'
|
5
|
+
require 'calcex'
|
6
|
+
|
7
|
+
$stdout.print "> "
|
8
|
+
$stdout.flush
|
9
|
+
|
10
|
+
text = gets
|
11
|
+
|
12
|
+
$calc = Calculator.new()
|
13
|
+
|
14
|
+
begin
|
15
|
+
puts "= " + $calc.eval(text).to_s
|
16
|
+
rescue ParseError
|
17
|
+
puts "Parse Error"
|
18
|
+
rescue UnrecognizedTokenException
|
19
|
+
puts "UnrecognizedTokenException"
|
20
|
+
rescue
|
21
|
+
puts "Unkown exception"
|
22
|
+
end
|
data/lib/ast.rb
ADDED
@@ -0,0 +1,95 @@
|
|
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
|
+
return @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
|
+
return @left.evaluate() - @right.evaluate()
|
37
|
+
end
|
38
|
+
end
|
39
|
+
|
40
|
+
class TimesNode < BinaryNode
|
41
|
+
def initialize(left, right)
|
42
|
+
super(left,right)
|
43
|
+
end
|
44
|
+
|
45
|
+
def evaluate()
|
46
|
+
return @left.evaluate() * @right.evaluate()
|
47
|
+
end
|
48
|
+
end
|
49
|
+
|
50
|
+
class DivideNode < BinaryNode
|
51
|
+
def initialize(left, right)
|
52
|
+
super(left,right)
|
53
|
+
end
|
54
|
+
|
55
|
+
def evaluate()
|
56
|
+
return @left.evaluate() / @right.evaluate()
|
57
|
+
end
|
58
|
+
end
|
59
|
+
|
60
|
+
class ModuleNode < BinaryNode
|
61
|
+
def initialize(left, right)
|
62
|
+
super(left,right)
|
63
|
+
end
|
64
|
+
|
65
|
+
def evaluate()
|
66
|
+
return @left.evaluate() % @right.evaluate()
|
67
|
+
end
|
68
|
+
end
|
69
|
+
|
70
|
+
|
71
|
+
class NumNode
|
72
|
+
def initialize(num)
|
73
|
+
@num = num
|
74
|
+
end
|
75
|
+
|
76
|
+
def evaluate()
|
77
|
+
return @num
|
78
|
+
end
|
79
|
+
end
|
80
|
+
|
81
|
+
class StoreNode < UnaryNode
|
82
|
+
def initialize(sub)
|
83
|
+
super(sub)
|
84
|
+
end
|
85
|
+
|
86
|
+
def evaluate()
|
87
|
+
$calc.memory = @subTree.evaluate
|
88
|
+
end
|
89
|
+
end
|
90
|
+
|
91
|
+
class RecallNode
|
92
|
+
def evaluate()
|
93
|
+
$calc.memory
|
94
|
+
end
|
95
|
+
end
|
data/lib/calcex.rb
ADDED
data/lib/calculator.rb
ADDED
data/lib/parser.rb
ADDED
@@ -0,0 +1,126 @@
|
|
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 public protected
|
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
|
+
# Write your Term() code here. This code is just temporary
|
51
|
+
# so you can try the calculator out before finishing it.
|
52
|
+
|
53
|
+
# t = @scan.getToken()
|
54
|
+
|
55
|
+
# if t.type == :number then
|
56
|
+
# val = t.lex.to_i
|
57
|
+
# return NumNode.new(val)
|
58
|
+
# end
|
59
|
+
|
60
|
+
# puts "Term not implemented\n"
|
61
|
+
|
62
|
+
# raise ParseError.new
|
63
|
+
|
64
|
+
end
|
65
|
+
|
66
|
+
def RestTerm(e)
|
67
|
+
t = @scan.getToken()
|
68
|
+
if t.type == :times then
|
69
|
+
return RestTerm(TimesNode.new(e, Storable()))
|
70
|
+
end
|
71
|
+
|
72
|
+
if t.type == :divide then
|
73
|
+
return RestTerm(DivideNode.new(e, Storable()))
|
74
|
+
end
|
75
|
+
|
76
|
+
@scan.putBackToken
|
77
|
+
|
78
|
+
return e
|
79
|
+
end
|
80
|
+
|
81
|
+
def Storable()
|
82
|
+
fact = Factor()
|
83
|
+
|
84
|
+
t = @scan.getToken()
|
85
|
+
|
86
|
+
if t.type == :keyword then
|
87
|
+
if t.lex == "S" then
|
88
|
+
return StoreNode.new(fact)
|
89
|
+
else
|
90
|
+
raise ParseError.new
|
91
|
+
end
|
92
|
+
end
|
93
|
+
@scan.putBackToken()
|
94
|
+
return fact
|
95
|
+
end
|
96
|
+
|
97
|
+
def Factor()
|
98
|
+
|
99
|
+
t = @scan.getToken
|
100
|
+
|
101
|
+
if t.type == :number then
|
102
|
+
return NumNode.new(t.lex.to_i)
|
103
|
+
end
|
104
|
+
|
105
|
+
if t.type == :keyword then
|
106
|
+
if t.lex == "R" then
|
107
|
+
return RecallNode.new
|
108
|
+
else
|
109
|
+
raise ParseError.new
|
110
|
+
end
|
111
|
+
end
|
112
|
+
|
113
|
+
if t.type == :lparen then
|
114
|
+
expr = Expr()
|
115
|
+
t = @scan.getToken
|
116
|
+
if t.type == :rparen then
|
117
|
+
return expr
|
118
|
+
else
|
119
|
+
raise ParseError.new
|
120
|
+
end
|
121
|
+
end
|
122
|
+
|
123
|
+
raise ParseError.new
|
124
|
+
|
125
|
+
end
|
126
|
+
end
|
data/lib/scanner.rb
ADDED
@@ -0,0 +1,140 @@
|
|
1
|
+
require 'stringio'
|
2
|
+
require 'calcex'
|
3
|
+
require 'set'
|
4
|
+
|
5
|
+
class Scanner
|
6
|
+
def initialize(inStream)
|
7
|
+
@istream = inStream
|
8
|
+
@keywords = Set.new(["S","R"])
|
9
|
+
@lineCount = 1
|
10
|
+
@colCount = -1
|
11
|
+
@needToken = true
|
12
|
+
@lastToken = nil
|
13
|
+
end
|
14
|
+
|
15
|
+
def putBackToken()
|
16
|
+
@needToken = false
|
17
|
+
end
|
18
|
+
|
19
|
+
def getToken()
|
20
|
+
unless @needToken then
|
21
|
+
@needToken = true
|
22
|
+
return @lastToken
|
23
|
+
end
|
24
|
+
|
25
|
+
state = 0
|
26
|
+
foundOne = false
|
27
|
+
c = @istream.getc()
|
28
|
+
|
29
|
+
if @istream.eof() then
|
30
|
+
@lastToken = Token.new(:eof,@lineCount,@colCount)
|
31
|
+
return @lastToken
|
32
|
+
end
|
33
|
+
|
34
|
+
until foundOne do
|
35
|
+
@colCount = @colCount + 1
|
36
|
+
case state
|
37
|
+
when 0
|
38
|
+
lex = ""
|
39
|
+
column = @colCount
|
40
|
+
line = @lineCount
|
41
|
+
if isLetter(c) then state=1
|
42
|
+
elsif isDigit(c) then state=2
|
43
|
+
elsif c == ?+ then state = 3
|
44
|
+
elsif c == ?- then state = 4
|
45
|
+
elsif c == ?* then state = 5
|
46
|
+
elsif c == ?/ then state = 6
|
47
|
+
elsif c == ?( then state = 7
|
48
|
+
elsif c == ?) then state = 8
|
49
|
+
elsif c == ?\n then
|
50
|
+
@colCount = -1
|
51
|
+
@lineCount = @lineCount+1
|
52
|
+
elsif isWhiteSpace(c) then state = state #ignore whitespace
|
53
|
+
elsif @istream.eof() then
|
54
|
+
@foundOne = true
|
55
|
+
type = :eof
|
56
|
+
else
|
57
|
+
puts "Unrecognized Token found at line ",line," and column ",column,"\n"
|
58
|
+
raise UnrecognizedTokenException # "Unrecognized Token"
|
59
|
+
end
|
60
|
+
when 1
|
61
|
+
if isLetter(c) or isDigit(c) then state = 1
|
62
|
+
else
|
63
|
+
if @keywords.include?(lex) then
|
64
|
+
foundOne = true
|
65
|
+
type = :keyword
|
66
|
+
else
|
67
|
+
foundOne = true
|
68
|
+
type = :identifier
|
69
|
+
end
|
70
|
+
end
|
71
|
+
when 2
|
72
|
+
if isDigit(c) then state = 2
|
73
|
+
else
|
74
|
+
type = :number
|
75
|
+
foundOne = true
|
76
|
+
end
|
77
|
+
when 3
|
78
|
+
type = :add
|
79
|
+
foundOne = true
|
80
|
+
when 4
|
81
|
+
type = :sub
|
82
|
+
foundOne = true
|
83
|
+
when 5
|
84
|
+
type = :times
|
85
|
+
foundOne = true
|
86
|
+
when 6
|
87
|
+
type = :divide
|
88
|
+
foundOne = true
|
89
|
+
when 7
|
90
|
+
type = :lparen
|
91
|
+
foundOne = true
|
92
|
+
when 8
|
93
|
+
type = :rparen
|
94
|
+
foundOne = true
|
95
|
+
end
|
96
|
+
|
97
|
+
if !foundOne then
|
98
|
+
lex.concat(c)
|
99
|
+
c = @istream.getc()
|
100
|
+
end
|
101
|
+
|
102
|
+
end
|
103
|
+
|
104
|
+
@istream.ungetc(c)
|
105
|
+
@colCount = @colCount - 1
|
106
|
+
if type == :number or type == :identifier or type == :keyword then
|
107
|
+
t = LexicalToken.new(type,lex,line,column)
|
108
|
+
else
|
109
|
+
t = Token.new(type,line,column)
|
110
|
+
end
|
111
|
+
|
112
|
+
@lastToken = t
|
113
|
+
return t
|
114
|
+
end
|
115
|
+
|
116
|
+
private
|
117
|
+
def isLetter(c)
|
118
|
+
if c.nil?
|
119
|
+
false
|
120
|
+
else
|
121
|
+
((?a <= c and c <= ?z) or (?A <= c and c <= ?Z))
|
122
|
+
end
|
123
|
+
end
|
124
|
+
|
125
|
+
def isDigit(c)
|
126
|
+
if c.nil?
|
127
|
+
return false
|
128
|
+
else
|
129
|
+
?0 <= c and c <= ?9
|
130
|
+
end
|
131
|
+
end
|
132
|
+
|
133
|
+
def isWhiteSpace(c)
|
134
|
+
if c.nil?
|
135
|
+
false
|
136
|
+
else
|
137
|
+
(c == ?\ or c == ?\n or c == ?\t)
|
138
|
+
end
|
139
|
+
end
|
140
|
+
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: jfranc38-rubycalc
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 0.0.2
|
5
|
+
platform: ruby
|
6
|
+
authors:
|
7
|
+
- Kent D. Lee - Juan Francisco Cardona Mc - Julio Cesar Franco
|
8
|
+
autorequire:
|
9
|
+
bindir: bin
|
10
|
+
cert_chain: []
|
11
|
+
date: 2016-05-11 00:00:00.000000000 Z
|
12
|
+
dependencies: []
|
13
|
+
description: An implementation of a basic calculator on ruby
|
14
|
+
email: fcardona@eafit.edu.co - jfranc38@eafit.edu.co
|
15
|
+
executables:
|
16
|
+
- rubycalc
|
17
|
+
extensions: []
|
18
|
+
extra_rdoc_files: []
|
19
|
+
files:
|
20
|
+
- bin/rubycalc
|
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: []
|