-
Notifications
You must be signed in to change notification settings - Fork 0
/
yaccing.py
407 lines (361 loc) · 10.6 KB
/
yaccing.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
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
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
import ply.yacc as yacc
import sys
from lexing import Mtlex
from traverse import *
from preprocess import *
tokens = Mtlex.tokens
precedence = (
('left', 'PLUS', 'MINUS'),
('left', 'TIMES', 'DIVIDE')
)
def getyacc():
return yacc.yacc()
class Node(object):
def __init__(self, type, children=None, leaf=None, token=None):
self.type = type
if children:
self.children = children
else:
self.children = [ ]
self.leaf = leaf
self.token = token
def __str__(self):
return self.traverse(1)
def traverse(self, i):
s = self.type
indent = "\n" + i*' |'
if self.leaf != None:
if isinstance(self.leaf, Node):
print "Node"
s += indent + self.leaf.traverse(i+1)
else:
s += indent + str(self.leaf)
for children in self.children:
s += indent + children.traverse(i+1)
return s
def p_translation_unit(p):
'''
translation_unit : external_declaration
| translation_unit external_declaration
'''
if len(p) == 2:
p[0] = Node('translation_unit', [p[1]])
else:
p[0] = Node('translation_unit', [p[1], p[2]])
def p_external_declaration(p):
'''
external_declaration : function_definition
| statement
'''
p[0] = Node('external_declaration', [p[1]])
def p_function_definition(p):
'''
function_definition : DEF ID LPAREN parameter_list RPAREN LCURL statement_list RCURL
| DEF ID LPAREN parameter_list RPAREN LCURL RCURL
'''
if len(p) == 9:
p[0] = Node('function_definition', [p[4], p[7]], p[2])
else:
p[0] = Node('function_definition', [p[4]], p[2])
# def p_class_definition(p):
# '''
# class_definition : CLASS ID LPAREN ID RPAREN LCURL
# #def p_declaration_list(p):
# # '''
# declaration_list : declaration
# | declaration_list declaration
# '''
#
# if len(p) == 2:
# p[0] = Node('declaration_list', [p[1]])
# else:
# p[0] = Node('declaration_list', [p[1], p[2]])
#
#def p_declaration(p):
# '''
# declaration : statement
# '''
# p[0] = Node('declaration', [p[1]])
def p_statement(p):
'''
statement : compound_statement
| expression_statement
| iteration_statement
| selection_statement
| class_method_expression
| function_expression
| return_statement
'''
p[0] = Node('statement', [p[1]])
def p_compound_statement(p):
'''
compound_statement : LCURL RCURL
| LCURL statement_list RCURL
'''
if len(p) == 3:
p[0] = Node('compound_statement', [], 'emptychange')
else:
p[0] = Node('compound_statement', [p[2]])
def p_statement_list(p):
'''
statement_list : statement
| statement_list statement
'''
if len(p) == 2:
p[0] = Node('statement_list', [p[1]])
else:
p[0] = Node('statement_list', [p[1], p[2]])
def p_expression_statement(p):
'''
expression_statement : SEMICOLON
| expression SEMICOLON
'''
if len(p) == 2:
p[0] = Node('expression_statement', [], 'emptychange')
else:
p[0] = Node('expression_statement', [p[1]])
def p_expression(p):
'''
expression : assignment_expression
'''
p[0] = Node('expression', [p[1]])
def p_assignment_expression(p):
'''
assignment_expression : ID ASSIGN NEW initializer
| ID ASSIGN assignment_expression
| logical_or_expression
| function_expression
'''
if len(p) == 4:
p[0] = Node('assignment_expression', [p[3]], p[1])
elif len(p) == 5:
p[0] = Node('assignment_expression', [p[4]], p[1])
else:
p[0] = Node('assignment_expression', [p[1]])
def p_logical_or_expression(p):
'''
logical_or_expression : logical_and_expression
| logical_or_expression OR logical_and_expression
'''
if len(p) == 2:
p[0] = Node('logical_or_expression', [p[1]])
else:
p[0] = Node('logical_or_expression', [p[1], p[3]], p[2])
def p_logical_and_expression(p):
'''
logical_and_expression : equality_expression
| logical_and_expression AND equality_expression
'''
if len(p) == 2:
p[0] = Node('logical_and_expression', [p[1]])
else:
p[0] = Node('logical_and_expression', [p[1], p[3]], p[2])
def p_equality_expression(p):
'''
equality_expression : relational_expression
| equality_expression EQ relational_expression
| equality_expression NEQ relational_expression
'''
if len(p) == 2:
p[0] = Node('equality_expression', [p[1]])
else:
p[0] = Node('equality_expression', [p[1], p[3]], p[2])
def p_relational_expression(p):
'''
relational_expression : additive_expression
| relational_expression G_OP additive_expression
| relational_expression L_OP additive_expression
| relational_expression GE_OP additive_expression
| relational_expression LE_OP additive_expression
'''
if len(p) == 2:
p[0] = Node('relational_expression', [p[1]])
else:
p[0] = Node('relational_expression', [p[1], p[3]], p[2])
def p_additive_expression(p):
'''
additive_expression : multiplicative_expression
| additive_expression PLUS multiplicative_expression
| additive_expression MINUS multiplicative_expression
'''
if len(p) == 2:
p[0] = Node('additive_expression', [p[1]])
else:
p[0] = Node('additive_expression', [p[1], p[3]], p[2])
def p_multiplicative_expression(p):
'''
multiplicative_expression : primary_expression
| multiplicative_expression TIMES primary_expression
| multiplicative_expression DIVIDE primary_expression
'''
if len(p) == 2:
p[0] = Node('multiplicative_expression', [p[1]])
else:
p[0] = Node('multiplicative_expression', [p[1], p[3]], p[2])
def p_initializer(p):
'''
initializer : ID LPAREN parameter_list RPAREN
| primary_expression
'''
if len(p) == 2:
p[0] = Node('initializer', [p[1]])
elif len(p) == 4:
p[0] = Node('initailizer', [p[2]], 'list')
else:
p[0] = Node('initializer', [p[3]], p[1])
def p_class_method_expression(p):
'''
class_method_expression : ID DOTOPERATOR function_expression SEMICOLON
'''
p[0] = Node('class_method_expression',[p[3]], p[1])
def p_function_expression(p):
'''
function_expression : ID LPAREN parameter_list RPAREN
'''
if len(p) == 5:
p[0] = Node('function_expression',[p[3]], p[1])
else:
p[0] = Node('function_expression', [], p[1])
def p_parameter_list(p):
'''
parameter_list : parameter_declaration
| parameter_list COMMA parameter_declaration
|
'''
if len(p) == 2:
p[0] = Node('parameter_list', [p[1]])
elif len(p) == 4:
p[0] = Node('parameter_list',[p[1], p[3]])
else:
p[0] = Node('parameter_list')
def p_parameter_declaration(p):
'''
parameter_declaration : initializer
'''
p[0] = Node('parameter_declaration', [p[1]])
def p_primary_expression(p):
'''
primary_expression : ID
| STRING
| NUMBER
| TRUE
| FALSE
| LPAREN expression RPAREN
'''
if not isinstance(p[1], basestring) and not isinstance(p[1],int):
p[0] = Node('primary_expression', [p[1]])
elif len(p) == 4:
p[0] = Node('primary_expression', [p[2]])
else:
p[0] = Node('primary_expression', [], p[1])
# def p_id_name(p):
# '''
# id_name : ID
# '''
# p[0] = Node('id_name',[], p[1])
# def p_point_gen(p):
# '''
# point_gen : POINT
# '''
# p[0] = Node('point_gen',[], p[1])
def p_iteration_statement(p):
'''
iteration_statement : WHILE LPAREN expression RPAREN statement
| FOR LPAREN expression_statement expression_statement expression RPAREN statement
'''
if p[1] == "while":
p[0] = Node('iteration_statement', [p[3], p[5]])
else:
p[0] = Node('iteration_statement', [p[3], p[4], p[5], p[7]])
def p_selection_statement(p):
'''
selection_statement : IF LPAREN expression RPAREN statement
| IF LPAREN expression RPAREN statement ELSE statement
'''
if len(p) == 6:
p[0] = Node('selection_statement', [p[3], p[5]])
else:
p[0] = Node('selection_statement', [p[3], p[5], p[7]])
def p_return_statement(p):
'''
return_statement : RETURN SEMICOLON
| RETURN expression SEMICOLON
'''
if len(p) == 4:
p[0] = Node('return_statement', [p[2]])
else:
p[0] = Node('return_statement')
def p_error(p):
# we should throw compiler error in this case
if p == None:
print "Syntax error at last token."
else:
print "Syntax error around line number \n %d : %s " % (p.lineno, p.value)
data_1 = '''
def makeblocks(start, end, x) {
while (start < end) {
c = new Point(0,0,start);
x.add(block(COBBLESTONE), c);
start = start + 1;
}
for (;start<end;start=start+1)
{
c = new Point(0,0,start);
x.add(block(COBBLESTONE), c);
}
}
def main() {
x = new Flatmap("testfiles/testmap",500,500,500);
makeblocks(0,10, x);
x.close();
}
'''
data_2 = '''
a = (10,20,30);
'''
data_3 = '''
a = 2
if (a> 1 ) { a = 1;}
'''
data_4 = '''
def foo() {
return true;
}
def main() {
a = 2;
if (foo()) {
b = 3;
}
y = 100 - a;
h = new List(3, 4);
h.append(5);
h.get(0);
h.delete(0);
x = new Flatmap("testfiles/testmap", 500, 500, 500);
c = new Point(0, 0, 0);
x.add(block(STONE), c);
x.close();
}
'''
# generate the parser
parser = yacc.yacc()
# generate the lexer to be used with parser
m = Mtlex()
m.build()
# preprocessing step
preprocessor = Processor()
data_4 = preprocessor.preprocess(data_4)
result1 = parser.parse(data_4, lexer=m.lexer)
print result1
#
firstline = '''
import logging
import os
import sys
from pymclevel import mclevel
from pymclevel.box import BoundingBox'''
t = Traverse(result1).getpython()
code = firstline + "\n" + t + "\n"
#f = open("hello.py",'w')
#f.write(code)
print code