ANTLR 3.5.3 · org.antlr.analysis.LL1DFA

Constructor Summary

Access	Constructor and Description
public	LL1DFA(int decisionNumber, NFAState decisionStartState, LookaheadSet[] altLook) From list of lookahead sets (one per alt in decision), create an LL(1) DFA.
public	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 and Description
protected Label	getLabelForSet(IntervalSet edgeSet)
protected SemanticContext.Predicate	getSynPredForAlt(NFAState decisionStartState, int alt)

Inherited from org.antlr.analysis.DFA:: _getMaxLookaheadDepth _hasCycle _hasSemPred _hasSynPred 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

LL1DFA	back to summary
public LL1DFA(int decisionNumber, NFAState decisionStartState, LookaheadSet[] altLook) From list of lookahead sets (one per alt in decision), create an LL(1) DFA. One edge per set. s0-{alt1}->:o=>1 \| \ \| -{alt2}->:o=>2 \| ... Annotations @SuppressWarnings:OverridableMethodCallInConstructor

LL1DFA

public LL1DFA(int decisionNumber, NFAState decisionStartState, LookaheadSet[] altLook)

From list of lookahead sets (one per alt in decision), create an LL(1) DFA. One edge per set. s0-{alt1}->:o=>1 | \ | -{alt2}->:o=>2 | ...

Annotations

LL1DFA	back to summary
public 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. Annotations @SuppressWarnings:OverridableMethodCallInConstructor

LL1DFA

public 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.

Annotations

getLabelForSet	back to summary
protected Label getLabelForSet(IntervalSet edgeSet)

getSynPredForAlt	back to summary
protected SemanticContext.Predicate getSynPredForAlt(NFAState decisionStartState, int alt)