| Package | Description |
|---|---|
| org.antlr.v4.runtime.atn | |
| org.antlr.v4.runtime.dfa |
| Modifier and Type | Class and Description |
|---|---|
class |
BasicBlockStartState |
class |
BasicState |
class |
BlockEndState
Terminal node of a simple
(a|b|c) block. |
class |
BlockStartState
The start of a regular
(...) block. |
class |
DecisionState |
class |
LoopEndState
Mark the end of a * or + loop.
|
class |
PlusBlockStartState
Start of
(A|B|...)+ loop. |
class |
PlusLoopbackState
Decision state for
A+ and (A|B)+. |
class |
RuleStartState |
class |
RuleStopState
The last node in the ATN for a rule, unless that rule is the start symbol.
|
class |
StarBlockStartState
The block that begins a closure loop.
|
class |
StarLoopbackState |
class |
StarLoopEntryState |
class |
TokensStartState
The Tokens rule start state linking to each lexer rule start state
|
| Modifier and Type | Field and Description |
|---|---|
ATNState |
RuleTransition.followState
What node to begin computations following ref to rule
|
ATNState |
LoopEndState.loopBackState |
ATNState |
ATNConfig.state
The ATN state associated with this configuration
|
ATNState |
Transition.target
The target of this transition.
|
| Modifier and Type | Field and Description |
|---|---|
List<ATNState> |
ATN.states |
| Modifier and Type | Method and Description |
|---|---|
ATNState |
ParserATNSimulator.getReachableTarget(Transition trans,
int ttype) |
ATNState |
LexerATNSimulator.getReachableTarget(Transition trans,
int t) |
static ATNState |
ATNSimulator.stateFactory(int type,
int ruleIndex) |
| Modifier and Type | Method and Description |
|---|---|
Set<ATNState> |
ATNConfigSet.getStates() |
static Map<ATNState,BitSet> |
PredictionMode.getStateToAltMap(ATNConfigSet configs)
Get a map from state to alt subset from a configuration set.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
LL1Analyzer._LOOK(ATNState s,
PredictionContext ctx,
IntervalSet look,
Set<ATNConfig> lookBusy,
boolean seeThruPreds,
boolean addEOF)
Compute set of tokens that can come next.
|
void |
ATN.addState(ATNState state) |
ATNConfigSet |
ParserATNSimulator.computeStartState(ATNState p,
RuleContext ctx,
boolean fullCtx) |
protected ATNConfigSet |
LexerATNSimulator.computeStartState(CharStream input,
ATNState p) |
IntervalSet[] |
LL1Analyzer.getDecisionLookahead(ATNState s)
From an ATN state,
s, find the set of all labels reachable from
s at depth k. |
IntervalSet |
LL1Analyzer.LOOK(ATNState s,
RuleContext ctx)
Get lookahead, using
ctx if we reach end of rule. |
IntervalSet |
ATN.nextTokens(ATNState s)
Compute the set of valid tokens that can occur starting in s and staying in same rule.
|
IntervalSet |
ATN.nextTokens(ATNState s,
RuleContext ctx)
Compute the set of valid tokens that can occur starting in s.
|
void |
ATN.removeState(ATNState state) |
| Modifier and Type | Method and Description |
|---|---|
List<Set<ATNState>> |
DFA.getATNStatesAlongPath(ParserATNSimulator atn,
List<DFAState> dfaStates,
TokenStream input,
int start,
int stop) |
Copyright © 1992-2013 ANTLR. All Rights Reserved.