-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmy_interpreter.py
313 lines (275 loc) · 8.15 KB
/
my_interpreter.py
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
from copy import deepcopy
from decimal import Decimal
from collections import OrderedDict
from collections import Iterable
from enum import Enum
from my_visitor import NodeVisitor
from my_ast import FuncDecl
from my_ast import VarDecl
from my_ast import Else
from my_grammar import *
# The Interpreter has been abandoned for now. Maybe I'll get back to it if I see a use for it
class Interpreter(NodeVisitor):
def __init__(self, file_name=None):
super().__init__()
self.file_name = file_name
def visit_program(self, node):
self.visit(node.block)
def visit_compound(self, node):
for child in node.children:
temp = self.visit(child)
if temp is not None:
return temp
def visit_typedeclaration(self, node):
pass
def visit_vardecl(self, node):
self.define(node.var_node.value, None)
def visit_type(self, node):
return self.search_scopes(node.value)
def visit_noop(self, node):
pass
def visit_if(self, node):
for x, comp in enumerate(node.comps):
c = self.visit(comp)
if c == TRUE:
return self.visit(node.blocks[x])
elif isinstance(comp, Else):
return self.visit(node.blocks[x])
def visit_else(self, node):
pass
def visit_while(self, node):
while self.visit(node.comp) == TRUE:
if self.visit(node.block) == BREAK:
break
def visit_for(self, node):
iterator = self.visit(node.iterator)
for x in iterator:
if isinstance(x, Iterable) and not isinstance(x, str):
if len(x) != len(node.elements):
raise SyntaxError('file={} line={}: Unpacking to wrong number of elements. elements: {}, container length: {}'.format(self.file_name, node.line_num, len(node.elements), len(x)))
for y, element in enumerate(node.elements):
self.define(element.value, x[y])
else:
self.define(node.elements[0].value, x)
self.visit(node.block)
def visit_loopblock(self, node):
for child in node.children:
temp = self.visit(child)
if temp == CONTINUE or temp == BREAK:
return temp
def visit_switch(self, node):
switch_var = self.visit(node.value)
cases = OrderedDict() # TODO: see if a list will work instead
for case in node.cases:
if case.value == DEFAULT:
cases[DEFAULT] = case.block
else:
cases[self.visit(case.value)] = case.block
if switch_var not in cases:
switch_var = DEFAULT
index = list(cases.keys()).index(switch_var)
c = list(cases.values())
result = None
while result != BREAK and index < len(c):
result = self.visit(c[index])
index += 1
def visit_case(self, node):
pass
@staticmethod
def visit_break(_):
return BREAK
@staticmethod
def visit_continue(_):
return CONTINUE
@staticmethod
def visit_pass(_):
return
def visit_binop(self, node):
op = node.op.value
left = self.visit(node.left)
right = self.visit(node.right)
if op == PLUS:
return left + right
elif op == MINUS:
return left - right
elif op == MUL:
return left * right
elif op == FLOORDIV:
return left // right
elif op == DIV:
return Decimal(left / right)
elif op == MOD:
return left % right
elif op == POWER:
return left ** right
elif op == AND:
return left and right
elif op == OR:
return left or right
elif op == EQUALS:
return TRUE if left == right else FALSE
elif op == NOT_EQUALS:
return TRUE if left != right else FALSE
elif op == LESS_THAN:
return TRUE if left < right else FALSE
elif op == LESS_THAN_OR_EQUAL_TO:
return TRUE if left <= right else FALSE
elif op == GREATER_THAN:
return TRUE if left > right else FALSE
elif op == GREATER_THAN_OR_EQUAL_TO:
return TRUE if left >= right else FALSE
elif op == CAST:
cast_type = node.right.value
if cast_type == INT:
return int(left)
elif cast_type == DEC:
return Decimal(left)
elif cast_type == FLOAT:
return float(left)
elif cast_type == COMPLEX:
return complex(left)
elif cast_type == STR:
return str(left)
elif cast_type == BOOL:
return bool(left)
elif cast_type == BYTES:
return bytes(left)
elif cast_type == LIST:
return list(left)
elif cast_type == DICT:
return dict(left)
elif cast_type == ENUM:
return Enum(left.value)
elif cast_type in (ANY, FUNC):
raise TypeError('file={} line={}: Cannot cast to type {}'.format(self.file_name, node.line_num, cast_type))
def visit_unaryop(self, node):
op = node.op.value
if op == PLUS:
return +self.visit(node.expr)
elif op == MINUS:
return -self.visit(node.expr)
elif op == NOT:
return FALSE if self.visit(node.expr) == TRUE else TRUE
def visit_range(self, node):
left = self.visit(node.left)
right = self.visit(node.right)
return range(left, right)
def visit_assign(self, node):
if isinstance(node.left, VarDecl):
var_name = node.left.value.value
if node.left.type.value == FLOAT:
node.right.value = float(node.right.value)
else:
var_name = node.left.value
var_value = self.top_scope.get(var_name)
if var_value and isinstance(var_value, float):
node.right.value = float(node.right.value)
self.define(var_name, self.visit(node.right))
def visit_opassign(self, node):
var_name = node.left.value
op = node.op.value
right = self.visit(node.right)
if op == PLUS_ASSIGN:
self.top_scope[var_name] += right
elif op == MINUS_ASSIGN:
self.top_scope[var_name] -= right
elif op == MUL_ASSIGN:
self.top_scope[var_name] *= right
elif op == FLOORDIV_ASSIGN:
self.top_scope[var_name] //= right
elif op == DIV_ASSIGN:
self.top_scope[var_name] /= right
elif op == MOD_ASSIGN:
self.top_scope[var_name] %= right
elif op == POWER_ASSIGN:
self.top_scope[var_name] **= right
def visit_var(self, node):
return self.search_scopes(node.value)
def visit_funcdecl(self, node):
self.define(node.name.value, node)
@staticmethod
def visit_anonymousfunc(node):
return node
def visit_funccall(self, node):
if node.name.value in BUILTIN_FUNCTIONS:
args = []
for arg in node.arguments:
args.append(self.visit(arg))
self.search_scopes(node.name.value)(*args)
else:
func = deepcopy(self.search_scopes(node.name.value))
func.args = node.arguments
self.new_scope()
if hasattr(func, '_scope'):
self.top_scope.update(func._scope)
for x, key in enumerate(func.parameters.keys()):
self.define(key, self.visit(node.arguments[x]))
return_var = self.visit(func.body)
if isinstance(return_var, FuncDecl):
scope = self.top_scope
if return_var.name.value in scope:
del scope[return_var.name.value]
return_var._scope = scope
if return_var is None and func.return_type.value != VOID:
raise TypeError('file={} line={}'.format(self.file_name, node.line_num))
self.drop_top_scope()
return return_var
def visit_return(self, node):
return self.visit(node.value)
def visit_constant(self, node):
if node.value == TRUE:
return TRUE
elif node.value == FALSE:
return FALSE
elif node.value == NAN:
return Decimal(NAN)
elif node.value == INF:
return Decimal(INF)
elif node.value == NEGATIVE_INF:
return Decimal(NEGATIVE_INF)
else:
raise NotImplementedError('file={} line={}'.format(self.file_name, node.line_num))
@staticmethod
def visit_num(node):
return node.value
@staticmethod
def visit_str(node):
return node.value
def visit_collection(self, node):
items = []
for item in node.items:
items.append(self.visit(item))
if node.read_only:
return tuple(items)
return items
def visit_hashmap(self, node):
types = {}
for key, val in node.items.items():
types[key] = self.visit(val)
return types
def visit_collectionaccess(self, node):
collection = self.search_scopes(node.collection.value)
key = self.visit(node.key)
if not key:
key = node.key.value
return collection[key]
def interpret(self, tree):
return self.visit(tree)
def visit_print(self, node):
print(self.visit(node.value))
if __name__ == '__main__':
from my_lexer import Lexer
from my_parser import Parser
from my_preprocessor import Preprocessor
file = 'test.my'
code = open(file).read()
lexer = Lexer(code, file)
parser = Parser(lexer)
t = parser.parse()
symtab_builder = Preprocessor(parser.file_name)
symtab_builder.check(t)
if not symtab_builder.warnings:
interpreter = Interpreter(parser.file_name)
interpreter.interpret(t)
else:
print('Did not run')