-
Notifications
You must be signed in to change notification settings - Fork 0
/
parser.out
1683 lines (1176 loc) · 53.2 KB
/
parser.out
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
Created by PLY version 3.11 (http://www.dabeaz.com/ply)
Grammar
Rule 0 S' -> program
Rule 1 program -> PROGRAM ID SEMICOLON r body END
Rule 2 r -> vars
Rule 3 r -> empty
Rule 4 vars -> VAR o
Rule 5 o -> s p
Rule 6 s -> ID
Rule 7 p -> COMA o
Rule 8 p -> COLON type SEMICOLON q
Rule 9 q -> empty
Rule 10 q -> o
Rule 11 body -> LEFTBRACE m RIGHTBRACE
Rule 12 m -> statement m
Rule 13 m -> empty
Rule 14 statement -> assign
Rule 15 statement -> condition
Rule 16 statement -> cycle
Rule 17 statement -> print
Rule 18 assign -> id_assign equal_assign expression SEMICOLON
Rule 19 id_assign -> ID
Rule 20 equal_assign -> EQUAL
Rule 21 cycle -> do_cycle body WHILE l_par_cycle expression r_par_cycle SEMICOLON
Rule 22 do_cycle -> DO
Rule 23 l_par_cycle -> LEFTPARENTHESIS
Rule 24 r_par_cycle -> RIGHTPARENTHESIS
Rule 25 condition -> IF left_par_condition expression right_par_condition body ef SEMICOLON
Rule 26 left_par_condition -> LEFTPARENTHESIS
Rule 27 right_par_condition -> RIGHTPARENTHESIS
Rule 28 ef -> empty
Rule 29 ef -> l
Rule 30 ef -> elif_ef left_par_ef expression right_par_ef body l
Rule 31 elif_ef -> ELSEIF
Rule 32 left_par_ef -> LEFTPARENTHESIS
Rule 33 right_par_ef -> RIGHTPARENTHESIS
Rule 34 l -> else_condition body
Rule 35 else_condition -> ELSE
Rule 36 expression -> exp j
Rule 37 j -> empty
Rule 38 j -> k exp
Rule 39 k -> GREATERTHAN
Rule 40 k -> LESSTHAN
Rule 41 k -> NOT
Rule 42 print -> cout_print LEFTPARENTHESIS g RIGHTPARENTHESIS semicolon_print
Rule 43 cout_print -> COUT
Rule 44 g -> h i
Rule 45 h -> expression_print
Rule 46 h -> CTE_STRING
Rule 47 expression_print -> expression
Rule 48 i -> empty
Rule 49 i -> COMA g
Rule 50 semicolon_print -> SEMICOLON
Rule 51 exp -> term e
Rule 52 e -> empty
Rule 53 e -> f exp
Rule 54 f -> ADD
Rule 55 f -> MINUS
Rule 56 term -> factor c
Rule 57 c -> empty
Rule 58 c -> d term
Rule 59 d -> MULTIPLY
Rule 60 d -> DIVIDE
Rule 61 factor -> left_par_factor expression right_par_factor
Rule 62 factor -> a b
Rule 63 left_par_factor -> LEFTPARENTHESIS
Rule 64 right_par_factor -> RIGHTPARENTHESIS
Rule 65 a -> empty
Rule 66 a -> ADD
Rule 67 a -> MINUS
Rule 68 b -> ID
Rule 69 b -> cte
Rule 70 type -> INT
Rule 71 type -> FLOAT
Rule 72 cte -> CTE_INT
Rule 73 cte -> CTE_FLOAT
Rule 74 empty -> <empty>
Terminals, with rules where they appear
ADD : 54 66
COLON : 8
COMA : 7 49
COUT : 43
CTE_FLOAT : 73
CTE_INT : 72
CTE_STRING : 46
DIVIDE : 60
DO : 22
ELSE : 35
ELSEIF : 31
END : 1
EQUAL : 20
FLOAT : 71
GREATERTHAN : 39
ID : 1 6 19 68
IF : 25
INT : 70
LEFTBRACE : 11
LEFTPARENTHESIS : 23 26 32 42 63
LESSTHAN : 40
MINUS : 55 67
MULTIPLY : 59
NOT : 41
PROGRAM : 1
RIGHTBRACE : 11
RIGHTPARENTHESIS : 24 27 33 42 64
SEMICOLON : 1 8 18 21 25 50
VAR : 4
WHILE : 21
error :
Nonterminals, with rules where they appear
a : 62
assign : 14
b : 62
body : 1 21 25 30 34
c : 56
condition : 15
cout_print : 42
cte : 69
cycle : 16
d : 58
do_cycle : 21
e : 51
ef : 25
elif_ef : 30
else_condition : 34
empty : 3 9 13 28 37 48 52 57 65
equal_assign : 18
exp : 36 38 53
expression : 18 21 25 30 47 61
expression_print : 45
f : 53
factor : 56
g : 42 49
h : 44
i : 44
id_assign : 18
j : 36
k : 38
l : 29 30
l_par_cycle : 21
left_par_condition : 25
left_par_ef : 30
left_par_factor : 61
m : 11 12
o : 4 7 10
p : 5
print : 17
program : 0
q : 8
r : 1
r_par_cycle : 21
right_par_condition : 25
right_par_ef : 30
right_par_factor : 61
s : 5
semicolon_print : 42
statement : 12
term : 51 58
type : 8
vars : 2
Parsing method: LALR
state 0
(0) S' -> . program
(1) program -> . PROGRAM ID SEMICOLON r body END
PROGRAM shift and go to state 2
program shift and go to state 1
state 1
(0) S' -> program .
state 2
(1) program -> PROGRAM . ID SEMICOLON r body END
ID shift and go to state 3
state 3
(1) program -> PROGRAM ID . SEMICOLON r body END
SEMICOLON shift and go to state 4
state 4
(1) program -> PROGRAM ID SEMICOLON . r body END
(2) r -> . vars
(3) r -> . empty
(4) vars -> . VAR o
(74) empty -> .
VAR shift and go to state 8
LEFTBRACE reduce using rule 74 (empty -> .)
r shift and go to state 5
vars shift and go to state 6
empty shift and go to state 7
state 5
(1) program -> PROGRAM ID SEMICOLON r . body END
(11) body -> . LEFTBRACE m RIGHTBRACE
LEFTBRACE shift and go to state 10
body shift and go to state 9
state 6
(2) r -> vars .
LEFTBRACE reduce using rule 2 (r -> vars .)
state 7
(3) r -> empty .
LEFTBRACE reduce using rule 3 (r -> empty .)
state 8
(4) vars -> VAR . o
(5) o -> . s p
(6) s -> . ID
ID shift and go to state 13
o shift and go to state 11
s shift and go to state 12
state 9
(1) program -> PROGRAM ID SEMICOLON r body . END
END shift and go to state 14
state 10
(11) body -> LEFTBRACE . m RIGHTBRACE
(12) m -> . statement m
(13) m -> . empty
(14) statement -> . assign
(15) statement -> . condition
(16) statement -> . cycle
(17) statement -> . print
(74) empty -> .
(18) assign -> . id_assign equal_assign expression SEMICOLON
(25) condition -> . IF left_par_condition expression right_par_condition body ef SEMICOLON
(21) cycle -> . do_cycle body WHILE l_par_cycle expression r_par_cycle SEMICOLON
(42) print -> . cout_print LEFTPARENTHESIS g RIGHTPARENTHESIS semicolon_print
(19) id_assign -> . ID
(22) do_cycle -> . DO
(43) cout_print -> . COUT
RIGHTBRACE reduce using rule 74 (empty -> .)
IF shift and go to state 23
ID shift and go to state 26
DO shift and go to state 27
COUT shift and go to state 28
m shift and go to state 15
statement shift and go to state 16
empty shift and go to state 17
assign shift and go to state 18
condition shift and go to state 19
cycle shift and go to state 20
print shift and go to state 21
id_assign shift and go to state 22
do_cycle shift and go to state 24
cout_print shift and go to state 25
state 11
(4) vars -> VAR o .
LEFTBRACE reduce using rule 4 (vars -> VAR o .)
state 12
(5) o -> s . p
(7) p -> . COMA o
(8) p -> . COLON type SEMICOLON q
COMA shift and go to state 30
COLON shift and go to state 31
p shift and go to state 29
state 13
(6) s -> ID .
COMA reduce using rule 6 (s -> ID .)
COLON reduce using rule 6 (s -> ID .)
state 14
(1) program -> PROGRAM ID SEMICOLON r body END .
$end reduce using rule 1 (program -> PROGRAM ID SEMICOLON r body END .)
state 15
(11) body -> LEFTBRACE m . RIGHTBRACE
RIGHTBRACE shift and go to state 32
state 16
(12) m -> statement . m
(12) m -> . statement m
(13) m -> . empty
(14) statement -> . assign
(15) statement -> . condition
(16) statement -> . cycle
(17) statement -> . print
(74) empty -> .
(18) assign -> . id_assign equal_assign expression SEMICOLON
(25) condition -> . IF left_par_condition expression right_par_condition body ef SEMICOLON
(21) cycle -> . do_cycle body WHILE l_par_cycle expression r_par_cycle SEMICOLON
(42) print -> . cout_print LEFTPARENTHESIS g RIGHTPARENTHESIS semicolon_print
(19) id_assign -> . ID
(22) do_cycle -> . DO
(43) cout_print -> . COUT
RIGHTBRACE reduce using rule 74 (empty -> .)
IF shift and go to state 23
ID shift and go to state 26
DO shift and go to state 27
COUT shift and go to state 28
statement shift and go to state 16
m shift and go to state 33
empty shift and go to state 17
assign shift and go to state 18
condition shift and go to state 19
cycle shift and go to state 20
print shift and go to state 21
id_assign shift and go to state 22
do_cycle shift and go to state 24
cout_print shift and go to state 25
state 17
(13) m -> empty .
RIGHTBRACE reduce using rule 13 (m -> empty .)
state 18
(14) statement -> assign .
IF reduce using rule 14 (statement -> assign .)
ID reduce using rule 14 (statement -> assign .)
DO reduce using rule 14 (statement -> assign .)
COUT reduce using rule 14 (statement -> assign .)
RIGHTBRACE reduce using rule 14 (statement -> assign .)
state 19
(15) statement -> condition .
IF reduce using rule 15 (statement -> condition .)
ID reduce using rule 15 (statement -> condition .)
DO reduce using rule 15 (statement -> condition .)
COUT reduce using rule 15 (statement -> condition .)
RIGHTBRACE reduce using rule 15 (statement -> condition .)
state 20
(16) statement -> cycle .
IF reduce using rule 16 (statement -> cycle .)
ID reduce using rule 16 (statement -> cycle .)
DO reduce using rule 16 (statement -> cycle .)
COUT reduce using rule 16 (statement -> cycle .)
RIGHTBRACE reduce using rule 16 (statement -> cycle .)
state 21
(17) statement -> print .
IF reduce using rule 17 (statement -> print .)
ID reduce using rule 17 (statement -> print .)
DO reduce using rule 17 (statement -> print .)
COUT reduce using rule 17 (statement -> print .)
RIGHTBRACE reduce using rule 17 (statement -> print .)
state 22
(18) assign -> id_assign . equal_assign expression SEMICOLON
(20) equal_assign -> . EQUAL
EQUAL shift and go to state 35
equal_assign shift and go to state 34
state 23
(25) condition -> IF . left_par_condition expression right_par_condition body ef SEMICOLON
(26) left_par_condition -> . LEFTPARENTHESIS
LEFTPARENTHESIS shift and go to state 37
left_par_condition shift and go to state 36
state 24
(21) cycle -> do_cycle . body WHILE l_par_cycle expression r_par_cycle SEMICOLON
(11) body -> . LEFTBRACE m RIGHTBRACE
LEFTBRACE shift and go to state 10
body shift and go to state 38
state 25
(42) print -> cout_print . LEFTPARENTHESIS g RIGHTPARENTHESIS semicolon_print
LEFTPARENTHESIS shift and go to state 39
state 26
(19) id_assign -> ID .
EQUAL reduce using rule 19 (id_assign -> ID .)
state 27
(22) do_cycle -> DO .
LEFTBRACE reduce using rule 22 (do_cycle -> DO .)
state 28
(43) cout_print -> COUT .
LEFTPARENTHESIS reduce using rule 43 (cout_print -> COUT .)
state 29
(5) o -> s p .
LEFTBRACE reduce using rule 5 (o -> s p .)
state 30
(7) p -> COMA . o
(5) o -> . s p
(6) s -> . ID
ID shift and go to state 13
o shift and go to state 40
s shift and go to state 12
state 31
(8) p -> COLON . type SEMICOLON q
(70) type -> . INT
(71) type -> . FLOAT
INT shift and go to state 42
FLOAT shift and go to state 43
type shift and go to state 41
state 32
(11) body -> LEFTBRACE m RIGHTBRACE .
END reduce using rule 11 (body -> LEFTBRACE m RIGHTBRACE .)
WHILE reduce using rule 11 (body -> LEFTBRACE m RIGHTBRACE .)
ELSEIF reduce using rule 11 (body -> LEFTBRACE m RIGHTBRACE .)
ELSE reduce using rule 11 (body -> LEFTBRACE m RIGHTBRACE .)
SEMICOLON reduce using rule 11 (body -> LEFTBRACE m RIGHTBRACE .)
state 33
(12) m -> statement m .
RIGHTBRACE reduce using rule 12 (m -> statement m .)
state 34
(18) assign -> id_assign equal_assign . expression SEMICOLON
(36) expression -> . exp j
(51) exp -> . term e
(56) term -> . factor c
(61) factor -> . left_par_factor expression right_par_factor
(62) factor -> . a b
(63) left_par_factor -> . LEFTPARENTHESIS
(65) a -> . empty
(66) a -> . ADD
(67) a -> . MINUS
(74) empty -> .
LEFTPARENTHESIS shift and go to state 50
ADD shift and go to state 52
MINUS shift and go to state 53
ID reduce using rule 74 (empty -> .)
CTE_INT reduce using rule 74 (empty -> .)
CTE_FLOAT reduce using rule 74 (empty -> .)
expression shift and go to state 44
exp shift and go to state 45
term shift and go to state 46
factor shift and go to state 47
left_par_factor shift and go to state 48
a shift and go to state 49
empty shift and go to state 51
state 35
(20) equal_assign -> EQUAL .
LEFTPARENTHESIS reduce using rule 20 (equal_assign -> EQUAL .)
ADD reduce using rule 20 (equal_assign -> EQUAL .)
MINUS reduce using rule 20 (equal_assign -> EQUAL .)
ID reduce using rule 20 (equal_assign -> EQUAL .)
CTE_INT reduce using rule 20 (equal_assign -> EQUAL .)
CTE_FLOAT reduce using rule 20 (equal_assign -> EQUAL .)
state 36
(25) condition -> IF left_par_condition . expression right_par_condition body ef SEMICOLON
(36) expression -> . exp j
(51) exp -> . term e
(56) term -> . factor c
(61) factor -> . left_par_factor expression right_par_factor
(62) factor -> . a b
(63) left_par_factor -> . LEFTPARENTHESIS
(65) a -> . empty
(66) a -> . ADD
(67) a -> . MINUS
(74) empty -> .
LEFTPARENTHESIS shift and go to state 50
ADD shift and go to state 52
MINUS shift and go to state 53
ID reduce using rule 74 (empty -> .)
CTE_INT reduce using rule 74 (empty -> .)
CTE_FLOAT reduce using rule 74 (empty -> .)
expression shift and go to state 54
exp shift and go to state 45
term shift and go to state 46
factor shift and go to state 47
left_par_factor shift and go to state 48
a shift and go to state 49
empty shift and go to state 51
state 37
(26) left_par_condition -> LEFTPARENTHESIS .
LEFTPARENTHESIS reduce using rule 26 (left_par_condition -> LEFTPARENTHESIS .)
ADD reduce using rule 26 (left_par_condition -> LEFTPARENTHESIS .)
MINUS reduce using rule 26 (left_par_condition -> LEFTPARENTHESIS .)
ID reduce using rule 26 (left_par_condition -> LEFTPARENTHESIS .)
CTE_INT reduce using rule 26 (left_par_condition -> LEFTPARENTHESIS .)
CTE_FLOAT reduce using rule 26 (left_par_condition -> LEFTPARENTHESIS .)
state 38
(21) cycle -> do_cycle body . WHILE l_par_cycle expression r_par_cycle SEMICOLON
WHILE shift and go to state 55
state 39
(42) print -> cout_print LEFTPARENTHESIS . g RIGHTPARENTHESIS semicolon_print
(44) g -> . h i
(45) h -> . expression_print
(46) h -> . CTE_STRING
(47) expression_print -> . expression
(36) expression -> . exp j
(51) exp -> . term e
(56) term -> . factor c
(61) factor -> . left_par_factor expression right_par_factor
(62) factor -> . a b
(63) left_par_factor -> . LEFTPARENTHESIS
(65) a -> . empty
(66) a -> . ADD
(67) a -> . MINUS
(74) empty -> .
CTE_STRING shift and go to state 59
LEFTPARENTHESIS shift and go to state 50
ADD shift and go to state 52
MINUS shift and go to state 53
ID reduce using rule 74 (empty -> .)
CTE_INT reduce using rule 74 (empty -> .)
CTE_FLOAT reduce using rule 74 (empty -> .)
g shift and go to state 56
h shift and go to state 57
expression_print shift and go to state 58
expression shift and go to state 60
exp shift and go to state 45
term shift and go to state 46
factor shift and go to state 47
left_par_factor shift and go to state 48
a shift and go to state 49
empty shift and go to state 51
state 40
(7) p -> COMA o .
LEFTBRACE reduce using rule 7 (p -> COMA o .)
state 41
(8) p -> COLON type . SEMICOLON q
SEMICOLON shift and go to state 61
state 42
(70) type -> INT .
SEMICOLON reduce using rule 70 (type -> INT .)
state 43
(71) type -> FLOAT .
SEMICOLON reduce using rule 71 (type -> FLOAT .)
state 44
(18) assign -> id_assign equal_assign expression . SEMICOLON
SEMICOLON shift and go to state 62
state 45
(36) expression -> exp . j
(37) j -> . empty
(38) j -> . k exp
(74) empty -> .
(39) k -> . GREATERTHAN
(40) k -> . LESSTHAN
(41) k -> . NOT
SEMICOLON reduce using rule 74 (empty -> .)
RIGHTPARENTHESIS reduce using rule 74 (empty -> .)
COMA reduce using rule 74 (empty -> .)
GREATERTHAN shift and go to state 66
LESSTHAN shift and go to state 67
NOT shift and go to state 68
j shift and go to state 63
empty shift and go to state 64
k shift and go to state 65
state 46
(51) exp -> term . e
(52) e -> . empty
(53) e -> . f exp
(74) empty -> .
(54) f -> . ADD
(55) f -> . MINUS
GREATERTHAN reduce using rule 74 (empty -> .)
LESSTHAN reduce using rule 74 (empty -> .)
NOT reduce using rule 74 (empty -> .)
SEMICOLON reduce using rule 74 (empty -> .)
RIGHTPARENTHESIS reduce using rule 74 (empty -> .)
COMA reduce using rule 74 (empty -> .)
ADD shift and go to state 72
MINUS shift and go to state 73
e shift and go to state 69
empty shift and go to state 70
f shift and go to state 71
state 47
(56) term -> factor . c
(57) c -> . empty
(58) c -> . d term
(74) empty -> .
(59) d -> . MULTIPLY
(60) d -> . DIVIDE
ADD reduce using rule 74 (empty -> .)
MINUS reduce using rule 74 (empty -> .)
GREATERTHAN reduce using rule 74 (empty -> .)
LESSTHAN reduce using rule 74 (empty -> .)
NOT reduce using rule 74 (empty -> .)
SEMICOLON reduce using rule 74 (empty -> .)
RIGHTPARENTHESIS reduce using rule 74 (empty -> .)
COMA reduce using rule 74 (empty -> .)
MULTIPLY shift and go to state 77
DIVIDE shift and go to state 78
c shift and go to state 74
empty shift and go to state 75
d shift and go to state 76
state 48
(61) factor -> left_par_factor . expression right_par_factor
(36) expression -> . exp j
(51) exp -> . term e
(56) term -> . factor c
(61) factor -> . left_par_factor expression right_par_factor
(62) factor -> . a b
(63) left_par_factor -> . LEFTPARENTHESIS
(65) a -> . empty
(66) a -> . ADD
(67) a -> . MINUS
(74) empty -> .
LEFTPARENTHESIS shift and go to state 50
ADD shift and go to state 52
MINUS shift and go to state 53
ID reduce using rule 74 (empty -> .)
CTE_INT reduce using rule 74 (empty -> .)
CTE_FLOAT reduce using rule 74 (empty -> .)
left_par_factor shift and go to state 48
expression shift and go to state 79
exp shift and go to state 45
term shift and go to state 46
factor shift and go to state 47
a shift and go to state 49
empty shift and go to state 51
state 49
(62) factor -> a . b
(68) b -> . ID
(69) b -> . cte
(72) cte -> . CTE_INT
(73) cte -> . CTE_FLOAT
ID shift and go to state 81
CTE_INT shift and go to state 83
CTE_FLOAT shift and go to state 84
b shift and go to state 80
cte shift and go to state 82
state 50
(63) left_par_factor -> LEFTPARENTHESIS .
LEFTPARENTHESIS reduce using rule 63 (left_par_factor -> LEFTPARENTHESIS .)
ADD reduce using rule 63 (left_par_factor -> LEFTPARENTHESIS .)
MINUS reduce using rule 63 (left_par_factor -> LEFTPARENTHESIS .)
ID reduce using rule 63 (left_par_factor -> LEFTPARENTHESIS .)
CTE_INT reduce using rule 63 (left_par_factor -> LEFTPARENTHESIS .)
CTE_FLOAT reduce using rule 63 (left_par_factor -> LEFTPARENTHESIS .)
state 51
(65) a -> empty .
ID reduce using rule 65 (a -> empty .)
CTE_INT reduce using rule 65 (a -> empty .)
CTE_FLOAT reduce using rule 65 (a -> empty .)
state 52
(66) a -> ADD .
ID reduce using rule 66 (a -> ADD .)
CTE_INT reduce using rule 66 (a -> ADD .)
CTE_FLOAT reduce using rule 66 (a -> ADD .)
state 53
(67) a -> MINUS .
ID reduce using rule 67 (a -> MINUS .)
CTE_INT reduce using rule 67 (a -> MINUS .)
CTE_FLOAT reduce using rule 67 (a -> MINUS .)
state 54
(25) condition -> IF left_par_condition expression . right_par_condition body ef SEMICOLON
(27) right_par_condition -> . RIGHTPARENTHESIS
RIGHTPARENTHESIS shift and go to state 86
right_par_condition shift and go to state 85
state 55
(21) cycle -> do_cycle body WHILE . l_par_cycle expression r_par_cycle SEMICOLON
(23) l_par_cycle -> . LEFTPARENTHESIS
LEFTPARENTHESIS shift and go to state 88
l_par_cycle shift and go to state 87
state 56
(42) print -> cout_print LEFTPARENTHESIS g . RIGHTPARENTHESIS semicolon_print
RIGHTPARENTHESIS shift and go to state 89
state 57
(44) g -> h . i
(48) i -> . empty
(49) i -> . COMA g
(74) empty -> .
COMA shift and go to state 92
RIGHTPARENTHESIS reduce using rule 74 (empty -> .)
i shift and go to state 90
empty shift and go to state 91
state 58
(45) h -> expression_print .
COMA reduce using rule 45 (h -> expression_print .)
RIGHTPARENTHESIS reduce using rule 45 (h -> expression_print .)
state 59
(46) h -> CTE_STRING .
COMA reduce using rule 46 (h -> CTE_STRING .)
RIGHTPARENTHESIS reduce using rule 46 (h -> CTE_STRING .)
state 60
(47) expression_print -> expression .
COMA reduce using rule 47 (expression_print -> expression .)
RIGHTPARENTHESIS reduce using rule 47 (expression_print -> expression .)
state 61
(8) p -> COLON type SEMICOLON . q
(9) q -> . empty
(10) q -> . o
(74) empty -> .
(5) o -> . s p
(6) s -> . ID
LEFTBRACE reduce using rule 74 (empty -> .)
ID shift and go to state 13
q shift and go to state 93
empty shift and go to state 94
o shift and go to state 95
s shift and go to state 12
state 62
(18) assign -> id_assign equal_assign expression SEMICOLON .
IF reduce using rule 18 (assign -> id_assign equal_assign expression SEMICOLON .)
ID reduce using rule 18 (assign -> id_assign equal_assign expression SEMICOLON .)
DO reduce using rule 18 (assign -> id_assign equal_assign expression SEMICOLON .)
COUT reduce using rule 18 (assign -> id_assign equal_assign expression SEMICOLON .)
RIGHTBRACE reduce using rule 18 (assign -> id_assign equal_assign expression SEMICOLON .)
state 63
(36) expression -> exp j .
SEMICOLON reduce using rule 36 (expression -> exp j .)
RIGHTPARENTHESIS reduce using rule 36 (expression -> exp j .)
COMA reduce using rule 36 (expression -> exp j .)
state 64
(37) j -> empty .
SEMICOLON reduce using rule 37 (j -> empty .)
RIGHTPARENTHESIS reduce using rule 37 (j -> empty .)
COMA reduce using rule 37 (j -> empty .)
state 65
(38) j -> k . exp
(51) exp -> . term e
(56) term -> . factor c
(61) factor -> . left_par_factor expression right_par_factor
(62) factor -> . a b
(63) left_par_factor -> . LEFTPARENTHESIS
(65) a -> . empty
(66) a -> . ADD
(67) a -> . MINUS
(74) empty -> .
LEFTPARENTHESIS shift and go to state 50
ADD shift and go to state 52
MINUS shift and go to state 53
ID reduce using rule 74 (empty -> .)
CTE_INT reduce using rule 74 (empty -> .)
CTE_FLOAT reduce using rule 74 (empty -> .)
exp shift and go to state 96
term shift and go to state 46
factor shift and go to state 47
left_par_factor shift and go to state 48
a shift and go to state 49
empty shift and go to state 51
state 66
(39) k -> GREATERTHAN .
LEFTPARENTHESIS reduce using rule 39 (k -> GREATERTHAN .)
ADD reduce using rule 39 (k -> GREATERTHAN .)
MINUS reduce using rule 39 (k -> GREATERTHAN .)
ID reduce using rule 39 (k -> GREATERTHAN .)
CTE_INT reduce using rule 39 (k -> GREATERTHAN .)
CTE_FLOAT reduce using rule 39 (k -> GREATERTHAN .)
state 67
(40) k -> LESSTHAN .
LEFTPARENTHESIS reduce using rule 40 (k -> LESSTHAN .)
ADD reduce using rule 40 (k -> LESSTHAN .)
MINUS reduce using rule 40 (k -> LESSTHAN .)
ID reduce using rule 40 (k -> LESSTHAN .)
CTE_INT reduce using rule 40 (k -> LESSTHAN .)
CTE_FLOAT reduce using rule 40 (k -> LESSTHAN .)
state 68
(41) k -> NOT .
LEFTPARENTHESIS reduce using rule 41 (k -> NOT .)
ADD reduce using rule 41 (k -> NOT .)
MINUS reduce using rule 41 (k -> NOT .)
ID reduce using rule 41 (k -> NOT .)
CTE_INT reduce using rule 41 (k -> NOT .)
CTE_FLOAT reduce using rule 41 (k -> NOT .)
state 69