This repository has been archived by the owner on Jan 9, 2021. It is now read-only.
/
parser.py
1621 lines (1476 loc) · 70.8 KB
/
parser.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
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# In The Name Of God
# ========================================
# [] File Name : parser.py
#
# [] Creation Date : 31-10-2016
#
# [] Created By : Parham Alvani (parham.alvani@gmail.com)
#
# [] Created By : Saman Fekri (samanf74@gmail.com)
# =======================================
import ply.yacc as yacc
from .lex import YEPCLexer
from ..domain.qr import QuadRuple
from ..domain.symtable import SymbolTable
from ..domain.entity import YEPCEntity
from .to_c import YEPCToC
class YEPCParser:
tokens = YEPCLexer.tokens
precedence = (
('left', 'OR_KW', 'ORELSE'),
('left', 'AND_KW', 'ANDTHEN'),
('left', 'EQ', 'NE'),
('left', 'LT', 'GT', 'LE', 'GE'),
('left', 'PLUS', 'MINUS'),
('left', 'REM'),
('left', 'MULT', 'DIV'),
('right', 'NOT_KW', 'UMINUS', 'UMULT', 'RANDOM',
'MINUSMINUS', 'PLUSPLUS'),
('nonassoc', 'IFTHEN'),
('nonassoc', 'IFELSE'),
)
def __init__(self):
self.quadruples = []
self.symtables = []
self.offsets = []
def p_program(self, p):
'program : programInitiator declarationList'
self.quadruples.append(QuadRuple(op='goto',
arg1=self.symtables[0].symbols['#aa11'].header['start'], arg2='', result=''))
print("Rule 1: program -> declarationList")
to_c = YEPCToC(self.quadruples, self.symtables[0])
c_file = open("out/main.c", "w+")
c_file.write(to_c.to_c())
c_file.close()
def p_program_initiator(self, p):
'programInitiator : empty'
SymbolTable.scope_seq = 0
self.symtables.append(SymbolTable(None, 'scope', 'root'))
print("Rule *: programInitiator -> empty")
def p_declaration_list(self, p):
'''
declarationList : declarationList declaration
| declaration
'''
if len(p) == 3:
print("Rule 2: declarationList -> declarationList declaration")
else:
print("Rule 3: declarationList -> declaration")
def p_declaration_1(self, p):
'''
declaration : varDeclaration
'''
print("Rule 4: declaration -> varDeclaration")
def p_declaration_2(self, p):
'''
declaration : funDeclaration
'''
print("Rule 5: declaration -> funDeclartion")
def p_declaration_3(self, p):
'''
declaration : recDeclaration
'''
print("Rule 6: declaration -> recDeclaration")
def p_rec_declaration(self, p):
'''
recDeclaration : recInitiator localDeclarations BR_CLOSE
'''
s = self.symtables.pop()
self.symtables[-1].insert_scope(s)
print("Rule 7: recDeclaration -> RECORD_KW ID {localDeclarations}")
def p_rec_initiator(self, p):
'''
recInitiator : RECORD_KW ID BR_OPEN
'''
self.symtables.append(SymbolTable(self.symtables[-1], 'record', 'struct %s*' % p[2][1:]))
print("Rule *: recInitiator -> RECORD_KW ID {")
def p_var_declaration(self, p):
'''
varDeclaration : typeSpecifier varDeclarationList SEMICOLON
'''
for (name, value) in p[2]:
if '.' in name:
# Handling arrays
name, size = name.split('.')
self.symtables[-1].insert_variable(name, '%s*' % p[1])
self.symtables[-1].insert_meta(name, 'size', int(size))
else:
# Hanling single variables
self.symtables[-1].insert_variable(name, p[1])
if value is not None:
name = self.symtables[-1].get_symbol_name(name)
value = self.symtables[-1].get_symbol_name(value)
self.quadruples.append(QuadRuple(op='=', arg1=value, arg2='', result=name))
print("Rule 8: varDeclaration -> typeSpecifier varDeclarationList;")
def p_scoped_var_declaration(self, p):
'''
scopedVarDeclaration : scopedTypeSpecifier varDeclarationList SEMICOLON
'''
for (name, value) in p[2]:
if '.' in name:
# Handling arrays
name, size = name.split('.')
self.symtables[-1].insert_variable(name, '%s*' % p[1])
self.symtables[-1].insert_meta(name, 'size', int(size))
else:
# Hanling single variables
self.symtables[-1].insert_variable(name, p[1])
if value is not None:
name = self.symtables[-1].get_symbol_name(name)
value = self.symtables[-1].get_symbol_name(value)
self.quadruples.append(QuadRuple(op='=', arg1=value, arg2='', result=name))
print("Rule 9: scopedVarDeclaration ->",
"scopedTypeSpecifier varDeclarationList;")
def p_var_declaration_list(self, p):
'''
varDeclarationList : varDeclarationList COMMA varDeclarationInitialize
| varDeclarationInitialize
'''
if len(p) == 4:
print("Rule 10: varDeclarationList ->",
"varDeclarationList, varDeclarationInitialize")
p[0] = [*p[1], p[3]]
else:
print("Rule 11: varDeclarationList -> varDeclarationInitialize")
p[0] = [p[1]]
def p_var_declaration_initialize(self, p):
'''
varDeclarationInitialize : varDeclarationId
| varDeclarationId COLON simpleExpression
'''
if len(p) == 2:
print("Rule 12: varDeclarationInitialize -> varDeclarationId")
p[0] = (p[1], None)
else:
if p[3].type == 'bool':
t = self.symtables[-1].new_temp('int')
YEPCEntity.backpatch(p[3].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='1', arg2='', result=self.symtables[-1].get_symbol_name(t)))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 2, arg2='', result=''))
YEPCEntity.backpatch(p[3].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='0', arg2='', result=self.symtables[-1].get_symbol_name(t)))
p[0] = (p[1], t)
else:
p[0] = (p[1], p[3].place)
print("Rule 13: varDeclarationInitialize ->",
"varDeclarationId: simpleExpression")
def p_var_declaration_id(self, p):
'''
varDeclarationId : ID
| ID BK_OPEN NUMCONST BK_CLOSE
'''
if len(p) == 2:
print("Rule 14: varDeclarationId -> ID")
p[0] = p[1]
else:
print("Rule 15: varDeclarationId -> ID [ NUMCONST ]")
p[0] = '%s.%d' % (p[1], p[3])
def p_scoped_type_specifier(self, p):
'''
scopedTypeSpecifier : STATIC_KW typeSpecifier
| typeSpecifier
'''
if len(p) == 3:
print("Rule 16: scopedTypeSpecifier -> STATIC_KW typeSpecifier")
p[0] = p[2]
else:
print("Rule 17: scopedTypeSpecifier -> typeSpecifier")
p[0] = p[1]
def p_type_specifier(self, p):
'''
typeSpecifier : returnTypeSpecifier
| RECORD_KW ID
'''
if len(p) == 2:
print("Rule 18: typeSpecifier -> returnTypeSpecifier")
p[0] = p[1]
else:
print("Rule 19: typeSpecifier -> RECORD_KW ID")
p[0] = 'struct %s*' % p[2][1:]
def p_return_type_specifier_1(self, p):
'''
returnTypeSpecifier : INT_T
'''
print("Rule 20: returnTypeSpecifier -> INT_T")
p[0] = 'int'
def p_return_type_specifier_2(self, p):
'''
returnTypeSpecifier : REAL_T
'''
print("Rule 21: returnTypeSpecifier -> REAL_T")
p[0] = 'double'
def p_return_type_specifier_3(self, p):
'''
returnTypeSpecifier : BOOL_T
'''
print("Rule 22: returnTypeSpecifier -> BOOL_T")
p[0] = 'int'
def p_return_type_specifier_4(self, p):
'''
returnTypeSpecifier : CHAR_T
'''
print("Rule 23: returnTypeSpecifier -> CHAR_T")
p[0] = 'char'
def p_fun_declaration(self, p):
'''
funDeclaration : funInitiator nexter params PR_CLOSE statement
'''
s = self.symtables[-1]
if s.header['return_type'] != 'void':
y = YEPCEntity()
y.place = '0'
y.type = s.header['return_type']
self.p_return_stmt(['', 'return', y, ';'])
else:
self.p_return_stmt(['', 'return', ';'])
s.header['params'] = p[3]
self.symtables.pop()
self.symtables[-1].insert_procedure(s)
YEPCEntity.backpatch(p[2].next_list, len(self.quadruples))
print("Rule 24: funDeclaration -> typeSpecifier ID funInitiator (params) statement")
def p_fun_initiator_1(self, p):
'''
funInitiator : ID PR_OPEN quadder
'''
s = SymbolTable(self.symtables[-1], 'function', p[1])
s.header['return_type'] = 'void'
s.header['start'] = p[3].quad + 1
self.symtables.append(s)
print("Rule *: funInitiator -> empty")
def p_fun_initiator_2(self, p):
'''
funInitiator : typeSpecifier ID PR_OPEN quadder
'''
s = SymbolTable(self.symtables[-1], 'function', p[2])
s.header['return_type'] = p[1]
s.header['start'] = p[4].quad + 1
self.symtables.append(s)
print("Rule *: funInitiator -> empty")
def p_params_1(self, p):
'''
params : paramList
'''
p[0] = p[1]
index = 0
for (name, type) in p[0]:
index += 1
self.quadruples.append(
QuadRuple(op='seek',
arg1=index,
arg2=type,
result=self.symtables[-1].get_symbol_name(name)))
print("Rule 26: params -> paramList")
def p_params_2(self, p):
'''
params : empty
'''
p[0] = []
print("Rule 27: params -> empty")
def p_param_list(self, p):
'''
paramList : paramList SEMICOLON paramTypeList
| paramTypeList
'''
if len(p) == 4:
p[0] = p[1] + p[3]
print("Rule 28: paramList -> paramList; paramTypeList")
else:
p[0] = p[1]
print("Rule 29: paramList -> paramTypeList")
def p_param_type_list(self, p):
'''
paramTypeList : typeSpecifier paramIdList
'''
p[0] = []
for name in p[2]:
type = p[1]
if '*' in name:
name = name[:-1]
type = type + '*'
p[0].append((name, type))
self.symtables[-1].insert_variable(name, type)
print("Rule 30: paramTypeList -> typeSpecifier paramIdList")
def p_param_id_list(self, p):
'''
paramIdList : paramIdList COMMA paramId
| paramId
'''
if len(p) == 4:
p[0] = [*p[1], p[3]]
print("Rule 31: paramIdList -> paramIdList , paramId")
else:
p[0] = [p[1]]
print("Rule 32: paramIdList -> paramId")
def p_param_id(self, p):
'''
paramId : ID BK_OPEN BK_CLOSE
| ID
'''
if len(p) == 4:
p[0] = '%s*' % p[1]
print("Rule 33: paramId -> ID [ ]")
else:
p[0] = p[1]
print("Rule 34: paramId -> ID")
def p_statement_1(self, p):
'''
statement : expressionStmt
'''
p[0] = YEPCEntity()
print("Rule 35: statement -> expressionStmt")
def p_statement_2(self, p):
'''
statement : compoundStmt
'''
p[0] = p[1]
print("Rule 36: statement -> compoundStmt")
def p_statement_3(self, p):
'''
statement : selectionStmt
'''
p[0] = p[1]
print("Rule 37: statement -> selectionStmt")
def p_statement_4(self, p):
'''
statement : iterationStmt
'''
p[0] = p[1]
print("Rule 38: statement -> iterationStmt")
def p_statement_5(self, p):
'''
statement : returnStmt
'''
p[0] = p[1]
print("Rule 39: statement -> returnStmt")
def p_statement_6(self, p):
'''
statement : breakStmt
'''
p[0] = p[1]
print("Rule 40: statement -> breakStmt")
def p_compound_stmt(self, p):
'''
compoundStmt : BR_OPEN scopeInitiator localDeclarations statementList BR_CLOSE
'''
p[0] = YEPCEntity()
p[0].next_list = p[4].next_list
s = self.symtables.pop()
self.symtables[-1].insert_scope(s)
print("Rule 41: compoundStmt -> {localDeclarations statementList}")
def p_scope_initiator(self, p):
'''
scopeInitiator : empty
'''
self.symtables.append(SymbolTable(self.symtables[-1], 'scope'))
print("Rule *: scopeInitiator -> empty")
def p_local_declarations(self, p):
'''
localDeclarations : localDeclarations scopedVarDeclaration
| empty
'''
if len(p) == 3:
print("Rule 42: localDeclarations ->",
"localDeclarations scopedVarDeclaration")
else:
print("Rule 43: localDeclarations ->",
"localDeclarations scopedVarDeclaration")
def p_statement_list(self, p):
'''
statementList : statementList statement
| empty
'''
p[0] = YEPCEntity()
if len(p) == 3:
if p[2] is not None:
p[0].next_list = p[2].next_list + p[1].next_list
print("Rule 44: statementList -> statementList statement")
else:
print("Rule 45: statementList -> empty")
def p_expression_stmt(self, p):
'''
expressionStmt : expression SEMICOLON
| SEMICOLON
'''
if len(p) == 3:
print("Rule 46: expressionStmt -> expression;")
else:
print("Rule 47: expressionStmt -> ;")
def p_selection_stmt_1(self, p):
'''
selectionStmt : selectionIfInitiator quadder statement quadder
'''
p[0] = YEPCEntity()
if p[3] is not None:
p[0].next_list = p[3].next_list
YEPCEntity.backpatch(p[1].true_list, p[2].quad)
YEPCEntity.backpatch(p[1].false_list, p[4].quad)
print("Rule 48: selectionStmt ->",
"IF_KW (simpleExpression) statement")
def p_selection_stmt_2(self, p):
'''
selectionStmt : selectionIfInitiator quadder statement ELSE_KW quadder statement %prec IFELSE
'''
p[0] = YEPCEntity()
p[0].next_list = p[3].next_list + p[6].next_list
YEPCEntity.backpatch(p[1].true_list, p[2].quad)
YEPCEntity.backpatch(p[1].false_list, p[5].quad)
print("Rule 49: selectionStmt ->",
"IF_KW (simpleExpression) statement ELSE_KW statement")
def p_selection_if_initiator(self, p):
'''
selectionIfInitiator : IF_KW PR_OPEN simpleExpression PR_CLOSE %prec IFTHEN
'''
p[0] = YEPCEntity()
p[0].type = 'bool'
if (p[3].type == 'bool'):
p[0].true_list = p[3].true_list
p[0].false_list = p[3].false_list
else:
self.quadruples.append(QuadRuple(op='if', arg1=self.symtables[-1].get_symbol_name(p[3].place), arg2='', result=''))
qt = QuadRuple(op='goto', arg1='-', arg2='', result='')
self.quadruples.append(qt)
p[0].true_list = [qt]
qf = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].false_list = [qf]
self.quadruples.append(qf)
def p_selection_stmt_3(self, p):
'''
selectionStmt : SWITCH_KW PR_OPEN simpleExpression PR_CLOSE nexter caseElement defaultElement END_KW quadder
'''
YEPCEntity.backpatch(p[5].next_list, p[9].quad)
case_next = []
for i in range(len(p[6].case_dict)):
key = p[6].case_dict[i][0]
case_entry = p[6].case_dict[i][1]
q1 = QuadRuple(op='if', arg1=self.symtables[-1].get_symbol_name(p[3].place) + ' == ' + self.symtables[-1].get_symbol_name(key), arg2='', result='')
q2 = QuadRuple(op='goto', arg1=str(case_entry[0]), arg2='', result='')
self.quadruples.append(q1)
self.quadruples.append(q2)
case_next.append(case_entry[1])
q = QuadRuple(op='goto', arg1=str(p[7].quad), arg2='', result='')
self.quadruples.append(q)
# just for compatiblity
# YEPCEntity.backpatch(case_next, len(self.quadruples))
if len(p[6].next_list) != 0:
YEPCEntity.backpatch(p[6].next_list, len(self.quadruples))
YEPCEntity.backpatch(p[7].next_list, len(self.quadruples))
print("Rule 50: selectionStmt ->",
"SWITCH_KW (simpleExpression) caseElement defaultElement END_KW")
def p_case_element_1(self, p):
'''
caseElement : CASE_KW NUMCONST COLON quadder statement
'''
p[0] = YEPCEntity()
p[0].next_list = p[5].next_list
# just for compatiblity
q1 = QuadRuple(op='goto', arg1='-', arg2='', result='')
# self.quadruples.append(q1)
p[0].case_dict.append([str(p[2]), [str(p[4].quad), q1]])
print("Rule 51: caseElement -> CASE_KW NUMCONST: statement")
def p_case_element_2(self, p):
'''
caseElement : caseElement CASE_KW NUMCONST COLON quadder statement
'''
p[0] = YEPCEntity()
p[0].next_list = p[6].next_list + p[1].next_list
# just for compatiblity
q1 = QuadRuple(op='goto', arg1='-', arg2='', result='')
# self.quadruples.append(q1)
p[0].case_dict += (p[1].case_dict)
p[0].case_dict.append([str(p[3]), [str(p[5].quad), q1]])
print("Rule 52: caseElement ->",
"caseElement CASE_KW NUMCONST: statement")
def p_default_element_1(self, p):
'''
defaultElement : DEFAULT_KW COLON quadder statement nexter
'''
p[0] = YEPCEntity()
p[0].next_list = p[5].next_list
p[0].quad = p[3].quad
print("Rule 53: defaultElement -> DEFAULT_KW: statement")
def p_default_element_2(self, p):
'''
defaultElement : empty nexter
'''
p[0] = YEPCEntity()
p[0].next_list = p[2].next_list
print("Rule 54: defaultElement -> empty")
def p_iteration_stmt(self, p):
'''
iterationStmt : iterationInitiator quadder statement nexter
'''
if p[3] is not None:
YEPCEntity.backpatch(p[3].next_list, len(self.quadruples))
YEPCEntity.backpatch(p[4].next_list, p[1].quad)
YEPCEntity.backpatch(p[1].true_list, p[2].quad)
YEPCEntity.backpatch(p[1].false_list, len(self.quadruples))
print("Rule 55: iterationStmt ->",
"WHILE_KW (simpleExpression) statement")
def p_iteration_initiator(self, p):
'''
iterationInitiator : WHILE_KW PR_OPEN quadder simpleExpression PR_CLOSE
'''
p[0] = YEPCEntity()
p[0].type = 'bool'
p[0].quad = p[3].quad
if (p[4].type == 'bool'):
p[0].true_list = p[4].true_list
p[0].false_list = p[4].false_list
else:
self.quadruples.append(QuadRuple(op='if', arg1=self.symtables[-1].get_symbol_name(p[4].place), arg2='', result=''))
qt = QuadRuple(op='goto', arg1='-', arg2='', result='')
self.quadruples.append(qt)
p[0].true_list = [qt]
qf = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].false_list = [qf]
self.quadruples.append(qf)
def p_return_stmt(self, p):
'''
returnStmt : RETURN_KW SEMICOLON
| RETURN_KW expression SEMICOLON
'''
# Our function symbol table
s = self.symtables[-1].get_parent_function()
# Create return statement if in main
if s.name == '#aa11':
self.quadruples.append(QuadRuple(op='return', result='', arg1='', arg2=''))
return
# Restore previous location
t1 = self.symtables[-1].new_temp('jmp_buf')
self.quadruples.append(QuadRuple(op='pop', result='%s' % self.symtables[-1].get_symbol_name(t1), arg1='jmp_buf', arg2=''))
# Push the result if we have any result
if len(p) == 3:
print("Rule 56: returnStmt -> RETURN_KW ;")
else:
if p[2].type == 'bool':
t2 = self.symtables[-1].new_temp('int')
YEPCEntity.backpatch(p[2].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='1', arg2='', result=self.symtables[-1].get_symbol_name(t2)))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 2, arg2='', result=''))
YEPCEntity.backpatch(p[2].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='0', arg2='', result=self.symtables[-1].get_symbol_name(t2)))
self.quadruples.append(QuadRuple(op='push', result='', arg1=self.symtables[-1].get_symbol_name(t2), arg2='int'))
else:
t2 = self.symtables[-1].new_temp(p[2].type)
self.quadruples.append(QuadRuple(op='=', result=self.symtables[-1].get_symbol_name(t2),
arg1=self.symtables[-1].get_symbol_name(p[2].place), arg2=p[2].type))
self.quadruples.append(QuadRuple(op='push', result='', arg1=self.symtables[-1].get_symbol_name(t2), arg2=p[2].type))
print("Rule 57: returnStmt -> RETURN_KW expression ;")
# Goto to previous location
self.quadruples.append(QuadRuple(op='longjmp', arg1=self.symtables[-1].get_symbol_name(t1), arg2='1820', result=''))
def p_break_stmt(self, p):
'''
breakStmt : BREAK_KW SEMICOLON
'''
p[0] = YEPCEntity()
q = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].next_list.append(q)
self.quadruples.append(q)
print("Rule 58: breakStmt -> BREAK_KW ;")
def p_expression_1(self, p):
'''
expression : mutable EXP expression
'''
p[0] = YEPCEntity()
p[0].type = p[1].type
p[0].place = p[1].place
if p[3].type == 'bool':
YEPCEntity.backpatch(p[3].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='1', arg2='',
result=self.symtables[-1].get_symbol_name(p[1].place)))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 2, arg2='', result=''))
YEPCEntity.backpatch(p[3].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='0', arg2='',
result=self.symtables[-1].get_symbol_name(p[1].place)))
else:
self.quadruples.append(QuadRuple(op='=', arg1=self.symtables[-1].get_symbol_name(p[3].place),
arg2='',
result=self.symtables[-1].get_symbol_name(p[1].place)))
print("Rule 59: expression -> mutable EXP expression")
def p_expression_2(self, p):
'''
expression : mutable PLUSEXP expression
'''
p[0] = YEPCEntity()
p[0].type = p[1].type
p[0].place = p[1].place
if p[3].type == 'bool':
YEPCEntity.backpatch(p[3].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='+', arg2='1',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 2, arg2='', result=''))
YEPCEntity.backpatch(p[3].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='+', arg2='0',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
else:
self.quadruples.append(QuadRuple(op='+',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
arg2=self.symtables[-1].get_symbol_name(p[3].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
print("Rule 60: expression -> mutable PLUSEXP expression")
def p_expression_3(self, p):
'''
expression : mutable MINUSEXP expression
'''
p[0] = YEPCEntity()
p[0].type = p[1].type
p[0].place = p[1].place
if p[3].type == 'bool':
YEPCEntity.backpatch(p[3].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='-', arg2='1',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 2, arg2='', result=''))
YEPCEntity.backpatch(p[3].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='-', arg2='0',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
else:
self.quadruples.append(QuadRuple(op='-',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
arg2=self.symtables[-1].get_symbol_name(p[3].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
print("Rule 61: expression -> mutable MINUSEXP expression")
def p_expression_4(self, p):
'''
expression : mutable MULTEXP expression
'''
p[0] = YEPCEntity()
p[0].type = p[1].type
p[0].place = p[1].place
if p[3].type == 'bool':
YEPCEntity.backpatch(p[3].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='*', arg2='1',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 2, arg2='', result=''))
YEPCEntity.backpatch(p[3].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='*', arg2='0',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
else:
self.quadruples.append(QuadRuple(op='*',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
arg2=self.symtables[-1].get_symbol_name(p[3].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
print("Rule 62: expression -> mutable MULTEXP expression")
def p_expression_5(self, p):
'''
expression : mutable DIVEXP expression
'''
p[0] = YEPCEntity()
p[0].type = p[1].type
p[0].place = p[1].place
if p[3].type == 'bool':
YEPCEntity.backpatch(p[3].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='/', arg2='1',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 2, arg2='', result=''))
YEPCEntity.backpatch(p[3].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='/', arg2='0',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
else:
self.quadruples.append(QuadRuple(op='/',
arg1=self.symtables[-1].get_symbol_name(p[1].place),
arg2=self.symtables[-1].get_symbol_name(p[3].place),
result=self.symtables[-1].get_symbol_name(p[1].place)))
print("Rule 63: expression -> mutable DIVEXP expression")
def p_expression_6(self, p):
'''
expression : simpleExpression
'''
p[0] = p[1]
print("Rule 64: expression -> simpleExpression")
def p_expression_7(self, p):
'''
expression : mutable PLUSPLUS
'''
p[0] = YEPCEntity()
p[0].type = p[1].type
p[0].place = p[1].place
self.quadruples.append(
QuadRuple(op='+', arg1=self.symtables[-1].get_symbol_name(p[1].place), arg2='1', result=self.symtables[-1].get_symbol_name(p[1].place)))
print("Rule 65: expression -> mutable PLUSPLUS")
def p_expression_8(self, p):
'''
expression : mutable MINUSMINUS
'''
p[0] = YEPCEntity()
p[0].type = p[1].type
p[0].place = p[1].place
self.quadruples.append(
QuadRuple(op='-', arg1=self.symtables[-1].get_symbol_name(p[1].place), arg2='1', result=self.symtables[-1].get_symbol_name(p[1].place)))
print("Rule 66: expression -> mutable MINUSMINUS")
def p_and_initiator(self, p):
'''
andInitiator : simpleExpression AND_KW
'''
p[0] = YEPCEntity()
p[0].type = 'bool'
if (p[1].type == 'bool'):
p[0].true_list = p[1].true_list
p[0].false_list = p[1].false_list
else:
self.quadruples.append(QuadRuple(op='if', arg1=self.symtables[-1].get_symbol_name(p[1].place), arg2='', result=''))
qt = QuadRuple(op='goto', arg1='-', arg2='', result='')
self.quadruples.append(qt)
p[0].true_list = [qt]
qf = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].false_list = [qf]
self.quadruples.append(qf)
def p_or_initiator(self, p):
'''
orInitiator : simpleExpression OR_KW
'''
p[0] = YEPCEntity()
p[0].type = 'bool'
if (p[1].type == 'bool'):
p[0].true_list = p[1].true_list
p[0].false_list = p[1].false_list
else:
self.quadruples.append(QuadRuple(op='if', arg1=self.symtables[-1].get_symbol_name(p[1].place), arg2='', result=''))
qt = QuadRuple(op='goto', arg1='-', arg2='', result='')
self.quadruples.append(qt)
p[0].true_list = [qt]
qf = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].false_list = [qf]
self.quadruples.append(qf)
def p_simple_expression_1(self, p):
'''
simpleExpression : orInitiator quadder simpleExpression %prec OR_KW
'''
p[0] = YEPCEntity()
p[0].type = 'bool'
t1 = self.symtables[-1].new_temp('int')
YEPCEntity.backpatch(p[1].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='1', arg2='', result=self.symtables[-1].get_symbol_name(t1)))
self.quadruples.append(QuadRuple(op='goto', arg1=p[2].quad, arg2='', result=''))
YEPCEntity.backpatch(p[1].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='0', arg2='', result=self.symtables[-1].get_symbol_name(t1)))
self.quadruples.append(QuadRuple(op='goto', arg1=p[2].quad, arg2='', result=''))
if p[3].type == 'bool':
p[0].true_list = p[3].true_list
YEPCEntity.backpatch(p[3].false_list, len(self.quadruples))
else:
self.quadruples.append(QuadRuple(op='if', arg1=self.symtables[-1].get_symbol_name(p[3].place), arg2='', result=''))
qt = QuadRuple(op='goto', arg1='-', arg2='', result='')
self.quadruples.append(qt)
p[0].true_list = [qt]
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples), arg2='', result=''))
self.quadruples.append(QuadRuple(op='if', arg1='%s == 0' % self.symtables[-1].get_symbol_name(t1), arg2='', result=''))
qf = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].false_list.append(qf)
self.quadruples.append(qf)
qt = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].true_list.append(qt)
self.quadruples.append(qt)
print("Rule 67: simpleExpression ->",
"simpleExpression OR_KW simpleExpression")
def p_simple_expression_2(self, p):
'''
simpleExpression : andInitiator quadder simpleExpression %prec AND_KW
'''
p[0] = YEPCEntity()
p[0].type = 'bool'
t1 = self.symtables[-1].new_temp('int')
YEPCEntity.backpatch(p[1].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='1', arg2='', result=self.symtables[-1].get_symbol_name(t1)))
self.quadruples.append(QuadRuple(op='goto', arg1=p[2].quad, arg2='', result=''))
YEPCEntity.backpatch(p[1].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='0', arg2='', result=self.symtables[-1].get_symbol_name(t1)))
self.quadruples.append(QuadRuple(op='goto', arg1=p[2].quad, arg2='', result=''))
if p[3].type == 'bool':
p[0].false_list = p[3].false_list
YEPCEntity.backpatch(p[3].true_list, len(self.quadruples))
else:
self.quadruples.append(QuadRuple(op='if', arg1=self.symtables[-1].get_symbol_name(p[3].place), arg2='', result=''))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 1, arg2='', result=''))
qf = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].false_list = [qf]
self.quadruples.append(qf)
self.quadruples.append(QuadRuple(op='if', arg1='%s == 0' % self.symtables[-1].get_symbol_name(t1), arg2='', result=''))
qf = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].false_list.append(qf)
self.quadruples.append(qf)
qt = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].true_list.append(qt)
self.quadruples.append(qt)
print("Rule 68: simpleExpression ->",
"simpleExpression AND_KW simpleExpression")
def p_simple_expression_3(self, p):
'''
simpleExpression : orInitiator ELSE_KW quadder simpleExpression %prec ORELSE
'''
p[0] = YEPCEntity()
p[0].type = 'bool'
YEPCEntity.backpatch(p[1].false_list, p[3].quad)
if p[4].type == 'bool':
p[0].true_list = p[1].true_list + p[4].true_list
p[0].false_list = p[4].false_list
else:
self.quadruples.append(QuadRuple(op='if', arg1=self.symtables[-1].get_symbol_name(p[4].place), arg2='', result=''))
qt = QuadRuple(op='goto', arg1='-', arg2='', result='')
self.quadruples.append(qt)
p[0].true_list = p[1].true_list + [qt]
qf = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].false_list = [qf]
self.quadruples.append(qf)
print("Rule 69: simpleExpression ->",
"simpleExpression OR_KW ELSE_KW simpleExpression")
def p_simple_expression_4(self, p):
'''
simpleExpression : andInitiator THEN_KW quadder simpleExpression %prec ANDTHEN
'''
p[0] = YEPCEntity()
p[0].type = 'bool'
YEPCEntity.backpatch(p[1].true_list, p[3].quad)
if p[4].type == 'bool':
p[0].false_list = p[1].false_list + p[4].false_list
p[0].true_list = p[4].true_list
else:
self.quadruples.append(QuadRuple(op='if', arg1=self.symtables[-1].get_symbol_name(p[4].place), arg2='', result=''))
qt = QuadRuple(op='goto', arg1='-', arg2='', result='')
self.quadruples.append(qt)
qf = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].false_list = p[1].true_list + [qf]
p[0].true_list = [qt]
self.quadruples.append(qf)
print("Rule 70: simpleExpression ->",
"simpleExpression AND_KW THEN_KW simpleExpression")
def p_simple_expression_5(self, p):
'''
simpleExpression : NOT_KW simpleExpression
'''
p[0] = YEPCEntity()
p[0].type = 'bool'
p[0].true_list = p[2].false_list
p[0].false_list = p[2].true_list
print("Rule 71: simpleExpression -> NOT_KW simpleExpression")
def p_simple_expression_6(self, p):
'''
simpleExpression : relExpression
'''
p[0] = p[1]
print("Rule 72: simpleExpression -> relExpression")
def p_quadder(self, p):
'''
quadder : empty
'''
p[0] = YEPCEntity()
p[0].quad = len(self.quadruples)
print("Rule Quadder: quadder -> quadder -> empty")
def p_nexter(self, p):
'''
nexter : empty
'''
p[0] = YEPCEntity()
q = QuadRuple(op='goto', arg1='-', arg2='', result='')
p[0].next_list.append(q)
self.quadruples.append(q)
def p_rel_expression(self, p):
'''
relExpression : mathlogicExpression relop quadder mathlogicExpression
| mathlogicExpression
'''
if len(p) == 5:
p[0] = YEPCEntity()
p[0].type = 'bool'
if p[1].type == 'bool':
t = self.symtables[-1].new_temp('int')
YEPCEntity.backpatch(p[1].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='1', arg2='', result=self.symtables[-1].get_symbol_name(t)))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 2, arg2='', result=''))
YEPCEntity.backpatch(p[1].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='0', arg2='', result=self.symtables[-1].get_symbol_name(t)))
p[1].place = t
if p[4].type == 'bool':
self.quadruples.append(QuadRuple(op='goto', arg1=p[3].quad, arg2='', result=''))
t = self.symtables[-1].new_temp('int')
YEPCEntity.backpatch(p[4].true_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='1', arg2='', result=self.symtables[-1].get_symbol_name(t)))
self.quadruples.append(QuadRuple(op='goto', arg1=len(self.quadruples) + 2, arg2='', result=''))
YEPCEntity.backpatch(p[4].false_list, len(self.quadruples))
self.quadruples.append(QuadRuple(op='=', arg1='0', arg2='', result=self.symtables[-1].get_symbol_name(t)))
p[4].place = t
self.quadruples.append(QuadRuple(op='if', result='',
arg1='%s %s %s' % (self.symtables[-1].get_symbol_name(p[1].place),
self.symtables[-1].get_symbol_name(p[2]),