-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathparser.py
More file actions
337 lines (263 loc) · 10.1 KB
/
parser.py
File metadata and controls
337 lines (263 loc) · 10.1 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
##################
# PARSER
##################
"""
The idea of the parser is to build a syntax tree of the program
from the tokens created by the lexer
Example 01:
We have this expression below
>> 1 + 2 * 3
This expression is tokenized by the lexer as following
>> [TT_INT: 1, PLUS, TT_INT: 2, MUL, TT_INT: 3]
From this tokenized expression the parser will generate this syntax tree
Binary Operator (PLUS)
|
_________________
| |
Number (1) Binary Operator (MUL)
|
______________________
| |
Number (2) Number (3)
As you can see, this binary tree give you the idea exactly which operations to perform
and gives you the exact order
Example 02:
Let's take the same expression except that 1 + 2 are in between the parenthesis
>> (1 + 2) * 3
Tokenized by lexer like the following
>> [LPARAM, TT_INT: 1, PLUS, TT_INT: 2, RPARAM, MUL, TT_INT: 3]
Now this causes the order of the tree to change quite completely different
Binary Operator (MUL)
|
-----------------------------------
| |
Binary Operator (PLUS) Number (3)
|
-------------------
| |
Number (1) Number (2)
So, what the parser has to do is to figure out if the tokens match our language grammar.
And if it does generate a tree accordingly
"""
###########################################
# Nodes
###########################################
from errors import InvalidSyntaxError
from tokens import TokenTypes
class NumberNode:
def __init__(self, token):
self._token = token
self._start_pos = self._token.get_start_pos()
self._end_pos = self._token.get_end_pos()
def get_start_pos(self):
return self._start_pos
def get_end_pos(self):
return self._end_pos
def get_token(self):
return self._token
def __repr__(self):
return f"{self._token}"
class VariableAccessNode:
def __init__(self, variable_name_token):
self._variable_name_token = variable_name_token
self._start_pos = self._variable_name_token.get_start_pos()
self._end_pos = self._variable_name_token.get_end_pos()
def get_start_pos(self):
return self._start_pos
def get_end_pos(self):
return self._end_pos
def get_token(self):
return self._variable_name_token
class VariableAssignNode:
def __init__(self, variable_name_token, value_node):
self._variable_name_token = variable_name_token
self._value_node = value_node
self._start_pos = self._variable_name_token.get_start_pos()
self._end_pos = self._value_node.get_end_pos()
def get_token(self):
return self._variable_name_token
def get_value_node(self):
return self._value_node
def get_start_pos(self):
return self._start_pos
def get_end_pos(self):
return self._end_pos
class UnaryOpNode:
def __init__(self, operator_token, node):
self._operator_token = operator_token
self._node = node
self._start_pos = self._operator_token.get_start_pos()
self._end_pos = self._operator_token.get_end_pos()
def get_start_pos(self):
return self._start_pos
def get_end_pos(self):
return self._end_pos
def get_token(self):
return self._operator_token
def __repr__(self):
return f"({self._operator_token}, {self._node})"
class BinaryOpNode:
def __init__(self, left_node, operator_token, right_node):
self._left_node = left_node
self._operator_token = operator_token
self._right_node = right_node
self._start_pos = self._left_node.get_end_pos()
self._end_pos = self._right_node.get_end_pos()
def get_start_pos(self):
return self._start_pos
def get_end_pos(self):
return self._end_pos
def get_token(self):
return self._operator_token
def get_left_node(self):
return self._left_node
def get_right_node(self):
return self._right_node
def __repr__(self):
return f"({self._left_node}, {self._operator_token}, {self._right_node})"
class ParseResult:
def __init__(self):
self._error = None
self._node = None
self._advance_count = 0
def register_advancement(self):
self._advance_count += 1
def register(self, res):
self._advance_count += res._advance_count
if res._error:
self._error = res._error
return res._node
def success(self, node):
self._node = node
return self
def failed(self, error):
if not self._error or self._advance_count == 0:
self._error = error
return self
class Parser:
def __init__(self, tokens):
self._tokens = tokens
self._token_indx = -1
self.current_token = None
self.advance()
def binary_operation(self, function_a, operation_tokens, function_b=None):
if function_b == None:
function_b = function_a
res = ParseResult()
left_factor = res.register(function_a())
if res._error:
return res
while self.current_token._type in operation_tokens:
operator_token = self.current_token
res.register_advancement()
self.advance()
right_factor = res.register(function_b())
if res._error:
return res
left_factor = BinaryOpNode(left_factor, operator_token, right_factor)
return res.success(left_factor)
def atom(self):
res = ParseResult()
token = self.current_token
if token._type in [TokenTypes.TT_INT, TokenTypes.TT_FLOAT]:
res.register_advancement()
self.advance()
return res.success(NumberNode(token))
elif token.get_type() == TokenTypes.TT_IDENTIFIER:
res.register_advancement()
self.advance()
return res.success(VariableAccessNode(token))
elif token._type == TokenTypes.TT_LPAREN:
res.register_advancement()
self.advance()
expr = res.register(self.expression())
if res._error:
return res
if self.current_token._type == TokenTypes.TT_RPAREN:
res.register_advancement()
self.advance()
return res.success(expr)
else:
return res.failed(
InvalidSyntaxError(
self.current_token._start_pos, self.current_token._end_pos,
"Expected ')'"
)
)
return res.failed(
InvalidSyntaxError(
self.current_token._start_pos, self.current_token._end_pos,
"Expected INT, FLOAT, IDENTIFIER, '+', '-', '*' or '('"
)
)
def power(self):
return self.binary_operation(self.atom, [TokenTypes.TT_POWER], self.factor)
def factor(self):
res = ParseResult()
token = self.current_token
if token._type in [TokenTypes.TT_PLUS, TokenTypes.TT_MINUS]:
res.register_advancement()
self.advance()
factor = res.register(self.factor())
if res._error:
return res
return res.success(UnaryOpNode(token, factor))
return self.power()
def term(self):
return self.binary_operation(self.factor, [TokenTypes.TT_MUL, TokenTypes.TT_DIV])
def expression(self):
res = ParseResult()
if self.current_token.matches(TokenTypes.TT_KEYWORD, "VAR"):
res.register_advancement()
self.advance()
if self.current_token.get_type() != TokenTypes.TT_IDENTIFIER:
res.failed(
InvalidSyntaxError(
self.current_token.get_start_pos(), self.current_token.get_end_pos(),
"Expected identifier"
)
)
var_name = self.current_token
res.register_advancement()
self.advance()
if self.current_token.get_type() != TokenTypes.TT_EQ:
res.failed(
InvalidSyntaxError(
self.current_token.get_start_pos(), self.current_token.get_end_pos(),
"Expected '='"
)
)
res.register_advancement()
self.advance()
expr = res.register(self.expression())
if res._error:
return res
return res.success(VariableAssignNode(var_name, expr))
node = res.register(self.binary_operation(self.term, [TokenTypes.TT_PLUS, TokenTypes.TT_MINUS]))
if res._error:
return res.failed(
InvalidSyntaxError(
self.current_token._start_pos, self.current_token._end_pos,
"Expected VAR, int, float, identifier, '+', '-', '*' or '('"
)
)
return res.success(node)
def advance(self):
self._token_indx += 1
if self._token_indx < len(self._tokens):
self.current_token = self._tokens[self._token_indx]
return self.current_token
def parse(self):
res = self.expression()
if not res._error and self.current_token._type != TokenTypes.TT_EOF:
return res.failed(
InvalidSyntaxError(
self.current_token._start_pos, self.current_token._end_pos,
"Expected '+', '-', '*' or '/'"
)
)
return res
def exec_parser(tokens):
parser = Parser(tokens)
ast = parser.parse()
return ast