Grammar has 3 nonterminal symbols, among which 1 start symbols.
Grammar has 3 terminal symbols.
Grammar has 4 productions.
nullable(nonempty_list(AB)) = false
nullable(entry) = false
nullable(AB) = false
first(nonempty_list(AB)) = A
first(entry) = A
first(AB) = A
follow(nonempty_list(AB)) = EOF
follow(entry) = #
follow(AB) = EOF A
Built an LR(0) automaton with 8 states.
The grammar is SLR(1).
Built an LR(1) automaton with 8 states.
4 out of 8 states have a default reduction.
2 out of 8 states are represented.
0 out of 9 symbols keep track of their start position.
0 out of 9 symbols keep track of their end position.
3 out of 5 productions exploit shiftreduce optimization.
0 out of 8 states can peek at an error.
30 functions before inlining, 5 functions after inlining.