- <init>
Constructor for building a state from a set of items.
- add_transition
Add a transition out of this state to another.
- all
Collection of all states.
- build_machine
Build an LALR viable prefix recognition machine given a start production. This
method operates by fi
- build_table_entries
Fill in the parse table entries for this state. There are two parse tables that
encode the viable pr
- equals
Equality comparison.
- find_state
Find and return state with a given a kernel item set (or null if not found). The
kernel item set is
- hashCode
Produce a hash code.
- index
Index of this state in the parse tables
- items
The item set for this state.
- number
Indicate total number of states there are.
- propagate_all_lookaheads
Propagate lookahead sets through the constructed viable prefix recognizer. When
the machine is const