-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsymbol_table_updaters.py
More file actions
237 lines (196 loc) · 8.23 KB
/
symbol_table_updaters.py
File metadata and controls
237 lines (196 loc) · 8.23 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
from lark.visitors import Interpreter
from lark import Tree, Visitor, Token
from decaf_enums import DecafTypes, Constants
from semantic_error import SemanticError
from symbol_table import SymbolTable, Variable, Type, Function, Class
stack = []
class_stack = []
def increment_data_pointer(size):
cur = SymbolTableUpdater.data_pointer
SymbolTableUpdater.data_pointer += size
return cur
class SymbolTableUpdater(Interpreter):
def __default__(self, tree):
for child in tree.children:
if isinstance(child, Tree):
child.symbol_table = tree.symbol_table
self.visit_children(tree)
data_pointer = 0
def type(self, tree):
type_name = tree.children[0].value
stack.append(Type(type_name))
def function_decl(self, tree):
function_class = None
if len(class_stack) > 0:
function_class = class_stack[-1]
return_type = Type(DecafTypes.void_type)
if isinstance(tree.children[0], Tree):
tree.children[0].symbol_table = tree.symbol_table
self.visit(tree.children[0])
return_type = stack.pop()
func_name = tree.children[1].value
formals_symbol_table = SymbolTable(parent=tree.symbol_table)
tree.children[2].symbol_table = formals_symbol_table
sp_initial = len(stack)
self.visit(tree.children[2])
formals = []
while len(stack) > sp_initial:
f = stack.pop()
formals.append(f)
formals = formals[::-1]
body_symbol_table = SymbolTable(parent=formals_symbol_table)
tree.children[3].symbol_table = body_symbol_table
self.visit(tree.children[3])
prefix_label = ''
if function_class:
prefix_label = "class_"
tree.symbol_table.add_func(Function(
name=func_name,
return_type=return_type,
formals=formals,
prefix_class=prefix_label
))
def variable(self, tree):
variable_class = None
if len(class_stack) > 0:
variable_class = class_stack[-1]
tree.children[0].symbol_table = tree.symbol_table
self.visit(tree.children[0])
var_type = stack.pop()
var_name = tree.children[1].value
var = Variable(
name=var_name,
var_type=var_type,
address=increment_data_pointer(4),
)
tree.symbol_table.add_var(var)
stack.append(var)
def array_type(self, tree):
tree.children[0].symbol_table = tree.symbol_table
self.visit(tree.children[0])
mem_type = stack.pop()
stack.append(Type("array", arr_type=mem_type))
def access_mode(self, tree):
if tree.children:
return tree.children[0].value
return 'public'
def if_stmt(self, tree):
tree.children[1].symbol_table = tree.symbol_table
self.visit(tree.children[1])
statement_block_table = SymbolTable(parent=tree.symbol_table)
tree.children[2].symbol_table = statement_block_table
self.visit(tree.children[2])
if len(tree.children) > 3:
else_statement_block_table = SymbolTable(parent=tree.symbol_table)
tree.children[4].symbol_table = else_statement_block_table
self.visit(tree.children[4])
def while_stmt(self, tree):
tree.children[1].symbol_table = tree.symbol_table
self.visit(tree.children[1])
statement_block_table = SymbolTable(parent=tree.symbol_table)
tree.children[2].symbol_table = statement_block_table
self.visit(tree.children[2])
def for_1(self, tree):
tree.children[3].symbol_table = tree.symbol_table
self.visit(tree.children[3])
statement_block_table = SymbolTable(parent=tree.symbol_table)
tree.children[6].symbol_table = statement_block_table
self.visit(tree.children[6])
def for_2(self, tree):
tree.children[2].symbol_table = tree.symbol_table
self.visit(tree.children[2])
tree.children[4].symbol_table = tree.symbol_table
self.visit(tree.children[4])
statement_block_table = SymbolTable(parent=tree.symbol_table)
tree.children[7].symbol_table = statement_block_table
self.visit(tree.children[7])
def for_3(self, tree):
tree.children[3].symbol_table = tree.symbol_table
self.visit(tree.children[3])
tree.children[5].symbol_table = tree.symbol_table
self.visit(tree.children[5])
statement_block_table = SymbolTable(parent=tree.symbol_table)
tree.children[7].symbol_table = statement_block_table
self.visit(tree.children[7])
def for_4(self, tree):
tree.children[2].symbol_table = tree.symbol_table
self.visit(tree.children[2])
tree.children[4].symbol_table = tree.symbol_table
self.visit(tree.children[4])
tree.children[6].symbol_table = tree.symbol_table
self.visit(tree.children[6])
statement_block_table = SymbolTable(parent=tree.symbol_table)
tree.children[8].symbol_table = statement_block_table
self.visit(tree.children[8])
def stmt_block(self, tree):
new_block_table = SymbolTable(parent=tree.symbol_table)
for child in tree.children:
if isinstance(child, Tree):
child.symbol_table = new_block_table
self.visit(child)
#TODO: need debug
# def class_declaration(self, tree):
# class_name = tree.children[1].value
# parent_name = None
# if len(tree.children) > 2 and isinstance(tree.children[2], Token) and tree.children[2].value == Constants.extends:
# parent_name = tree.children[3].value
# class_ = Class(name=class_name, address=IncDataPointer(4), parent=parent_name)
# type_ = Type(name=class_name, class_obj=class_, size=4)
# tree.symbol_table.add_type(type_)
# class_symbol_table = SymbolTable(parent=tree.symbol_table)
# class_stack.append(class_)
# for subtree in tree.children:
# if isinstance(subtree, Tree) and subtree.data == 'field':
# subtree.symbol_table = class_symbol_table
# initial_stack_len = len(stack)
# self.visit(subtree)
# while initial_stack_len < len(stack):
# stack.pop()
# class_stack.pop()
# class_.set_fields(
# member_data=class_symbol_table.variables,
# member_functions=class_symbol_table.functions
# )
class SymbolTableParentUpdater(Visitor):
def __default__(self, tree):
for child in tree.children:
if isinstance(child, Tree):
child.parent = tree
class TypeVisitor(Interpreter):
def __default__(self, tree):
self.visit_children(tree)
def variable(self, tree):
global variable_inits_code
type_ = self.visit(tree.children[0])
var_name = tree.children[1].value
variable = tree.symbol_table.find_var(var_name, tree=tree)
variable.type_ = type_
def type(self, tree):
type_name = tree.children[0].value
type_ = tree.symbol_table.get_type(type_name)
return type_
def array_type(self, tree):
arr_type = self.visit(tree.children[0])
type_ = Type(name="array", arr_type=arr_type)
return type_
#TODO: needs debug
# def class_declaration(self, tree):
# class_obj = tree.symbol_table.get_type(tree.children[1].value).class_obj
# if class_obj.parent:
# parent_class = tree.symbol_table.get_type(class_obj.parent).class_obj
# if not parent_class:
# raise SemanticError(37)
# class_obj.parent = parent_class
# for child in tree.children:
# if isinstance(child, Tree):
# self.visit(child)
def function_decl(self, tree):
return_type = Type(DecafTypes.void_type)
if isinstance(tree.children[0], Tree):
return_type = self.visit(tree.children[0])
func_name = tree.children[1].value
function = tree.symbol_table.get_function(func_name, tree=tree)
function.return_type = return_type
for child in tree.children:
if isinstance(child, Tree):
self.visit(child)