class Pegasus::Dfa::Dfa
- Pegasus::Dfa::Dfa
- Pegasus::Automata::UniqueAutomaton(Set(Pegasus::Automata::State(Int64?, Pegasus::Nfa::Transition)), UInt8)
- Pegasus::Automata::Automaton(Set(Pegasus::Automata::State(Int64?, Pegasus::Nfa::Transition)), UInt8)
- Reference
- Object
Overview
A deterministic finite automaton, whose dtransitions
are marked by bytes and whose data is actually the collection
of states this state represents in the source Pegasus::Nfa::Nfa
.
Defined in:
pegasus/dfa.crpegasus/table.cr
Constructors
-
.new
Creates a new UniqueAutomaton.
Instance Method Summary
-
#final_table
Creates a final table, which is used to determine if a state matched a token.
-
#state_table
Creates a transition table given, see
Pegasus::Language::LanguageData