namespaceSqlParser\Automaton

Classes 12§

Bitset @visibility root	Sets of terminals as arrays of 32-bit words.
BuildResult @visibility root	A built parse table together with the conflicts settled while building it.
ClosureIndex @visibility root	What the closure of an item set adds, precomputed per nonterminal.
ConflictResolver @visibility root	Settles the conflicts of one state the way its generator would.
ConflictSummary @visibility root	How many conflicts a table build settled by default, against what the grammar expected.
Digraph @visibility root	Closes sets over a relation: each node ends with the union of every node it reaches.
LookaheadSets @visibility root	The LALR(1) lookahead of every reduction, by the method of DeRemer and Pennello.
Lr0Automaton @visibility root	The states of an LR(0) automaton, their transitions and their completed rules.
Lr0Builder @visibility root	Builds the LR(0) automaton of a grammar from kernel items alone.
NullableSet @visibility root	The nonterminals that can derive the empty string.
ParseTableBuilder @visibility root	Builds the LALR(1) parse table of a grammar.
ResolvedState @visibility root	The actions of one state once its conflicts have been settled.