-
Notifications
You must be signed in to change notification settings - Fork 7
/
PGParser.cpp
1433 lines (1293 loc) · 62.2 KB
/
PGParser.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
#ifdef LRSTAR
/////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// PGParser.
/* Generated by: LRSTAR 6.5.019
Grammar: PG.grm
Skeleton: PGParser.cpp.skl
Output: PGParser.cpp
*/
#include "ComGlobal.h"
#include "PGGlobal.h"
#include "PGParser.h"
#include "PGActions.h"
#define STKSIZE 1000 // Parser stack size.
#define ACCEPT_STATE 115 // Final state.
#define LOOKAHEADS 2
/*--- Constants. -------------------------------------------------------------*/
int PGParser::n_terms = 42; // No. of terminals.
int PGParser::n_heads = 96; // No. of non-terminals.
int PGParser::n_prods = 198; // No. of productions.
int PGParser::n_states = 116; // No. of states.
int PGParser::eol_symb = 0; // EOL symbol number
int PGParser::eof_symb = 7; // EOF symbol number
int PGParser::err_used = 0; // <error> used in grammar
int PGParser::N_args;
int* PGParser::F_narg;
int* PGParser::Arg_numb;
int PGParser::N_strings;
int PGParser::N_tails;
int PGParser::N_terms;
int* PGParser::Node_numb;
int* PGParser::Nact_numb;
char** PGParser::Node_start;
char** PGParser::Nact_start;
int PGParser::N_heads;
int PGParser::N_generated;
int PGParser::N_nodes;
int PGParser::N_tacts; // token actions.
int PGParser::N_pacts; // parsing actions (total).
int PGParser::N_nacts;
int PGParser::N_ints;
int PGParser::N_prods;
char** PGParser::Str_start;
int* PGParser::f_eri;
int* PGParser::F_targ;
int* PGParser::F_parg;
int* PGParser::F_prod;
int* PGParser::eri_prod;
int* PGParser::eri_dot;
int PGParser::n_eris;
char** PGParser::Tact_start;
int* PGParser::Tact_numb;
int* PGParser::Reverse;
int PGParser::opt_states;
int* PGParser::Oper_prec;
char* PGParser::Prec;
char** PGParser::Pact_start;
int* PGParser::Pact_numb;
int* PGParser::Defcon_value;
char** PGParser::Defcon_name;
int PGParser::eol_term;
int PGParser::eof_term;
int PGParser::error_sym_used;
int PGParser::make_ast;
int PGParser::keyword_sym;
int PGParser::n_constants;
/*--- Terminal and Nonterminal Symbols of the Grammar. -----------------------*/
// Terminal symbols of the grammar.
char* PGParser::term_symb[42] =
{
"<error>",
"<alpha>",
"<lexical>",
"<semantic>",
"<literal>",
"<string>",
"<integer>",
"<eof>",
"\'<keyword>\'",
"\'<error>\'",
"\'<eof>\'",
"{goal_symbol}",
"{head_symbol}",
"\':\'",
"\'->\'",
"\'~>\'",
"\'/->\'",
"\'/~>\'",
"\'|\'",
"\';\'",
"\'=>\'",
"\'+>\'",
"\'*>\'",
"\'=+>\'",
"\'=*>\'",
"\'^\'",
"\'{\'",
"\'}\'",
"\'<<\'",
"\'>>\'",
"\'+\'",
"\'...\'",
"\'~\'",
"\'~..\'",
"\'?\'",
"\'*\'",
"\'/\'",
"\'(\'",
"\')\'",
"\'[\'",
"\']\'",
"\',\'"
};
/*--- Bit Matrix and Access Vectors. -----------------------------------------*/
// B_matrix.
uchar PGParser::Bm [126] =
{
0, 0, 0, 0, 16, 0, 0, 0, 64, 0, 0, 0, 14, 3, 0, 0, 46, 3, 0, 0,
0, 3, 0, 0, 8, 0, 4, 0, 0, 14, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0,
48, 0, 0, 14, 0, 32, 0, 0, 0, 32, 0, 8, 0, 0, 142, 1, 0, 32, 62, 3,
0, 64, 0, 112, 0, 0, 6, 0, 0, 128, 23, 0, 0, 0, 8, 0, 0, 0, 23, 0,
0, 128, 25, 0, 128, 0, 0, 0, 64, 1, 0, 128, 1, 0, 224, 1, 0, 96, 1, 0,
6, 0, 0, 32, 0, 0, 0, 128, 34, 0, 0, 0, 62, 3, 0, 0, 96, 0, 0, 128,
5, 32, 0, 0, 64, 0
};
// B_matrix row.
uchar PGParser::Br [116] =
{
4, 8, 0, 12, 2, 16, 19, 12, 12, 22, 22, 25, 2, 29, 32, 19, 22, 32, 36, 12,
12, 0, 39, 43, 32, 46, 50, 54, 54, 6, 58, 62, 64, 35, 67, 71, 75, 79, 54, 54,
64, 83, 85, 0, 0, 90, 93, 96, 54, 54, 54, 54, 54, 32, 36, 36, 36, 36, 36, 100,
5, 0, 54, 104, 32, 83, 108, 112, 32, 54, 83, 32, 32, 54, 115, 32, 64, 54, 64, 64,
64, 64, 46, 46, 36, 0, 46, 0, 117, 54, 0, 83, 64, 64, 121, 46, 46, 36, 5, 54,
0, 0, 112, 54, 85, 0, 30, 0, 112, 112, 0, 30, 5, 112, 5, 0
};
// B_matrix column.
uchar PGParser::Bc [42] =
{
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 0,
3, 4
};
// B_matrix mask.
uchar PGParser::Bmask [42] =
{
1, 2, 4, 8, 4, 16, 32, 64, 128, 1, 2, 4, 8, 16, 32, 64, 64, 64, 128, 1,
2, 4, 4, 4, 4, 8, 16, 32, 64, 64, 128, 1, 2, 4, 8, 8, 16, 32, 64, 128,
128, 1
};
/*--- Terminal Transition Matrix and Access Vectors. ------------------------*/
// T_matrix.
short PGParser::Tm [184] =
{
-133, -136, -127, -130, -165, -106, -107, 0, -108, 0, 0, 0, 0, 0, -125, 0, 0, 0, 0, 0,
0, 0, 0, 0, -15, 0, 0, 0, -146, -147, 89, -164, -87, -88, 0, -89, -100, -102, -103, -101,
-94, 0, 0, 0, 0, 0, -13, 0, -105, 0, 0, -104, 0, 0, 0, 0, 0, 0, 0, 0,
0, 38, -144, 39, 0, 108, 43, -156, -157, -158, -160, 0, -58, -59, -60, -55, -177, 0, -159, 0,
-61, -161, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -140, 44, -28, -29, -30, -31, -39, 0,
-58, -59, -60, 99, -12, 18, 0, 0, -61, 29, 0, 0, -66, -67, 0, 0, -93, -91, 59, 102,
-143, -162, 0, 113, 16, -18, -19, 10, -23, 48, 49, 50, 51, -55, -8, 54, 55, -21, 52, -22,
56, 57, 58, -83, -82, -84, 0, 0, 59, 94, 90, -10, 0, 109, 9, -18, -19, 10, -23, 27,
28, -34, -47, 66, -14, 18, -3, -17, 13, -22, -26, -27, -73, -74, -75, -76, -79, -80, 59, 30,
-141, 115, -96, 67
};
// T_matrix row.
uchar PGParser::Tr [116] =
{
154, 154, 154, 154, 154, 124, 154, 154, 154, 154, 124, 154, 154, 94, 124, 94, 154, 14, 14, 154,
124, 154, 154, 94, 36, 154, 154, 36, 36, 154, 66, 124, 124, 94, 154, 154, 124, 94, 36, 36,
124, 154, 154, 154, 154, 66, 66, 66, 36, 36, 36, 36, 36, 66, 2, 3, 3, 0, 0, 5,
124, 154, 36, 154, 66, 154, 4, 66, 66, 36, 124, 66, 66, 36, 94, 66, 124, 36, 124, 124,
124, 124, 154, 124, 1, 154, 124, 154, 14, 36, 154, 94, 124, 124, 94, 94, 94, 1, 14, 36,
154, 154, 66, 36, 36, 154, 124, 154, 66, 66, 154, 94, 2, 66, 3, 154
};
// T_matrix column.
uchar PGParser::Tc [42] =
{
0, 0, 1, 2, 3, 12, 27, 27, 12, 15, 4, 7, 8, 5, 6, 7, 8, 14, 9, 10,
11, 12, 16, 17, 18, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27,
28, 29
};
/*--- Nonterminal Transition Matrix and Access Vectors. ---------------------*/
// N_matrix.
short PGParser::Nm [616] =
{
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, -109, 0, 0, 0, 0, -187, 0, 88, -68, -90, -69, -92, 34,
35, 36, -183, -64, 0, 37, -68, -90, -69, -92, 34, 35, 36, 0, 0, 0, 37, 0, 114, -149,
0, -148, -152, -153, -154, 41, -186, 0, 0, -68, -90, -69, -92, 34, 35, 36, 92, -182, -64, 37,
0, -68, -90, -69, -92, 34, 35, 36, 93, -182, -64, 37, 0, -68, -90, -69, -92, 34, 35, 36,
0, -186, 0, 37, -68, -90, -69, -92, 34, 35, 36, 98, 61, 0, 37, 0, 0, 0, 76, -182,
-64, 0, 103, -68, -90, -69, -92, 34, 35, 36, 0, 0, 77, 37, 0, 0, -50, -112, -113, -114,
-115, -116, 0, 0, 77, 78, -182, -64, 0, 0, -68, -90, -69, -92, 34, 35, 36, 62, 0, -145,
37, 0, 0, -51, -112, -113, -114, -115, -116, 0, 0, -36, 0, 0, 77, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 110, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -41, 0,
0, 77, 81, -182, -64, 0, 0, -68, -90, -69, -92, 34, 35, 36, 0, 0, 0, 37, 0, 0,
-57, -112, -113, -114, -115, -116, 79, -182, -64, 0, 0, -68, -90, -69, -92, 34, 35, 36, 0, 0,
0, 37, 0, 112, -52, -112, -113, -114, -115, -116, 0, 0, 0, 0, 0, -46, 0, 0, 77, 0,
0, 0, 0, 0, 0, 0, 0, -191, 0, -190, -152, -153, -154, 41, 0, 0, 0, 0, 0, -43,
0, 0, 77, 80, -182, -64, -192, 0, -68, -90, -69, -92, 34, 35, 36, 0, 0, 0, 37, 0,
0, -54, -112, -113, -114, -115, -116, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 111, -149, 0, -148, -152, -153, -154, 41, 0, 0, 0, 0, 0, -44, -186, 0, 77,
-68, -90, -69, -92, 34, 35, 36, 63, 61, 0, 37, 0, 0, -49, -112, -113, -114, -115, -116, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 106, 107, 20, -148, -152,
-153, -154, 41, 0, 0, 0, 0, 0, -35, 0, 0, -169, 0, 62, 0, 6, -179, 69, 75, -180,
73, 0, 0, -186, -70, -71, -68, -90, -69, -92, 34, 35, 36, 60, 61, 0, 37, -167, 0, -48,
-112, -113, -114, -115, -116, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 105, 5, -189, -152, -153, -154, 41, 0, 19, -173, 0, 0, -45, 40, 74, -168, 0, 62,
0, 6, 0, 71, -178, 69, 72, -180, 73, 0, 33, -64, -85, -86, -68, -90, -69, -92, 34, 35,
36, 14, 0, 0, 37, 0, 24, 64, -112, -113, -114, -115, -116, 0, 0, 0, 0, 97, 84, 83,
87, 86, -123, 95, -122, 96, -126, -132, -137, 0, 101, 100, 0, 0, -151, 0, -195, 0, 0, 0,
0, 0, -42, 70, 74, 0, 0, -171, 0, 15, 0, 0, -197, -172, 21, 22, -33, 32, -37, -38,
-175, 31, 45, 46, 47, 68, -178, 69, 2, -181, 73, 4, 33, -64, -77, -78, -68, -90, -69, -92,
34, 35, 36, 1, 3, -185, 37, -166, 17, 53, -112, -113, -114, -115, -116, -110, 25, -117, 82, -121,
-118, 83, 85, 86, -120, 95, -119, 96, -124, -129, -135, 11, 101, 5, -188, -152, -153, -154, 41, 7,
8, 12, 23, 26, -40, 70, -1, -168, 91, -170, 42, 6, -194, 104, -196, 65
};
// N_matrix row.
ushort PGParser::Nr [116] =
{
533, 533, 533, 533, 533, 451, 533, 383, 317, 533, 533, 533, 451, 533, 533, 451, 533, 533, 533, 317,
451, 533, 533, 451, 533, 533, 533, 533, 451, 533, 533, 533, 533, 533, 533, 533, 451, 383, 383, 317,
451, 533, 533, 533, 533, 533, 451, 383, 100, 127, 208, 265, 184, 317, 533, 533, 451, 533, 451, 0,
533, 533, 12, 533, 100, 451, 451, 383, 127, 58, 383, 208, 265, 70, 533, 184, 383, 23, 317, 100,
127, 208, 451, 533, 533, 533, 451, 451, 533, 81, 533, 533, 265, 184, 451, 533, 451, 451, 533, 46,
533, 383, 317, 12, 533, 100, 533, 127, 208, 265, 184, 533, 533, 0, 533, 533
};
// N_matrix column.
uchar PGParser::Nc [198] =
{
30, 30, 15, 15, 18, 18, 18, 18, 34, 60, 30, 31, 74, 74, 74, 74, 78, 78, 78, 78,
78, 78, 78, 78, 58, 58, 76, 76, 0, 0, 0, 0, 73, 1, 2, 3, 3, 4, 5, 6,
7, 7, 7, 7, 7, 7, 7, 8, 9, 10, 11, 11, 11, 12, 13, 14, 15, 16, 17, 17,
17, 17, 18, 18, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
20, 20, 20, 20, 20, 20, 20, 21, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32,
33, 33, 33, 33, 33, 33, 34, 34, 34, 34, 35, 36, 36, 36, 36, 36, 36, 37, 38, 39,
39, 40, 41, 41, 42, 43, 44, 45, 46, 47, 48, 48, 49, 50, 50, 51, 52, 53, 54, 55,
55, 55, 56, 56, 56, 57, 57, 57, 58, 58, 59, 60, 61, 61, 61, 62, 62, 62, 62, 62,
62, 62, 63, 64, 65, 65, 66, 66, 67, 67, 68, 68, 69, 69, 70, 70, 71, 71, 72, 72,
73, 73, 74, 74, 75, 75, 76, 76, 77, 77, 78, 78, 79, 80, 80, 81, 82, 82
};
/*--- Reduction Matrix and Access Vectors. ----------------------------------*/
// R_matrix.
uchar PGParser::Rm [49] =
{
0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 9, 0, 0, 16, 0, 0, 0, 0, 165, 0,
0, 155, 155, 0, 0, 0, 0, 164, 0, 0, 162, 162, 0, 94, 0, 94, 94, 94, 95, 94,
0, 0, 0, 0, 0, 0, 0, 150, 149
};
// R_matrix row.
short PGParser::Rr [116] =
{
2, 0, 11, 4, 24, 0, 0, 5, 6, -8, 20, 0, 25, 0, 0, 0, 16, 0, 0, 7,
0, 174, 0, 0, 0, 139, 32, 0, 0, 0, 0, 0, 111, 0, 72, 0, 81, 65, 0, 0,
111, 0, 0, -14, -23, 176, 176, 176, 62, 62, 62, 62, 62, 176, 0, 131, 131, 134, 134, 0,
0, 184, 98, 0, 176, 163, 0, 0, 176, 62, 53, 176, 176, 62, 56, 176, 111, 63, 111, 111,
111, 111, 139, 142, 138, 128, 142, 128, 0, 0, -32, 97, 111, 111, 0, 150, 150, 138, 0, 0,
193, 150, 150, 99, 0, 150, 0, -40, 150, 150, 150, 0, 0, 150, 0, 0
};
// R_matrix column.
uchar PGParser::Rc [42] =
{
0, 1, 1, 1, 1, 0, 2, 3, 3, 1, 1, 0, 3, 0, 3, 3, 3, 3, 4, 5,
5, 3, 3, 3, 3, 0, 0, 0, 0, 0, 3, 3, 3, 3, 6, 6, 3, 3, 7, 3,
3, 8
};
/*--- Token Variables --------------------------------------------------------*/
// Token Action number.
char PGParser::tact_numb[42] =
{
0, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 2, 2, 2, 2, 2, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1
};
// Token Action Function Pointers.
int (*PGParser::tact_func[3]) (int) =
{
PGTokenAction::error,
PGTokenAction::firstsym,
PGTokenAction::arrow
};
// First argument index for token actions.
char PGParser::tact_arg[42] =
{
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1
};
/*--- Production Information. -----------------------------------------------*/
// Production length - 1
char PGParser::PL[198] =
{
1, 4, -1, 0, -1, 0, 0, 1, 2, 0, 0, -1, 2, 3, 1, 2, 0, 1, 0, 0,
0, 1, 0, 0, -1, 0, 3, 3, 0, 0, 0, 0, 1, 1, 0, 3, 3, 1, 0, 0,
2, 3, 2, 3, 3, 2, 3, 0, 2, 2, 2, 2, 2, 0, 2, 0, 0, 2, 0, 0,
0, 0, -1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1,
1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 0, 1, 0, 1, 2, 2, 2, 1, 0, 1,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 1, 1, 2,
2, 2, 3, 3, 1, 0, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, 1, -1, -1,
1, 2, -1, 1, 3, 2, 4, 6, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, -1, 1, -1, 0, 0, 1,
0, 1, 0, 1, -1, 1, 0, 1, 0, 2, 0, 0, 1, -1, 1, 1, 0, 1
};
// Reverse the order of nodes (for a production/rule).
uchar PGParser::reverse[198] =
{
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, 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, 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, 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,
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, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
// First argument index for parse actions and make node.
short PGParser::pact_arg[198] =
{
-1, -1, 6, 10, -1, -1, -1, -1, -1, 29, 33, 37, -1, -1, -1, -1, 50, 54, 58, 62,
66, 70, 74, 78, -1, -1, 88, 92, 96, 100, 104, 108, -1, 115, 119, 120, 124, -1, -1, 131,
135, 139, 143, 147, 151, 155, 159, 163, 164, 168, 172, 176, 180, -1, 184, 188, -1, 189, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
289, 293, 297, 301, 305, 309, 313, 317, 321, -1, 325, -1, -1, -1, -1, -1, -1, 344, 348, 352,
356, 360, 364, 368, 372, 376, 377, 381, 382, 386, 390, 391, 392, 396, 397, 398, 402, 403, 407, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 438, 442, 446, 450, 454,
458, 462, 466, -1, 473, 477, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
};
// Action for a production
char PGParser::pact_numb[198] =
{
-1, -1, 0, 0, -1, -1, -1, -1, -1, 1, 2, 3, -1, -1, -1, -1, 4, 5, 4, 4,
4, 5, 4, 4, -1, -1, -1, -1, 6, 6, 6, 6, -1, -1, 7, 8, 8, -1, 9, 10,
-1, -1, -1, -1, -1, -1, -1, 11, 8, 8, 8, 8, 8, -1, 8, 12, -1, 8, -1, -1,
-1, -1, -1, -1, 9, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
10, 10, 10, 10, 10, 13, 14, 14, 14, -1, -1, -1, -1, -1, -1, -1, -1, -1, 15, 16,
16, 17, 18, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 30, 32, 33,
33, 33, 33, 33, 33, 33, 33, 33, -1, -1, 34, 35, -1, -1, -1, 36, 37, 37, 37, 38,
37, 37, 39, 40, 41, 42, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
};
// Parsing Action Function Pointers.
int (*PGParser::pact_func[43]) (int) =
{
PGParseAction::options_,
PGParseAction::constant_,
PGParseAction::value_,
PGParseAction::errordecl_,
PGParseAction::terminal_,
PGParseAction::terminalres_,
PGParseAction::oper_,
PGParseAction::goalsymbol_,
PGParseAction::prod_,
PGParseAction::tailposition_,
PGParseAction::tail_,
PGParseAction::headsymbol_,
PGParseAction::arrow_,
PGParseAction::tailkw_,
PGParseAction::sep_,
PGParseAction::make_node_,
PGParseAction::make_node_wa_,
PGParseAction::parse_action_make_node_,
PGParseAction::parse_action_make_node_wa_,
PGParseAction::token_action_spec_,
PGParseAction::token_action_name_,
PGParseAction::parse_action_spec_,
PGParseAction::parse_action_name_,
PGParseAction::blank_parse_action_,
PGParseAction::node_spec_,
PGParseAction::node_name_,
PGParseAction::blank_node_name_,
PGParseAction::pa_node_spec_,
PGParseAction::pa_node_name_,
PGParseAction::pa_blank_node_name_,
PGParseAction::node_action_,
PGParseAction::node_action_name_,
PGParseAction::blank_node_action_name_,
PGParseAction::args_,
PGParseAction::arg_null_,
PGParseAction::arg_first_,
PGParseAction::arg_alpha_,
PGParseAction::arg_terminal_,
PGParseAction::arg_string_,
PGParseAction::arg_integer_,
PGParseAction::arg_expr_,
PGParseAction::arg_expr_integer_,
PGParseAction::arg_expr_alpha_
};
/*--- PGParser Argument Variables. --------------------------------------------*/
// Parse action argument numbers
char PGParser::arg_numb[481] =
{
-1, -1, -1, -1, -1, -1, 0, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 0, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1,
-1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, 4, -1, -1, -1, 4, -1, -1, -1, 1, -1, -1, -1,
1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, 1,
1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1,
-1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1,
-1, -1, -1, 1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1,
1, -1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1,
-1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1,
-1, 1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1,
1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1,
-1, 1, 1, -1, -1, -1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1,
-1, -1, 1, 1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1,
-1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1,
-1, -1, 1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1,
-1
};
// Text for string arguments (including node arguments).
char* PGParser::arg_text[1] =
{
""
};
/*--- Node Variables --------------------------------------------------------*/
// Node numbers (for a production).
char PGParser::node_numb[198] =
{
0, 1, 2, 2, 3, 3, 3, 3, 4, 5, 6, -1, 7, 7, 7, 7, 8, 9, 8, 8,
8, 9, 8, 8, 10, 10, 11, 12, 13, 13, 13, 13, 14, 15, -1, 16, 16, 17, -1, 18,
19, 19, 19, 19, 19, 19, 19, -1, 16, 16, 16, 16, 16, -1, 16, -1, -1, 16, -1, -1,
-1, -1, 17, 17, -1, -1, 20, 20, 20, -1, 21, 22, -1, 20, 20, 23, 24, 21, 22, 20,
20, -1, 23, 20, 24, 21, 22, 25, 25, 26, 27, 17, 27, 17, 28, 27, 27, -1, 17, 17,
18, 18, 18, 18, 18, 29, 30, 30, 30, -1, 31, -1, 32, 32, 32, 32, 32, 33, 34, 35,
35, 36, 37, 37, 38, -1, 39, -1, 40, 41, -1, -1, 42, -1, -1, 43, -1, 43, -1, 44,
44, 44, 44, 44, 44, 44, 44, 44, -1, -1, 45, -1, -1, -1, -1, 46, 47, 47, 47, 48,
47, 47, 49, 50, 51, 52, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
};
// Node action numbers.
int AST::nact_numb[198] =
{
0, 1, 2, 2, 3, 3, 3, 3, 4, 5, 6, -1, 7, 7, 7, 7, 8, 9, 8, 8,
8, 9, 8, 8, 10, 10, 11, 12, 13, 13, 13, 13, 14, 15, -1, 16, 16, 17, -1, 18,
19, 19, 19, 19, 19, 19, 19, -1, 16, 16, 16, 16, 16, -1, 16, -1, -1, 16, -1, -1,
-1, -1, 17, 17, -1, -1, 20, 20, 20, -1, 21, 22, -1, 20, 20, 23, 24, 21, 22, 20,
20, -1, 23, 20, 24, 21, 22, 25, 25, 26, 27, 17, 27, 17, 28, 27, 27, -1, 17, 17,
18, 18, 18, 18, 18, 29, 30, 30, 30, -1, 31, -1, 32, 32, 32, 32, 32, 33, 34, 35,
35, 36, 37, 37, 38, -1, 39, -1, 40, 41, -1, -1, 42, -1, -1, 43, -1, 43, -1, 44,
44, 44, 44, 44, 44, 44, 44, 44, -1, -1, 45, -1, -1, -1, -1, 46, 47, 47, 47, 48,
47, 47, 49, 50, 51, 52, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
};
// Node processor function pointers.
int (*AST::nact_func[53]) (Node* np) =
{
PGNodeAction::start_,
PGNodeAction::grammar_,
PGNodeAction::options_,
PGNodeAction::declarations_,
PGNodeAction::constdecl_,
PGNodeAction::constant_,
PGNodeAction::value_,
PGNodeAction::token_decl_,
PGNodeAction::terminal_,
PGNodeAction::terminalres_,
PGNodeAction::operprec_,
PGNodeAction::leftassoc_,
PGNodeAction::rightassoc_,
PGNodeAction::oper_,
PGNodeAction::rules_,
PGNodeAction::goaldef_,
PGNodeAction::prod_,
PGNodeAction::tails_,
PGNodeAction::tail_,
PGNodeAction::headdef_,
PGNodeAction::repeat_,
PGNodeAction::repeatsep_,
PGNodeAction::repeatseprev_,
PGNodeAction::reverse_,
PGNodeAction::repeatrev_,
PGNodeAction::sepexpr_,
PGNodeAction::sepexprrev_,
PGNodeAction::optgroup_,
PGNodeAction::group_,
PGNodeAction::tailkw_,
PGNodeAction::sep_,
PGNodeAction::token_action_,
PGNodeAction::rule_actions_,
PGNodeAction::parse_action_,
PGNodeAction::make_node_,
PGNodeAction::make_node_wa_,
PGNodeAction::parse_action_make_node_,
PGNodeAction::parse_action_make_node_wa_,
PGNodeAction::token_action_spec_,
PGNodeAction::parse_action_spec_,
PGNodeAction::blank_parse_action_,
PGNodeAction::node_spec_,
PGNodeAction::pa_node_spec_,
PGNodeAction::node_action_,
PGNodeAction::args_,
PGNodeAction::arg_null_,
PGNodeAction::arg_alpha_,
PGNodeAction::arg_terminal_,
PGNodeAction::arg_string_,
PGNodeAction::arg_integer_,
PGNodeAction::arg_expr_,
PGNodeAction::arg_expr_integer_,
PGNodeAction::arg_expr_alpha_
};
// First argument index for node actions.
short PGParser::nact_arg[198] =
{
0, 3, 7, 11, 14, 17, 20, 23, 26, 30, 34, -1, 38, 41, 44, 47, 51, 55, 59, 63,
67, 71, 75, 79, 82, 85, 89, 93, 97, 101, 105, 109, 112, 116, -1, 121, 125, 128, -1, 132,
136, 140, 144, 148, 152, 156, 160, -1, 165, 169, 173, 177, 181, -1, 185, -1, -1, 190, -1, -1,
-1, -1, 193, 196, -1, -1, 199, 202, 205, -1, 208, 211, -1, 214, 217, 220, 223, 226, 229, 232,
235, -1, 238, 241, 244, 247, 250, 253, 256, 259, 262, 265, 268, 271, 274, 277, 280, -1, 283, 286,
290, 294, 298, 302, 306, 310, 314, 318, 322, -1, 326, -1, 329, 332, 335, 338, 341, 345, 349, 353,
357, 361, 365, 369, 373, -1, 378, -1, 383, 387, -1, -1, 393, -1, -1, 399, -1, 404, -1, 408,
411, 414, 417, 420, 423, 426, 429, 432, -1, -1, 435, -1, -1, -1, -1, 439, 443, 447, 451, 455,
459, 463, 467, 470, 474, 478, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
};
/////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// LRSTAR Parser.
// Parser stuff ...
PStack* PGParser::PS;
PStack* PGParser::PS_end;
PStack PGParser::P_stack[STKSIZE];
int PGParser::max_errs;
int PGParser::prev_token;
int PGParser::goal_symbol;
int PGParser::start_symbol;
int PGParser::codeblock = 0;
// Restore stack stuff ...
RStack* PGParser::RS;
RStack PGParser::R_stack[STKSIZE];
PStack* PGParser::PStop;
int PGParser::topstate;
// Syntax analysis stuff ...
char* PGParser::T_list;
int* PGParser::P_list;
// Symbol table stuff ...
Symbol* Symtab::symbol;
int Symtab::sti;
short Symtab::length;
int Symtab::n_symbols;
uint Symtab::hashdiv;
int* Symtab::hashvec;
int Symtab::cell;
int Symtab::max_cells;
int Symtab::max_symbols;
// AST stuff ...
Node* AST::node;
Node* AST::root;
Node* AST::currnode;
int* AST::counter;
char AST::indent[256];
Stack* AST::stack;
short AST::stacki;
char** AST::term_symb;
int AST::n_nodenames = 53; // Number of node names.
int AST::n_nodeactions = 53; // Number of node actions.
int AST::n_nodes;
short AST::status;
short AST::pass;
/////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// initialize - initialize
void PGParser::initialize (int max_symb)
{
int sti;
char *p, sym[256];
int t, len, terminal;
init_symtab (max_symb); // Initialize the symbol table.
init_ast (); // Initialize the AST.
p = "";
sti = add_symbol (0, p, p+1, 0, 0); // Add blank symbol as number 0.
symbol[sti].value = -1;
// See if lexer can read the 'literal' terminal symbols.
n_errors = 0;
for (t = 1; t < n_terms; t++) // For all terminals except <error> (0).
{
if (*term_symb[t] == '\'') // Literal symbol?
{
len = -1;
for (p = term_symb[t]+1; *p != 0; p++) // For all characters in terminal symbol.
{
if (++len > 255) // If length greater than 255 ...
{
n_errors++;
printf ("Terminal symbol is longer than 255 characters:\n%s\n\n", term_symb[t]);
PG::Terminate(0);
}
sym[len] = *p; // Move character to sym.
}
sym[len] = 26; // Replace last ' with end-of-file character.
token.end = sym; // Starting point for next PGLexer read.
terminal = get_token(); // Try to read symbol, get it's terminal number.
sym[len] = '\''; // Replace end-of-file with '.
if ((token.end-token.start) != len) // Did not read the whole symbol?
{
n_errors++;
printf ("Lexer was not able to recognized %s\n", term_symb[t]);
}
else if (terminal != t) // Terminal number not t?, must be a keyword!
{
if (terminal == 0) // Got an error on this symbol?
{
n_errors++;
printf ("Lexer returns zero for %s (check reduce-reduce conflicts).\n", term_symb[t]);
}
add_symbol (t, term_symb[t]+1, term_symb[t]+1+len, 0, 0); // Put terminal into symbol table.
}
}
}
if (n_errors) PG::Terminate(0);
// Initialize some stuff.
n_errors = 0;
n_warnings = 0;
max_errs = 10;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// terminate
void PGParser::terminate ()
{
term_ast ();
term_symtab ();
}
/////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// parse
int PGParser::parse (char* input_start)
{
int p; // Production (rule) number.
int t = 0; // Terminal symbol number.
int x = 0; // State number.
PS = P_stack; // Set parse-stack pointer.
PS_end = P_stack + STKSIZE; // Set parse-stack end pointer.
init_lexer (input_start); // Initialize PGLexer.
goal_symbol = 0; // Not seen yet.
/* prev_token = t; // Define previous token.
t = get_token (); // Get first token.
RS = R_stack; // Set restore-stack pointer.
PStop = PS; // Save parse-stack pointer.
topstate = x; // Save current state.
if (t == 0) goto Err; // Bad token!
goto Cont;
*/
Read: prev_token = t; // Define previous token.
t = get_token (); // Get incoming token.
RS = R_stack; // Set restore-stack pointer.
PStop = PS; // Save parse-stack pointer.
topstate = x; // Save current state.
Cont:
token.sti = -t; // Point at terminal symbol.
if (tact_numb[t] >= 0) // If token action ...
{
t = (*tact_func [tact_numb[t]])(t); // Call token-action function.
}
Shft: if (Bm [Br[x] + Bc[t]] & Bmask[t]) // Check B-matrix for shift action.
{
if (++PS >= PS_end) goto Overflow;
PS->state = x; // Put current state on stack.
PS->sti = token.sti; // Put token symbol table index on stack.
PS->start = token.start; // Put token.start into parse stack.
PS->end = token.end; // Put token.end into parse stack.
PS->line = token.line; // Put its line number on stack.
PS->node = NULL; // Set node on stack to null.
x = Tm [Tr[x] + Tc[t]]; // Get next state from terminal transition matrix.
while (x <= 0) // While shift-reduce actions.
{
PS -= PL[-x]; // Reduce stack ptr by production length.
if (reduce_action(-x) != 0) return -line_numb; // Call reduce action with rule number.
x = Nm [Nr[PS->state] + Nc[-x]]; // Get next state from nonterminal transition.
}
goto Read; // Go to read next token.
}
if ((p = Rr[x]) > 0 || (p = Rm [Rc[t] - p]) > 0) // Get reduction?
{
if (PL[p] < 0) // Null production?
{
if (++PS >= PS_end) goto Overflow;
RS++; // Increment the restore stack pointer.
RS->ptr = PS; // Save parse-stack pointer.
RS->state = PS->state; // Save old state before replacing it.
PS->state = x; // Stack current state, replacing old state.
PS->node = NULL; // Clear node pointer.
PS->sti = 0; // Clear sti.
goto Red2;
}
while (1)
{
PS -= PL[p]; // Reduce parse stack ptr by rule length - 1.
Red2: // Reduce action ...
if (reduce_action(p) != 0) return -line_numb; // Call reduce action with rule number.
x = Nm [Nr[PS->state] + Nc[p]]; // Get next state from nonterminal transition.
if (x > 0) goto Shft; // Continue parsing.
p = -x; // Set production number.
}
}
if (codeblock)
{
t = 0;
goto Shft;
}
if (x == ACCEPT_STATE) // If Goal production.
{
PS -= PL[p]; // Reduce parse stack ptr by rule length - 1.
if (reduce_action(p) != 0) return -line_numb; // Call reduce action with rule number.
line_numb--; // Reduce line number by one.
if (n_errors) return -line_numb;
root = PS[0].node; // Define root node.
pass = FIRST_PASS;
traverse ();
if (n_errors) return -line_numb;
pass = SECOND_PASS;
traverse ();
if (n_errors) return -line_numb;
pass = THIRD_PASS;
traverse ();
if (n_errors) return -line_numb;
return line_numb;
}
Err: syntax_error (term_symb[t]); // Print syntax error message.
expecting (); // Print syntax help (list of tokens expected).
return -line_numb; // Return negative number of lines for failure.
Overflow: // Parser stack overflow.
prt_log ("\nInternal error, Parser stack overflow.\n\n");
return -line_numb;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// reduce_action
int PGParser::reduce_action (int p)
{
if (pact_numb[p] >= 0) // PARSE ACTION ?
{
int rc; // Return code.
rc = (*pact_func [pact_numb[p]])(p); // Call parse action with production number.
if (rc < 0) // Bypass make node operation?
{
goto Linkup;
}
}
int psi; // Parse Stack Index.
currnode = NULL;
if (node_numb[p] >= 0) // MAKE NODE ?
{
currnode = (Node*)ALLOC(node, 1);
currnode->id = node_numb[p]; // Set node id.
currnode->numb = n_nodes++; // Set node number.
currnode->prod = p; // Put production (rule) number in node.
currnode->next = NULL; // Set next to nonexistent.
currnode->prev = NULL; // Set prev to nonexistent.
currnode->child = NULL; // Define no child.
currnode->parent = NULL; // Define no parent.
if (pact_arg[p] >= 0) // If node argument defined,...
{
psi = arg_numb[pact_arg[p]]-1; // Get parse-stack index.
currnode->sti = PS[psi].sti; // Move sti from parse stack to node.
currnode->start = PS[psi].start; // Move start from parse stack to node.
currnode->end = PS[psi].end; // Move end from parse stack to node.
currnode->line = PS[psi].line; // Move line from parse stack to node.
}
else
{
currnode->sti = 0; // Set symbol-table index to zero.
currnode->start = NULL; // Set start to null.
currnode->end = NULL; // Set end to null.
currnode->line = 0; // Set line number to 0.
}
psi = linkup(p); // Linkup the nodes in this rule.
if (psi >= 0) // Any nodes found in this rule?
{
currnode->child = PS[psi].node; // Define child.
PS[psi].node->parent = currnode; // Define parent.
}
PS[0].node = PS[0].last = currnode; // Define node in the parse stack.
n_nodes++;
}
else // Check for nodes not linked?
{
Linkup: psi = linkup (p); // Get parse-stack index.
if (psi > 0) // If we have a node here ...
{
PS[0].node = PS[psi].node; // Move node value to 1st position.
PS[0].last = PS[psi].last; // Move last value also.
}
}
return 0;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// linkup
int PGParser::linkup (int p)
{
int i;
int next = -1;
for (i = PL[p]; i >= 0; i--) // For each tail pointer.
{
if (PS[i].node != NULL) // If tail points to node.
{
if (next >= 0) // If one waiting.
{
PS[i].last->next = PS[next].node; // Attach node to end of list.
PS[next].node->prev = PS[i].last; // Define previous node.
PS[i].last = PS[next].last; // Change last to next last.
}
next = i; // Next = Curr.
}
}
return (next);
}
/////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// syntax_error
void PGParser::syntax_error (char *symb)
{
int col, ln1, ln2;
char string[10000], *ls1, *ls2, *le1, *le2, *p, c;
n_errors++;
// Get first line number ...
ln1 = line_numb;
for (p = token.end-1; p > token.start; p--)
{
if (*p == '\n') ln1--;
}
// Get first line start ...
for (ls1 = token.start; *ls1 != '\n'; ls1--);
ls1++;
// Get first line end ...
for (le1 = token.start; *le1 != '\n'; le1++);
// Get last line number ...
ln2 = line_numb;
// Get last line start ...
for (ls2 = token.end-1; *ls2 != '\n'; ls2--);
ls2++;
// Get last line end ...
for (le2 = token.end; *le2 != '\n'; le2++);
*le1 = 0;
*le2 = 0;
if (*token.start == '\n') ln1--;
col = 1;
for (p = ls1; p < token.start; p++)
{
if (*p == '\t') *p = ' ';
col++;
}
prt_log ("%s(%04d) : Error %s\n", grmfid, ln1, ls1);
*le1 = '\n'; // In case token is this <eol>
memset (string, '-', col);
string [col] = 0;
prt_log ("%s(%04d) : Error %s^ ", grmfid, ln1, string);
if (*token.start <= 32)
{
short x = *token.start;
if (x < 0) x += 256;
prt_log ("at character code %d %s\n\n", x, symb);
}
else
{
if (token.end == token.start) token.end++;
if (token.end > le1)
{
if (*token.start == '\n') *token.start = 0;
if (*token.end == EOF_CHAR) line_numb--;
c = *le1;
*le1 = 0;
prt_log ("starts at %s\n", token.start, ln1);
prt_log ("%s(%04d) : Error ends here.\n\n", grmfid, ln2);
*le1 = c;
}
else
{
c = *token.end;
*token.end = 0;
if (*token.start == '\n') *token.start = 0;
prt_log ("at %s %s\n\n", token.start, symb);
*token.end = c;
}
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////////
// //
// expecting // Print expecting list.
void PGParser::expecting ()
{
int t;
T_list = (char*)malloc (sizeof(*T_list)*n_terms);
P_list = (int* )malloc (sizeof(*P_list)*n_prods);
for (t = 0; t < n_terms; t++) T_list[t] = 0;
prt_log ("Expecting one of the following:\n\n");
for (PS = PStop; RS > R_stack; RS--) // Restore PS, RS and states.
{
RS->ptr->state = RS->state; // Reset state to saved state.
}
collect (topstate); // Collect all terminal symbols expected.
for (t = 0; t < n_terms; t++)
{
if (T_list[t])
{