1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
## This file is part of PyANTLR. See LICENSE.txt for license
## details..........Copyright (C) Wolfgang Haefelinger, 2004.
##
## $Id$
import sys
import antlr
class Parser(antlr.LLkParser):
def __init__(self,*args):
super(Parser,self).__init__(*args)
self.num_err = 0
self.num_wrn = 0
def reportError(self,err):
self.num_err += 1
super(Parser,self).reportError(err)
def reportWarning(self,err):
self.num_wrn += 1
super(Parser,self).reportWarning(err)
class Walker(antlr.TreeParser):
def __init__(self,*args):
super(Walker,self).__init__(*args)
self.depth = 0
def tofloat(self,ast):
s = ast.getText()
return float(s)
def howmanysiblings(self,ast):
if ast == None:
return -1
r = 0
ast = ast.getNextSibling()
while(ast != None) :
r += 1
ast = ast.getNextSibling()
return r
def traceIn(self,s,ast) :
self.depth += 1
print ">" * self.depth
print " " + s + "( `"
if (ast==None):
print("()")
else:
print(ast.toStringList())
print " ') | siblings:",self.howmanysiblings(ast)
def traceOut(self,s,ast):
self.depth += 1
print(">" * self.depth)
print(" " + s + "( `")
if (ast==None):
print("()")
else:
print(ast.toStringList())
print(" ')")
self.depth -= 1
class TNode(antlr.CommonAST):
def __init__(self,token=None):
antlr.CommonAST.__init__(self,token)
### change printing style
def toStringTree(self):
ts = ""
kid = self.getFirstChild()
if kid:
ts += "{"
ts += " " + self.toString()
if kid:
ts += kid.toStringList()
ts += "}"
return ts
class BodyNode(antlr.CommonAST):
def __init__(self,token=None):
antlr.CommonAST.__init__(self,token)
### change printing style
def toStringTree(self):
ts = "BODY: "
kid = self.getFirstChild()
if kid:
ts += "{"
ts += " " + self.toString()
if kid:
ts += kid.toStringList()
ts += "}"
return ts
class ExprNode(antlr.CommonAST):
def __init__(self,token=None):
antlr.CommonAST.__init__(self,token)
### change printing style
def toStringTree(self):
ts = "EXPR: "
kid = self.getFirstChild()
if kid:
ts += "{"
ts += " " + self.toString()
if kid:
ts += kid.toStringList()
ts += "}"
return ts
class NumberNode(antlr.CommonAST):
def __init__(self,token=None):
antlr.CommonAST.__init__(self,token)
### change printing style
def toStringTree(self):
ts = "NUMBER: "
kid = self.getFirstChild()
if kid:
ts += "{"
ts += " " + self.toString()
if kid:
ts += kid.toStringList()
ts += "}"
return ts
class Visitor(antlr.ASTVisitor):
def __init__(self,*args):
super(Visitor,self).__init__(*args)
self.level = 0
if not args:
self.cout = sys.stdout
return
if isinstance(args[0],file):
self.cout = args[0]
return
assert 0
def tabs(self):
print " " * self.level
def printf(self,fmt,*args):
if not args:
sys.stdout.write(fmt)
return
argv = tuple(args)
self.cout.write(fmt % argv)
def flush(self):
self.cout.flush()
def visit1(self,node):
if not node:
self.printf(" nil ")
return
c = node.getType()
t = node.getText()
k = node.getFirstChild()
s = node.getNextSibling()
self.printf("( <%s> ",c)
if t:
self.printf(" %s ",t)
self.visit1(k);
self.visit1(s);
self.printf(")")
def visit(self,node):
self.visit1(node);
self.printf("\n")
def main():
import CalcLexer
import CalcParser
import CalcWalker
L = CalcLexer.Lexer()
P = CalcParser.Parser(L)
P.setFilename(L.getFilename())
### Parse the input expression
P.body()
if(P.num_err>0):
print "*** " + P.num_err + " error(s) while parsing."
print ">>> exit(1)"
import sys
sys.exit(1)
ast = P.getAST()
if not ast:
print "stop - no AST generated."
import sys
sys.exit(1)
###show tree
print "Tree: " + ast.toStringTree()
print "List: " + ast.toStringList()
print "Node: " + ast.toString()
print "visit>>"
visitor = Visitor()
visitor.visit(ast);
print "visit<<"
W = CalcWalker.Walker()
s = W.body(ast)
print "*sum =>",s
if __name__ == "__main__":
main()
|
