 They form a finite state machine (FSM).An FSM is a simple engine for parsing simple unnested languages, without using a stack.In this LR application, the FSM's modified "input language" has both terminal and nonterminal symbols, and covers any partially parsed stack snapshot of the full LR parse.