public class LL1DFA extends DFA
accept, altToAcceptState, cyclic, CYCLIC_BUSY, CYCLIC_DONE, CYCLIC_UNKNOWN, decisionNFAStartState, decisionNumber, description, edgeTransitionClass, edgeTransitionClassMap, eof, eot, generator, hasPredicateBlockedByAction, max, max_k, MAX_STATE_TRANSITIONS_FOR_TABLE, MAX_TIME_PER_DFA_CREATION, min, nAlts, nfa, nfaConverter, numberOfStates, predicateVisible, probe, REACHABLE_BUSY, REACHABLE_NO, REACHABLE_UNKNOWN, REACHABLE_YES, recursiveAltSet, reduced, special, specialStates, specialStateSTs, startState, stateCounter, states, transition, transitionEdgeTables, uniqueCompressedSpecialStateNum, uniqueStates, unreachableAlts, user_k
Constructor | Description |
---|---|
LL1DFA(int decisionNumber,
NFAState decisionStartState,
LookaheadSet[] altLook) |
From list of lookahead sets (one per alt in decision), create
an LL(1) DFA.
|
LL1DFA(int decisionNumber,
NFAState decisionStartState,
MultiMap<IntervalSet,Integer> edgeMap) |
From a set of edgeset→list-of-alts mappings, create a DFA
that uses syn preds for all |list-of-alts|>1.
|
Modifier and Type | Method | Description |
---|---|---|
protected Label |
getLabelForSet(IntervalSet edgeSet) |
|
protected SemanticContext.Predicate |
getSynPredForAlt(NFAState decisionStartState,
int alt) |
addState, canInlineDecision, createEOTAndEOFTables, createMinMaxTables, createSpecialTable, createStateTables, createTransitionTableEntryForState, doesStateReachAcceptState, findAllGatedSynPredsUsedInDFAAcceptStates, getAcceptState, getAutoBacktrackMode, getDecisionASTNode, getDecisionNumber, getDescription, getHasSynPred, getJavaCompressedAccept, getJavaCompressedEOF, getJavaCompressedEOT, getJavaCompressedMax, getJavaCompressedMin, getJavaCompressedSpecial, getJavaCompressedTransition, getMaxLookaheadDepth, getMaxStateNumber, getNFADecisionStartState, getNumberOfAlts, getNumberOfStates, getReasonForFailure, getRunLengthEncoding, getState, getUniqueStates, getUnreachableAlts, getUserMaxLookahead, hasCycle, hasSemPred, hasSynPred, initAltRelatedInfo, isClassicDFA, isCyclic, isGreedy, isReduced, isTokensRuleDecision, newState, okToRetryDFAWithK1, predict, removeState, resetStateNumbersToBeContiguous, setAcceptState, setState, setUserMaxLookahead, toString, verify
public LL1DFA(int decisionNumber, NFAState decisionStartState, LookaheadSet[] altLook)
public LL1DFA(int decisionNumber, NFAState decisionStartState, MultiMap<IntervalSet,Integer> edgeMap)
protected Label getLabelForSet(IntervalSet edgeSet)
protected SemanticContext.Predicate getSynPredForAlt(NFAState decisionStartState, int alt)
Copyright © 1992–2019 ANTLR. All rights reserved.