split-public-symbol-with-renaming.exp 693 Bytes
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12
Grammar has 2 nonterminal symbols, among which 1 start symbols.
Grammar has 3 terminal symbols.
Grammar has 3 productions.
nullable(main) = false
nullable(liste(A)) = true
first(main) = B A
first(liste(A)) = A
follow(main) = #
follow(liste(A)) = B
Built an LR(0) automaton with 8 states.
The grammar is SLR(1).
Built an LR(1) automaton with 8 states.
13
3 out of 8 states have a default reduction.
14 15 16 17 18 19
2 out of 8 states are represented.
0 out of 8 symbols keep track of their start position.
0 out of 8 symbols keep track of their end position.
2 out of 4 productions exploit shiftreduce optimization.
0 out of 8 states can peek at an error.
28 functions before inlining, 6 functions after inlining.