-
Notifications
You must be signed in to change notification settings - Fork 0
/
CMMGrammar.java
724 lines (587 loc) · 41.1 KB
/
CMMGrammar.java
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
package edu.ntu.compilers.lab4.cmmgrammar;
import edu.ntu.compilers.lab4.parser.*;
import edu.ntu.compilers.lab4.cmmcompiler.*;
import edu.ntu.compilers.lab4.scanner.*;
import edu.ntu.compilers.lab4.tokens.*;
import java.util.ArrayList;
public grammar CMMGrammar<Token, CMMTokenName> {
// list of passes with return type
// optional
grammarpasses {
/**
* The first pass to setup the symbol tables, beautify the AST and generate labels
* Label generation should generally not be mixed with non-code-generation passes, but CMM is just so simple...
*/
void prep0;
/**
* Code generation pass
*/
void gen;
}
// custom members of the emitted CMMGrammar class
// optional
grammarmembers {
public final CompilerContext Context;
public final Scanner Scanner;
public final Checker Checker;
public final Code Code;
public CMMGrammar(CompilerContext context, Scanner scanner) {
Context = context;
Scanner = scanner;
Checker = new Checker(Context);
Code = new Code(Context);
}
public class VarList extends ArrayList<VarOccurrence> {}
public class PrintableExpressionList extends ArrayList<PrintableExpr> {}
public class IntegerList extends ArrayList<Integer> {}
public class ArithExprList extends ArrayList<ArithExpr> {}
public LL1PredictTable createPredictTable() {
return new LL1PredictTable(this);
}
public enum BaseType {
Integer
}
}
// members of the emitted Node class
// optional
grammarnode {
/**
* The first Stmt that is found to the right of this node
*/
public Stmt getNextStmt() {
if (Parent == null) {
return null;
}
return Parent.getFirstStmtToTheRightOf(index());
}
/**
* The first Stmt to the right of the child node at the given index.
*/
public Stmt getFirstStmtToTheRightOf(int index) {
index++; // index of the next child
if (this instanceof TerminalNode || Rule.getSymbolCount() <= index) {
// there is no more child to the right, go to parent
if (Parent == null) {
return null;
}
return Parent.getFirstStmtToTheRightOf(index());
}
Node child = getChild(index);
if (child instanceof Stmt) {
return (Stmt)child;
}
// child is not a Stmt -> Keep looking, starting at the first child of the child
return child.getFirstStmtToTheRightOf(-1);
}
}
// all Non-Terminal definitions
Program :
Block
(gen) {
// at this point, we are already inside the main method
if (Code.HasScanStmt) {
// allocate and initialize the Scanner object
Code.Gen.initScanner();
}
// generate code
$1.gen();
// return from method
Code.Gen.returnn();
}
;
Block
grammarmembers {
public Scope Scope;
}
:
OpenCurly MultiVarDeclStar StmtStar CloseCurly
(prep0) {
// create & traverse scope
Scope = Context.newScope(this);
propagate_prep0();
Context.leaveScope();
}
(gen) {
// traverse scope
Context.enterScope(Scope);
propagate_gen();
Context.leaveScope();
}
;
MultiVarDeclStar :
MultiVarDecl MultiVarDeclStar
|
;
StmtStar :
Stmt StmtStar
|
;
MultiVarDecl :
Type VarDeclIdList Semicolon
(prep0) {
// explicit propagation
$1.prep0();
$2.prep0($1);
}
;
VarDeclIdList :
VarDecl CommaIdStar
(prep0 Type type) {
$1.prep0(type);
$2.prep0(type);
}
;
VarDecl
grammarmembers {
public Scope Scope;
public Type Type;
public String Name;
public int Id; // this is the Id'th variable inside the current scope
public String toString() { return Name; }
}
:
Identifier
(prep0 Type type) {
Scope = Context.getCurrentScope();
Type = type;
Name = $1.Token.stringValue();
Id = Scope.declareVar(this);
}
(gen) {
// allocate arrays
if (Type.isArray()) {
Code.Gen.newArray(this);
}
}
;
CommaIdStar :
Comma VarDeclIdList
(prep0 Type type) {
$2.prep0(type);
}
|
;
Type
grammarmembers {
public BaseType BaseType;
public final IntegerList ArrayDimensions = new IntegerList();
public boolean isArray() {
return ArrayDimensions.size() != 0;
}
}
:
Int NumArrayStar
(prep0) {
BaseType = BaseType.Integer;
$2.prep0(ArrayDimensions);
}
;
NumArrayStar :
OpenBrackets NumberLiteral CloseBrackets
NumArrayStar
(prep0 IntegerList dims) {
dims.add($2.Token.intValue());
$4.prep0(dims);
}
|
;
VarOccurrence
grammarmembers {
public String Name;
public final ArithExprList ArrayDimensions = new ArithExprList();
public VarDecl Decl;
public boolean isArray() {
return ArrayDimensions.size() != 0;
}
}
:
Identifier ArithArrayStar
(prep0) {
Name = $1.Token.stringValue();
$2.prep0(ArrayDimensions);
// make sure that the given identifier exists and that it has the correct amount of array dimensions
// and if so, associate it with it's declaration
Context.getCurrentScope().lookupVariable(this);
assert(Decl != null);
}
(gen) {
assert(Name != null && Decl != null);
if (isArray()) {
Code.Gen.aload(this); // load reference
// during array generation, we always must load, not store
boolean isStore = Code.IsStore; // save old value
Code.IsStore = false;
$2.gen(); // generate array accessors
Code.IsStore = isStore; // restore old value
if (!Code.IsStore) {
// load value from array
Code.Gen.iaload(this); // load value
}
}
else if (!Code.IsStore) {
Code.Gen.iload(this); // load value
}
else {
// we do not generate anything for the LHS of a non-array variable occurence
}
}
;
ArithArrayStar :
OpenBrackets ArithExpr CloseBrackets
ArithArrayStar
(prep0 ArithExprList dims) {
$2.prep0();
dims.add($2);
$4.prep0(dims);
}
(gen) {
$2.gen(); // calculate expression
if (!$4.isLambda()) {
// load array reference
Code.Gen.aaload();
// generate next array accessor
$4.gen();
}
}
|
;
Stmt
:
[Assignment]
VarOccurrence Equal ArithExpr Semicolon
(gen) {
boolean isStore = Code.IsStore; // save old value
Code.IsStore = true;
$1.gen(); // load address to store (if necessary)
Code.IsStore = isStore; // restore old value
$3.gen(); // calculate result
Code.Gen.storeValue($1.Decl); // store result
}
| [IfStmt]
If OpenParentheses LogicExprTop
CloseParentheses Block ElseStmtOpt
(gen) {
LogicExprState state = new LogicExprState(
Code.createLabel(),
Code.createLabel());
// gen LogicExpr
$3.gen(state);
// gen True label
Code.Gen.label(state.TrueLabel);
// gen If Block
$5.gen();
if (!$6.isLambda()) {
// jump over else block, if we took the "True path"
Label behindElseLabel = Code.createLabel();
Code.Gen.jump(behindElseLabel);
// gen labeled Else Block
Code.Gen.label(state.FalseLabel);
$6.gen();
// gen label behind statement
Code.Gen.label(behindElseLabel);
}
else {
// gen FalseLabel
Code.Gen.label(state.FalseLabel);
}
}
| [WhileStmt]
While OpenParentheses LogicExprTop
CloseParentheses Block
grammarmembers {
Label StartLabel, EndLabel;
}
(gen) {
StartLabel = Code.createLabel();
Code.pushLoop(this); // remember loop for break and continue statements
LogicExprState state = new LogicExprState(
Code.createLabel(),
EndLabel = Code.createLabel());
// mark beginning of loop
Code.Gen.label(StartLabel);
// gen LogicExpr
$3.gen(state);
// gen TrueLabel
Code.Gen.label(state.TrueLabel);
// gen loop block
$5.gen();
// jump back to beginning of loop
Code.Gen.jump(StartLabel);
// gen FalseLabel
Code.Gen.label(state.FalseLabel);
Code.popLoop(this);
}
| Break Semicolon
(gen) {
// GOTO first instruction behind the current loop
Code.Gen.jump(Code.getCurrentLoop().EndLabel);
}
| Continue Semicolon
(gen) {
// GOTO beginning of current loop
Code.Gen.jump(Code.getCurrentLoop().StartLabel);
}
| [ScanStmt]
Scan OpenParentheses ScanVarList
CloseParentheses Semicolon
(prep0) {
// at least one scan statement -> need to generate the code to initialize the scanner
Code.HasScanStmt = true;
propagate_prep0();
}
(gen) {
boolean isStore = Code.IsStore; // save old value
Code.IsStore = true;
propagate_gen();
Code.IsStore = isStore; // restore old value of IsStore
}
|
PrintStatementBase
|
Block
;
ElseStmtOpt :
Else Block
|
;
PrintStatementBase
:
[PrintStmt]
Print OpenParentheses PrintableExprList
CloseParentheses Semicolon
|
[PrintlnStmt]
Println OpenParentheses PrintableExprList
CloseParentheses Semicolon
(gen) {
propagate_gen();
Code.Gen.println(); // print newline at the end
}
;
PrintableExprList :
PrintableExpr CommaPrintableExprStar
;
CommaPrintableExprStar :
Comma PrintableExprList
|
;
// create a single NonTerminal that applies each path to all rules of the nested NonTerminal
// can be substituted by a method that allows NonTerminals to implement passes for all of it's rules
PrintableExpr
:
PrintableExprImpl
(gen) {
Code.Gen.print($1); // print
}
;
PrintableExprImpl :
[PrintableString]
StringLiteral
(gen) {
// load constant
Code.Gen.ldc($1.Token.stringValue());
}
| [PrintableInt]
ArithExpr
;
ScanVarList :
ScanVar CommaScanVarStar
;
CommaScanVarStar :
Comma ScanVar CommaScanVarStar
|
;
ScanVar :
VarOccurrence
(gen) {
$1.gen(); // load address, if necessary
Code.Gen.scan(); // call scanner method
Code.Gen.storeValue($1.Decl); // store return value
}
;
// arithmetic expressions
ArithExpr :
ArithExprProduct ArithExprPlusMinus
;
ArithExprProduct :
UnaryArithExpr ArithExprProductMulDiv
;
UnaryArithExpr :
Plus UnaryArithExprNoPrefix // does nothing
| Minus UnaryArithExprNoPrefix
(gen) {
// negates the number
propagate_gen();
Code.Gen.neg();
}
| UnaryArithExprNoPrefix
;
UnaryArithExprNoPrefix :
VarOccurrence
| NumberLiteral
(gen) {
Code.Gen.ldc($1.Token.intValue());
}
| OpenParentheses ArithExpr CloseParentheses
;
ArithExprPlusMinus :
Plus ArithExprProduct ArithExprPlusMinus
(gen) {
$2.gen();
Code.Gen.add();
$3.gen();
}
| Minus ArithExprProduct ArithExprPlusMinus
(gen) {
$2.gen();
Code.Gen.sub();
$3.gen();
}
|
;
ArithExprProductMulDiv :
Star UnaryArithExpr ArithExprProductMulDiv
(gen) {
$2.gen();
Code.Gen.mul();
$3.gen();
}
| Slash UnaryArithExpr ArithExprProductMulDiv
(gen) {
$2.gen();
Code.Gen.div();
$3.gen();
}
|
;
// logic expressions
LogicExprTop :
LogicExpr
(gen LogicExprState les) {
$1.gen(les);
}
;
LogicExpr :
AndLogicExpr LogicExprOrRHS
(gen LogicExprState leState) {
LogicExprState $1State = leState;
Label rhsLabel = null;
if (!$2.isLambda()) {
// RHS of "||" exists
rhsLabel = Code.createLabel();
$1State = leState.copy();
$1State.Left = true;
$1State.Comparer = CMMTokenName.LogicalOr;
if (leState.Negated) {
// we jump to the RHS, if the LHS is true
$1State.TrueLabel = rhsLabel;
}
else {
// we jump to the RHS, if the LHS is false
$1State.FalseLabel = rhsLabel;
}
}
$1.gen($1State);
if (!$2.isLambda()) {
// right of or
// generate label to jump to
Code.Gen.label(rhsLabel);
$2.gen(leState);
}
}
;
LogicExprOrRHS // represents the RHS of an "||"
:
LogicalOr LogicExpr
(gen LogicExprState leState) {
$2.gen(leState);
}
|
;
AndLogicExpr :
UnaryLogicExpr LogicExprAndRHS
(gen LogicExprState leState) {
LogicExprState $1State = leState;
Label rhsLabel = null;
if (!$2.isLambda()) {
// RHS of "&&" exists
rhsLabel = Code.createLabel();
$1State = leState.copy();
$1State.Left = true;
$1State.Comparer = CMMTokenName.LogicalAnd;
if (leState.Negated) {
// we jump to the RHS, if the LHS is false
$1State.FalseLabel = rhsLabel;
}
else {
// we jump to the RHS, if the LHS is true
$1State.TrueLabel = rhsLabel;
}
}
$1.gen($1State);
if (!$2.isLambda()) {
// right of and
// generate label to jump to
Code.Gen.label(rhsLabel);
$2.gen(leState);
}
}
;
LogicExprAndRHS // represents the RHS of an "&&"
:
LogicalAnd AndLogicExpr
(gen LogicExprState leState) {
$2.gen(leState);
}
|
;
UnaryLogicExpr :
ArithExpr ArithExprComparisonSuffix
(gen LogicExprState leState) {
$1.gen();
$2.gen(leState);
}
| OpenBrackets LogicExpr CloseBrackets
(gen LogicExprState leState) {
$2.gen(leState);
}
| Exclamation UnaryLogicExpr
(gen LogicExprState leState) {
leState.Negated = !leState.Negated;
$2.gen(leState);
leState.Negated = !leState.Negated;
}
;
ArithExprComparisonSuffix :
Greater ArithExpr
(gen LogicExprState leState) {
$2.gen();
Code.Gen.cmpGT(leState);
}
| GreaterEqual ArithExpr
(gen LogicExprState leState) {
$2.gen();
Code.Gen.cmpGE(leState);
}
| Less ArithExpr
(gen LogicExprState leState) {
$2.gen();
Code.Gen.cmpLT(leState);
}
| LessEqual ArithExpr
(gen LogicExprState leState) {
$2.gen();
Code.Gen.cmpLE(leState);
}
| EqualEqual ArithExpr
(gen LogicExprState leState) {
$2.gen();
Code.Gen.cmpEQ(leState);
}
| NotEqual ArithExpr
(gen LogicExprState leState) {
$2.gen();
Code.Gen.cmpNE(leState);
}
;
}