Package | Description |
---|---|
org.antlr.analysis | |
org.antlr.tool |
Modifier and Type | Field | Description |
---|---|---|
Map<NFAState,LookaheadSet> |
LL1Analyzer.FIRSTCache |
|
Map<Rule,LookaheadSet> |
LL1Analyzer.FOLLOWCache |
Modifier and Type | Method | Description |
---|---|---|
protected LookaheadSet |
LL1Analyzer._FIRST(NFAState s,
boolean chaseFollowTransitions) |
|
LookaheadSet |
LL1Analyzer.FIRST(NFAState s) |
From an NFA state, s, find the set of all labels reachable from s.
|
LookaheadSet |
LL1Analyzer.FOLLOW(Rule r) |
|
LookaheadSet |
LookaheadSet.intersection(LookaheadSet s) |
|
LookaheadSet |
LL1Analyzer.LOOK(NFAState s) |
|
LookaheadSet |
LookaheadSet.or(LookaheadSet other) |
|
LookaheadSet |
LookaheadSet.subtract(LookaheadSet other) |
Modifier and Type | Method | Description |
---|---|---|
LookaheadSet |
LookaheadSet.intersection(LookaheadSet s) |
|
LookaheadSet |
LookaheadSet.or(LookaheadSet other) |
|
void |
LookaheadSet.orInPlace(LookaheadSet other) |
|
LookaheadSet |
LookaheadSet.subtract(LookaheadSet other) |
Constructor | Description |
---|---|
LL1DFA(int decisionNumber,
NFAState decisionStartState,
LookaheadSet[] altLook) |
From list of lookahead sets (one per alt in decision), create
an LL(1) DFA.
|
LookaheadSet(LookaheadSet other) |
Modifier and Type | Method | Description |
---|---|---|
LookaheadSet |
Grammar.FIRST(NFAState s) |
|
LookaheadSet |
Grammar.LOOK(NFAState s) |
Copyright © 1992–2019 ANTLR. All rights reserved.