-
Notifications
You must be signed in to change notification settings - Fork 0
/
SyntacticalAnalyzer.cpp
1164 lines (1144 loc) · 35.1 KB
/
SyntacticalAnalyzer.cpp
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
/*******************************************************************************
* Assignment: Project 3 - Syntactical Analyzer for Scheme program *
* Author: Team Creative *
* Date: 12-16-2017 *
* File: SyntacticalAnaylzer.cpp *
* *
* Description: This file contains the implementations for the Syntactical *
* Analyzer class. This includes our rule-lookup table, for *
* deciding which rule to use depending on our current position in *
* parsing, and our non-terminal functions, which define the *
* behavior and rules for each type of non-terminal. *
*******************************************************************************/
#include <iostream>
#include <iomanip>
#include <fstream>
#include "SyntacticalAnalyzer.h"
using namespace std;
// table: each entry stores the rule to be used for the current non-terminal
// (row) and current token (column). 0 values are either unreachable
// or represent an error (it will throw off the rest of parsing).
static int table [][36] = {
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,4,0},
{0,5,5,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,6,5,0,0,0},
{0,8,7,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,-2,7,0,0,0},
{0,-2,10,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-2,-2,12,0,0,0},
{0,13,13,13,13,13,0,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,-2,13,0,0,0},
{0,14,14,14,14,14,0,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,15,14,0,0,0},
{0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0},
{0,18,18,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,19,18,0,0,0},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,20,-2,0,0,0,0},
{0,22,23,23,22,22,22,22,22,22,22,22,22,0,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,21,-2,23,0,0,0},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24,25,0,0,0,0},
{0,49,0,0,29,26,27,50,51,28,30,31,32,0,33,34,35,36,37,38,43,39,40,41,42,44,45,46,47,48,0,-2,0,0,0,0},
{0,53,54,55,56,57,0,58,59,60,61,62,63,64,65,66,67,68,69,70,75,71,72,73,74,76,77,78,79,80,52,-2,81,0,0,0}
};
/*******************************************************************************
* Function: SyntacticalAnalyzer(char* filename) *
* *
* Parameters: char* object *
* Return value: none *
* Description: This function will create a SyntacticalAnalyzer object and open *
* our .p2 output file to write to. It also initializes the *
* parsing process by calling the Program function. *
*******************************************************************************/
SyntacticalAnalyzer::SyntacticalAnalyzer (char * filename)
{
tabs = 0;
lex = new LexicalAnalyzer (filename);
string name = filename;
string p2name = name.substr (0, name.length()-3) + ".p2";
string cppName = name.substr (0, name.length()-3) + ".cpp";
cg = new CodeGen (cppName, lex);
p2file.open (p2name.c_str());
token = lex->GetToken();
Program ();
}
/*******************************************************************************
* Function: ~SyntacticalAnalyzer() *
* *
* Parameters: none *
* Return value: none *
* Description: This function will free memory used by the class object's *
* LexicalAnalyzer instance and closes the output stream before *
* deleting the SytacticalAnalyzer. *
*******************************************************************************/
SyntacticalAnalyzer::~SyntacticalAnalyzer ()
{
delete cg;
delete lex;
p2file.close ();
}
/*******************************************************************************
* Function: Program() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "program" rule of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Program ()
{
p2file << "Entering Program function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
// token should be in firsts of Program
// Body of function goes here.
p2file << "Using Rule 1" << endl;
cg->WriteCode(tabs, "#include \"Object.h\"\n");
cg->WriteCode(tabs, "#include <iostream>\n");
cg->WriteCode(tabs, "using namespace std;\n\n");
errors += Define ();
errors += More_Defines ();
if (token != EOF_T)
{
errors++;
lex->ReportError ("Missing end of file at end of program");
}
// token should be in follows of Program
p2file << "Exiting Program function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Define() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "define" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Define()
{
p2file << "Entering Define funcion; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
p2file << "Using Rule 2" << endl;
if (token != LPAREN_T)
{
errors++;
lex->ReportError("Missing left paren at start of define");
}
if ((token = lex->GetToken()) != DEFINE_T)
{
errors++;
lex->ReportError("Missing define token in define");
}
if ((token = lex->GetToken()) != LPAREN_T)
{
errors++;
lex->ReportError("Missing second left paren from define");
}
if ((token = lex->GetToken()) != IDENT_T)
{
errors++;
lex->ReportError("Missing identifier from define");
}
bool isMain = false;
if (lex->GetLexeme() == "main")
{
cg->WriteCode(tabs, "int main() {\n");
tabs++;
cg->WriteCode(tabs, "int retval = 0;\n");
isMain = true;
}
else
cg->WriteCode(tabs, "Object "+lex->GetLexeme()+"(");
token = lex->GetToken();
errors += Param_List(true);
if (token != RPAREN_T)
{
errors++;
lex->ReportError("Missing first right paren from define");
}
if (!isMain)
{
cg->WriteCode(0, ") {\n");
tabs++;
cg->WriteCode(tabs, "Object retval;\n");
}
token = lex->GetToken();
errors += Stmt();
errors += Stmt_List();
if (token != RPAREN_T)
{
errors++;
lex->ReportError("Missing second right paren from define");
}
cg->WriteCode(tabs, "return retval;\n");
tabs--;
cg->WriteCode(tabs, "}\n");
token = lex->GetToken();
p2file << "Exiting Define function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: More_Defines() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "more defines" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::More_Defines()
{
p2file << "Entering More_Defines function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[2][token];
p2file << "Using Rule " << rule << endl;
if (rule == 3)
{
cg->WriteCode(tabs, "\n");
errors += Define();
errors += More_Defines();
token = lex->GetToken();
}
p2file << "Exiting More_Defines function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Stmt_List() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "statement list" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Stmt_List()
{
p2file << "Entering Stmt_List function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[3][token];
p2file << "Using Rule " << rule << endl;
if (rule == 5)
{
// no WriteCode calls required, instead handled by Stmt()
errors += Stmt();
errors += Stmt_List();
}
p2file << "Exiting Stmt_List function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Stmt() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "statement" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Stmt()
{
p2file << "Entering Stmt function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[4][token];
p2file << "Using Rule " << rule << endl;
switch (rule)
{
case 7:
errors += Literal();
break;
case 8:
if (token != IDENT_T)
{
errors++;
lex->ReportError("Missing identifier in stmt");
}
cg->WriteCode(tabs, lex->GetLexeme());
token = lex->GetToken();
break;
case 9:
if (token != LPAREN_T)
{
errors++;
lex->ReportError("Missing left paren in stmt");
}
token = lex->GetToken();
errors += Action();
if (token != RPAREN_T)
{
errors++;
lex->ReportError("Missing right paren in stmt");
}
token = lex->GetToken();
break;
}
p2file << "Exiting Stmt function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Literal() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve any *
* "literal" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Literal()
{
p2file << "Entering Literal function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
int errors = 0;
int rule = table[5][token];
p2file << "Using Rule " << rule << endl;
switch (rule)
{
case 10:
if (token != NUMLIT_T)
{
errors++;
lex->ReportError("Missing number for literal");
}
cg->WriteCode(tabs, "Object("+lex->GetLexeme()+")");
token = lex->GetToken();
break;
case 11:
if (token != STRLIT_T)
{
errors++;
lex->ReportError("Missing string for literal");
}
cg->WriteCode(tabs, "Object(\""+lex->GetLexeme()+"\")");
token = lex->GetToken();
break;
case 12:
if (token != QUOTE_T)
{
errors++;
lex->ReportError("Missing quote for literal");
}
// Output via WriteCode continues through Quoted_Lit()
// call, we must print each lexeme from the quoted lit
// separately.
cg->WriteCode(tabs, "Object(\"");
token = lex->GetToken();
errors += Quoted_Lit();
cg->WriteCode(0, "\")");
break;
}
p2file << "Exiting Literal function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Quoted_Lit() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "quoted list" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Quoted_Lit()
{
p2file << "Entering Quoted_Lit function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
p2file << "Using Rule 13" << endl;
// WriteCode handled in Any_Other_Token() because we may need to grab
// multiple tokens for our quoted lit
errors += Any_Other_Token();
p2file << "Exiting Quoted_Lit function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: More_Tokens() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "more tokens" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::More_Tokens()
{
p2file << "Entering More_Tokens function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[7][token];
p2file << "Using Rule " << rule << endl;
if (rule == 14)
{
errors += Any_Other_Token();
errors += More_Tokens();
token = lex->GetToken();
}
p2file << "Exiting More_Tokens function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Param_List() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "parameter list" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Param_List(bool first)
{
p2file << "Entering Param_List function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[8][token];
p2file << "Using Rule " << rule << endl;
if (rule == 16)
{
if (token != IDENT_T)
{
errors++;
lex->ReportError("Missing identifier in param_list");
}
if (!first)
cg->WriteCode(0, ", ");
cg->WriteCode(0, "Object "+lex->GetLexeme());
token = lex->GetToken();
errors += Param_List(false);
}
return errors;
}
/*******************************************************************************
* Function: Else_Part() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "else part" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Else_Part()
{
p2file << "Entering Else_Part function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[9][token];
p2file << "Using Rule " << rule << endl;
if (rule == 18)
{
cg->WriteCode(tabs, "else {\n");
tabs++;
errors += Stmt();
}
p2file << "Exiting Else_Part function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Stmt_Pair() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "statement pair" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Stmt_Pair()
{
p2file << "Entering Stmt_Pair function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
p2file << "Using Rule 20" << endl;
if (token != LPAREN_T)
{
errors++;
lex->ReportError("Missing left paren from stmt_pair");
}
token = lex->GetToken();
errors += Stmt_Pair_Body();
if (token != RPAREN_T)
{
errors++;
lex->ReportError("Missing right paren from stmt_pair");
}
token = lex->GetToken();
p2file << "Exiting Stmt_Pair function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Stmt_Pair_Body() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles further cases of "statment pair" *
* found in rules 21, 22, and 23. *
*******************************************************************************/
int SyntacticalAnalyzer::Stmt_Pair_Body()
{
p2file << "Entering Stmt_Pair_Body function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[11][token];
p2file << "Using Rule " << rule << endl;
switch (rule)
{
case 21:
if (token != LPAREN_T)
{
errors++;
lex->ReportError("Missing left paren for stmt_pair_\
body");
}
token = lex->GetToken();
errors += Action();
if (token != RPAREN_T)
{
errors++;
lex->ReportError("Missing right paren for stmt_pair_\
body");
}
token = lex->GetToken();
errors += Stmt();
break;
case 22:
errors += Action();
break;
case 23:
errors += Literal();
break;
}
p2file << "Exiting Stmt_Pair_Body function; current token is: "
/*<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: More_Pairs() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "more pairs" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::More_Pairs()
{
p2file << "Entering More_Pairs function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[12][token];
p2file << "Using Rule " << rule << endl;
if (rule == 24)
{
errors += Stmt_Pair();
errors += More_Pairs();
}
p2file << "Exiting More_Pairs function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Action() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "action" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Action()
{
p2file << "Entering Action function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[13][token];
p2file << "Using Rule " << rule << endl;
switch (rule)
{
case 26:
if (token != IF_T)
{
errors++;
lex->ReportError("Missing if token at start\
of action");
}
cg->WriteCode(tabs, "if (");
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, ") {\n");
tabs++;
errors += Stmt();
tabs--;
cg->WriteCode(tabs, "}\n");
errors += Else_Part();
break;
case 27:
if (token != COND_T)
{
errors++;
lex->ReportError("Missing cond token at start\
of action");
}
token = lex->GetToken();
errors += Stmt_Pair();
errors += More_Pairs();
break;
case 28:
if (token != LISTOP_T)
{
errors++;
lex->ReportError("Missing listop at start\
of action");
}
token = lex->GetToken();
errors += Stmt();
break;
case 29:
if (token != CONS_T)
{
errors++;
lex->ReportError("Missing cons at start\
of action");
}
token = lex->GetToken();
errors += Stmt();
break;
case 30:
if (token != AND_T)
{
errors++;
lex->ReportError("Missing and at start\
of action");
}
token = lex->GetToken();
errors += Stmt_List();
break;
case 31:
if (token != OR_T)
{
errors++;
lex->ReportError("Missing or at start\
of action");
}
token = lex->GetToken();
errors += Stmt_List();
break;
case 32:
if (token != NOT_T)
{
errors++;
lex->ReportError("Missing not at start\
of action");
}
token = lex->GetToken();
errors += Stmt();
break;
case 33:
if (token != NUMBERP_T)
{
errors++;
lex->ReportError("Missing number predicate\
at start of action");
}
cg->WriteCode(0, "numberp(");
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, ")");
break;
case 34:
if (token != SYMBOLP_T)
{
errors++;
lex->ReportError("Missing symbol predicate\
at start of action");
}
cg->WriteCode(0, "symbolp(");
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, ")");
break;
case 35:
if (token != LISTP_T)
{
errors++;
lex->ReportError("Missing list predicate\
at start of action");
}
cg->WriteCode(0, "listp(");
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, ")");
break;
case 36:
if (token != ZEROP_T)
{
errors++;
lex->ReportError("Missing zero predicate\
at start of action");
}
cg->WriteCode(0, "zerop(");
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, ")");
break;
case 37:
if (token != NULLP_T)
{
errors++;
lex->ReportError("Missing null predicate\
at start of action");
}
cg->WriteCode(0, "nullp(");
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, ")");
break;
case 38:
if (token != STRINGP_T)
{
errors++;
lex->ReportError("Missing string predicate\
at start of action");
}
cg->WriteCode(0, "stringp(");
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, ")");
break;
case 39:
if (token != PLUS_T)
{
errors++;
lex->ReportError("Missing plus at start\
of action");
}
token = lex->GetToken();
errors += Stmt_List();
break;
case 40:
if (token != MINUS_T)
{
errors++;
lex->ReportError("Missing minus at start\
of action");
}
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, " - ");
errors += Stmt_List();
break;
case 41:
if (token != DIV_T)
{
errors++;
lex->ReportError("Missing division symbol\
at start of action");
}
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, " / ");
errors += Stmt_List();
break;
case 42:
if (token != MULT_T)
{
errors++;
lex->ReportError("Missing multiplication symbol\
at start of action");
}
token = lex->GetToken();
errors += Stmt_List();
break;
case 43:
if (token != MODULO_T)
{
errors++;
lex->ReportError("Missing modulo symbol\
at start of action");
}
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, " % ");
errors += Stmt();
break;
case 44:
if (token != EQUALTO_T)
{
errors++;
lex->ReportError("Missing equalto symbol\
at start of action");
}
//TODO: must handle == case
token = lex->GetToken();
errors += Stmt_List();
break;
case 45:
if (token != GT_T)
{
errors++;
lex->ReportError("Missing greater than at\
start of action");
}
token = lex->GetToken();
errors += Stmt_List();
break;
case 46:
if (token != LT_T)
{
errors++;
lex->ReportError("Missing less than at\
start of action");
}
token = lex->GetToken();
errors += Stmt_List();
break;
case 47:
if (token != GTE_T)
{
errors++;
lex->ReportError("Missing greater than or\
equals symbol at start of action");
}
token = lex->GetToken();
errors += Stmt_List();
break;
case 48:
if (token != LTE_T)
{
errors++;
lex->ReportError("Missing less than or\
equals symbol at start of action");
}
token = lex->GetToken();
errors += Stmt_List();
break;
case 49:
if (token != IDENT_T)
{
errors++;
lex->ReportError("Missing identifier at start\
of action");
}
token = lex->GetToken();
errors += Stmt_List();
break;
case 50:
if (token != DISPLAY_T)
{
errors++;
lex->ReportError("Missing display at start\
of action");
}
cg->WriteCode(tabs, "cout << ");
token = lex->GetToken();
errors += Stmt();
cg->WriteCode(0, ";");
break;
case 51:
if (token != NEWLINE_T)
{
errors++;
lex->ReportError("Missing newline in action");
}
cg->WriteCode(tabs, "cout << endl;\n");
token = lex->GetToken();
break;
}
p2file << "Exiting Action function; current token is: "
<< lex->GetTokenName(token) /*<< ", lexeme: " << lex->GetLexeme()*/ << endl;
return errors;
}
/*******************************************************************************
* Function: Any_Other_Token() *
* *
* Parameters: none *
* Return value: an integer value, the number of errors *
* Description: This fucntion handles all cases which involve the *
* "any other token" rules of our grammar. *
*******************************************************************************/
int SyntacticalAnalyzer::Any_Other_Token()
{
p2file << "Entering Any_Other_Token function; current token is: "
<< lex->GetTokenName(token) << ", lexeme: " << lex->GetLexeme() << endl;
int errors = 0;
int rule = table[14][token];
p2file << "Using Rule " << rule << endl;
switch (rule)
{
case 52:
if (token != LPAREN_T)
{
errors++;
lex->ReportError("Missing Left Paren token at start\
of any other token");
}
token = lex->GetToken();
errors += More_Tokens();
if (token != RPAREN_T)
{
errors++;
lex->ReportError("Missing Right Paren token at start\
of any other token");
}
token = lex->GetToken();
break;
case 53:
if (token != IDENT_T)
{
errors++;
lex->ReportError("Missing Ident token at start\
of any other token");
}
token = lex->GetToken();
break;
case 54:
if (token != NUMLIT_T)
{
errors++;
lex->ReportError("Missing num lit token at start\
of any other token");
}
token = lex->GetToken();
break;
case 55:
if (token != STRLIT_T)
{
errors++;
lex->ReportError("Missing str lit token at start\
of any other token");
}
token = lex->GetToken();
break;
case 56:
if (token != CONS_T)
{
errors++;
lex->ReportError("Missing Cons token at start\
of any other token");
}
token = lex->GetToken();
break;
case 57:
if (token != IF_T)
{
errors++;
lex->ReportError("Missing if token at start\
of any other token");
}
token = lex->GetToken();
break;
case 58:
if (token != DISPLAY_T)
{
errors++;
lex->ReportError("Missing Display token at start\
of any other token");
}
token = lex->GetToken();
break;
case 59:
if (token != NEWLINE_T)
{
errors++;
lex->ReportError("Missing newline token at start\
of any other token");
}
token = lex->GetToken();
break;
case 60:
if (token != LISTOP_T)
{
errors++;
lex->ReportError("Missing list op token at start\
of any other token");
}
token = lex->GetToken();
break;
case 61:
if (token != AND_T)
{
errors++;
lex->ReportError("Missing and token at start\
of any other token");
}
token = lex->GetToken();
break;
case 62:
if (token != OR_T)
{
errors++;
lex->ReportError("Missing or token at start\
of any other token");
}
token = lex->GetToken();
break;
case 63:
if (token != NOT_T)
{
errors++;
lex->ReportError("Missing not token at start\
of any other token");
}
token = lex->GetToken();
break;
case 64:
if (token != DEFINE_T)
{
errors++;