A state machine transition label. A label can be either a simple label such as a
token or character.
A generic transition between any two state machine states. It defines some
special labels that indic
A DFA (converted from a grammar's NFA). DFAs are used as prediction machine for
alternative blocks i
Collection of information about what is wrong with a decision as discovered
while building the DFA p
A state within an NFA. At most 2 transitions emanate from any NFA state.