Home | History | Annotate | Download | only in antlr3

Lines Matching refs:DFA

37 =begin rdoc ANTLR3::DFA
39 DFA is a class that implements a finite state machine that chooses between
42 Deterministic Finite Automata (DFA) are finite state machines that are capable
49 generate a special DFA class definition to implement a decision.
63 In generated code, ANTLR defines DFA states using seven parameters, each defined
100 class DFA
163 | DFA cannot be instantiated without providing state array information.
165 | provided in the DFA subclass constants.
225 | DFA BANG!
289 | DFA BANG!