trace-level set to 5
parsing grammar from examples/retest/re.grammar
PRODUCTION: E --> ID:_item0_ VAL { }, precedence 0
4 rules in grammar
Abstract syntax structures created in re_ast.rs
computing Nullable set
computing First sets
Generating LALR state machine for grammar re...
Transition to state 1 from state 0, symbol ID..
Transition to state 2 from state 0, symbol E..
Transition to state 3 from state 1, symbol VAL..
state 0:
(3) START --> .E { EOF, }
(2) E --> .ID VAL { EOF, }
state 1:
(2) E --> ID .VAL { EOF, }
state 2:
(3) START --> E . { EOF, }
state 3:
(2) E --> ID VAL . { EOF, }
written parser to reparser.rs