Class DFA<T>

DFA for ELR parsers. Stateless.

Type Parameters

  • T

Hierarchy

  • DFA

Constructors

  • Type Parameters

    • T

    Parameters

    • allGrammarRules: readonly GrammarRule<T>[]
    • entryNTs: ReadonlySet<string>
    • entryState: State<T>
    • NTClosures: ReadonlyMap<string, GrammarRule<T>[]>
    • firstSets: ReadonlyMap<string, GrammarSet>

      NT => Grammars

    • followSets: ReadonlyMap<string, GrammarSet>

      Grammar => Grammars

    • allInitialCandidates: ReadonlyMap<string, Candidate<T>>

      string representation of candidate => candidate

    • allStates: Map<string, State<T>>

      string representation of state => state

    • cascadeQueryPrefix: undefined | string
    • rollback: boolean
    • reLex: boolean
    • debug: boolean
    • logger: Logger

    Returns DFA<T>

Properties

NTClosures: ReadonlyMap<string, GrammarRule<T>[]>
allGrammarRules: readonly GrammarRule<T>[]
allInitialCandidates: ReadonlyMap<string, Candidate<T>>

string representation of candidate => candidate

allStates: Map<string, State<T>>

string representation of state => state

cascadeQueryPrefix: undefined | string
debug: boolean
entryNTs: ReadonlySet<string>
entryState: State<T>
firstSets: ReadonlyMap<string, GrammarSet>

NT => Grammars

followSets: ReadonlyMap<string, GrammarSet>

Grammar => Grammars

logger: Logger
reLex: boolean
rollback: boolean

Methods

Generated using TypeDoc