-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAST.py
More file actions
378 lines (298 loc) · 10.4 KB
/
AST.py
File metadata and controls
378 lines (298 loc) · 10.4 KB
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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
import logging
from graphviz import Digraph
from QuackChecker import *
logging.basicConfig()
log = logging.getLogger(__name__)
log.setLevel(logging.DEBUG)
class ASTNode:
def __init__(self):
self.children = []
print(f"init ASTNode of class {self.__class__.__name__}")
def walk(self):
for child in self.children:
child.walk()
def __repr__(self):
return repr(self.__dict__)
def code_gen(self, buffer):
raise NotImplemented("AST BASE CLASS")
def to_graphviz(self, graph=None, parent_id=None):
if graph is None:
graph = Digraph()
node_id = str(id(self))
# old way to make label
label = self.__class__.__name__
if isinstance(self, OpHelp):
label += f' ({self.op})'
elif isinstance(self, NumberNode):
label += f' ({self.value})'
elif isinstance(self, IdentNode):
label += f' ({self.name})'
elif isinstance(self, VarNode):
label += f' ({self.name})'
graph.node(node_id, label)
if parent_id is not None:
graph.edge(parent_id, node_id)
for child in self.children:
print(type(self))
print(type(child))
child.to_graphviz(graph, node_id)
return graph
class ProgramNode(ASTNode):
def __init__(self, statements):
self.statements = statements
self.children = statements
def code_gen(self):
buffer = []
buffer.append(".class $Main:Obj")
buffer.append(".method $constructor")
buffer.append(".local ")
for child in self.children:
child.code_gen(buffer)
return buffer
class AssigNode(ASTNode):
#TODO: need to add support for assig without type identifier
def __init__(self, data):
#case for init with ident
self.var_name = data[0]
self.var_type = data[1]
self.value = data[2]
if data[1] is None:
del data[1]
self.children = data
#old stuff
#self.var_type = var_type
#self.var_name = var_name
#self.value = value
#self.children = [var_type, var_name, value]
def code_gen(self, buffer):
if (self.var_type == None):
buffer.append(f"{self.value.code_gen(buffer)}")
buffer.append(f"store {self.var_name.get_name()}")
else:
buffer[2] += f"{self.var_name.get_name()},"
buffer.append(f"{self.value.code_gen(buffer)}")
buffer.append(f"store {self.var_name.get_name()}")
class OpHelp(ASTNode):
def __init__(self, left, right, op):
self.left = left
self.right = right
self.op = op
self.children = [right, left]
def code_gen(self, buffer):
opDict = {
"+": "Int:plus",
"-": "Int:minus",
"/": "Int:divi",
"*": "Int:multi",
}
for child in self.children:
child.code_gen(buffer)
buffer.append(f"call {opDict[self.op]}")
def walk(self):
print(self.children)
class NumberNode(ASTNode):
def __init__(self, value):
self.value = value
self.type = "Int"
self.children = None
def walk(self):
print(self.value)
def code_gen(self, buffer):
buffer.append(f"const {self.value}")
def to_graphviz(self, graph=None, parent_id=None):
if graph is None:
graph = Digraph()
node_id = str(id(self))
label = self.__class__.__name__
graph.node(node_id, label)
if parent_id is not None:
graph.edge(parent_id, node_id)
return graph
class IdentNode(ASTNode):
def __init__(self, name):
self.name = name
self.children = None
def walk(self):
print(self.name)
def code_gen(self, buffer):
# old way, doesnt load right in situations such as x = y + 1
buffer.append(f"load {self.name}")
def code_gen_init(self, buffer):
buffer.insert(0,f".local {self.name}")
def to_graphviz(self, graph=None, parent_id=None):
if graph is None:
graph = Digraph()
node_id = str(id(self))
label = self.__class__.__name__
graph.node(node_id, label)
if parent_id is not None:
graph.edge(parent_id, node_id)
return graph
class R_ExpNode(ASTNode):
def __init__(self, expression):
self.expression = expression
self.children = [expression]
def code_gen(self, buffer):
for child in self.children:
child.code_gen(buffer)
class L_ExpNode(ASTNode):
def __init__(self, name):
self.name = name
self.children = [name]
def code_gen(self, buffer):
raise Exception(f"{self.__class__.__name__} code gen not implemented")
class VarNode(ASTNode):
def __init__(self, name):
self.name = name
self.children = None
def walk(self):
print(self.name)
def code_gen(self, buffer):
buffer.append(f"load {self.name}")
#raise Exception(f"{self.__class__.__name__} code gen not implemented")
def get_name(self):
return self.name
def to_graphviz(self, graph=None, parent_id=None):
if graph is None:
graph = Digraph()
node_id = str(id(self))
label = self.__class__.__name__
graph.node(node_id, label)
if parent_id is not None:
graph.edge(parent_id, node_id)
return graph
class If_Node(ASTNode):
def __init__(self, data):
print(f"if node data: {data}")
self.condition = data[0]
self.block = data[1]
self.else_block = data[2] if len(data) > 2 else None
self.children = data
self.label_count = 0
def code_gen(self, buffer):
# make the labels
last_label = self.label_gen()
else_label = self.label_gen() if self.else_block else last_label
#evaluate condition
self.condition.code_gen(buffer)
buffer.append(f"jump_ifnot {else_label}")
#evalute block
self.block.code_gen(buffer)
buffer.append(f"jump {last_label}")
# visit else_block if it exists
if self.else_block:
buffer.append(f"{else_label}:")
label_num = self.label_count
self.else_block.code_gen(buffer, label_num, last_label)
# last label
buffer.append(f"{last_label}:")
def label_gen(self):
if ('global_label_count' not in globals()):
#init the global label counter
global global_label_count
global_label_count = 0
label = f"label{self.label_count}"
self.label_count += 1 + global_label_count
global_label_count += 1
return label
class Else_Node(ASTNode):
def __init__(self, data):
print(f"else node node data: {data}")
if len(data) > 1:
self.condition = data[0]
self.block = data[1]
self.else_block = data[2]
else:
self.else_block = None
self.block = data[0]
self.children = data
def code_gen(self, buffer, label_num, last_label):
# pass current label number down to else
self.label_count = label_num
else_label = self.label_gen() if self.else_block else last_label
if len(self.children) > 1:
#evaluate condition
self.condition.code_gen(buffer)
buffer.append(f"jump_ifnot {else_label}")
#evalute block
self.block.code_gen(buffer)
buffer.append(f"jump {last_label}")
# visit else_block if it exists
if self.else_block:
buffer.append(f"{else_label}:")
label_num = self.label_count
self.else_block.code_gen(buffer, label_num, last_label)
else:
#evalute block
self.block.code_gen(buffer)
buffer.append(f"jump {last_label}")
def label_gen(self):
if ('global_label_count' not in globals()):
#init the global label counter
global global_label_count
global_label_count = 0
label = f"label{self.label_count}"
self.label_count += 1 + global_label_count
global_label_count += 1
return label
class Log_Exp_Node(ASTNode):
def __init__(self, left, right):
self.left = left
self.right = right
self.children = [left, right]
class Less_Than_Node(ASTNode):
def __init__(self, left, right):
self.left = left
self.right = right
self.children = [left, right]
def code_gen(self, buffer):
self.left.code_gen(buffer)
self.right.code_gen(buffer)
buffer.append(f"call Int:equals")
class Equals_Node(ASTNode):
def __init__(self, left, right):
self.left = left
self.right = right
self.children = [left, right]
def code_gen(self, buffer):
self.left.code_gen(buffer)
self.right.code_gen(buffer)
buffer.append(f"call Int:equals")
class Return_Node(ASTNode):
def __init__(self, value):
self.value = value
self.children = [value]
def code_gen(self, buffer):
self.value.code_gen(buffer)
buffer.append(f"return 1")
class While_Node(ASTNode):
def __init__(self, condition, block):
self.condition = condition
self.block = block
self.children = [condition, block]
self.label_count = 0
def code_gen(self, buffer):
# make labels for start and end of the loop
start_label = self.label_gen()
last_label = self.label_gen()
buffer.append(f"{start_label}:")
# evaluate the condition
self.condition.code_gen(buffer)
buffer.append(f"jump_ifnot {last_label}")
self.block.code_gen(buffer)
buffer.append(f"jump {start_label}")
buffer.append(f"{last_label}:")
def label_gen(self):
if ('global_label_count' not in globals()):
#init the global label counter
global global_label_count
global_label_count = 0
label = f"label_while{self.label_count}"
self.label_count += 1 + global_label_count
global_label_count += 1
return label
class Temp_Node(ASTNode):
def __init__(self, left, right):
self.left = left
self.right = right
self.children = [left, right]