-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathparser.out
130 lines (83 loc) · 3 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
Created by PLY version 3.11 (http://www.dabeaz.com/ply)
Grammar
Rule 0 S' -> tree
Rule 1 tree -> LOG LPAREN tree RPAREN tree
Rule 2 tree -> URI tree
Rule 3 tree -> empty
Rule 4 empty -> <empty>
Terminals, with rules where they appear
LOG : 1
LPAREN : 1
RPAREN : 1
URI : 2
error :
Nonterminals, with rules where they appear
empty : 3
tree : 1 1 2 0
Parsing method: LALR
state 0
(0) S' -> . tree
(1) tree -> . LOG LPAREN tree RPAREN tree
(2) tree -> . URI tree
(3) tree -> . empty
(4) empty -> .
LOG shift and go to state 2
URI shift and go to state 3
$end reduce using rule 4 (empty -> .)
tree shift and go to state 1
empty shift and go to state 4
state 1
(0) S' -> tree .
state 2
(1) tree -> LOG . LPAREN tree RPAREN tree
LPAREN shift and go to state 5
state 3
(2) tree -> URI . tree
(1) tree -> . LOG LPAREN tree RPAREN tree
(2) tree -> . URI tree
(3) tree -> . empty
(4) empty -> .
LOG shift and go to state 2
URI shift and go to state 3
$end reduce using rule 4 (empty -> .)
RPAREN reduce using rule 4 (empty -> .)
tree shift and go to state 6
empty shift and go to state 4
state 4
(3) tree -> empty .
$end reduce using rule 3 (tree -> empty .)
RPAREN reduce using rule 3 (tree -> empty .)
state 5
(1) tree -> LOG LPAREN . tree RPAREN tree
(1) tree -> . LOG LPAREN tree RPAREN tree
(2) tree -> . URI tree
(3) tree -> . empty
(4) empty -> .
LOG shift and go to state 2
URI shift and go to state 3
RPAREN reduce using rule 4 (empty -> .)
tree shift and go to state 7
empty shift and go to state 4
state 6
(2) tree -> URI tree .
$end reduce using rule 2 (tree -> URI tree .)
RPAREN reduce using rule 2 (tree -> URI tree .)
state 7
(1) tree -> LOG LPAREN tree . RPAREN tree
RPAREN shift and go to state 8
state 8
(1) tree -> LOG LPAREN tree RPAREN . tree
(1) tree -> . LOG LPAREN tree RPAREN tree
(2) tree -> . URI tree
(3) tree -> . empty
(4) empty -> .
LOG shift and go to state 2
URI shift and go to state 3
$end reduce using rule 4 (empty -> .)
RPAREN reduce using rule 4 (empty -> .)
tree shift and go to state 9
empty shift and go to state 4
state 9
(1) tree -> LOG LPAREN tree RPAREN tree .
$end reduce using rule 1 (tree -> LOG LPAREN tree RPAREN tree .)
RPAREN reduce using rule 1 (tree -> LOG LPAREN tree RPAREN tree .)