| Package | Description |
|---|---|
| org.antlr.v4.runtime | |
| org.antlr.v4.runtime.atn | |
| org.antlr.v4.runtime.dfa |
| Modifier and Type | Method and Description |
|---|---|
protected ATNState |
ParserInterpreter.getATNState() |
| Modifier and Type | Method and Description |
|---|---|
protected void |
ParserInterpreter.visitRuleStopState(ATNState p) |
protected void |
ParserInterpreter.visitState(ATNState p) |
| 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 |
Transition.target
The target of this transition.
|
| Modifier and Type | Field and Description |
|---|---|
List<ATNState> |
ATN.states |
| Modifier and Type | Method and Description |
|---|---|
protected ATNState |
ParserATNSimulator.getReachableTarget(ATNConfig source,
Transition trans,
int ttype) |
protected ATNState |
LexerATNSimulator.getReachableTarget(Transition trans,
int t) |
ATNState |
ATNConfig.getState()
Gets the ATN state associated with this configuration
|
static ATNState |
ATNSimulator.stateFactory(int type,
int ruleIndex)
Deprecated.
Use
ATNDeserializer.stateFactory(int, int) instead. |
protected ATNState |
ATNDeserializer.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,
ATNState stopState,
PredictionContext ctx,
IntervalSet look,
Set<ATNConfig> lookBusy,
BitSet calledRuleStack,
boolean seeThruPreds,
boolean addEOF)
Compute set of tokens that can follow
s in the ATN in the
specified ctx. |
void |
ATN.addState(ATNState state) |
protected ATNConfigSet |
LexerATNSimulator.computeStartState(CharStream input,
ATNState p) |
static ATNConfig |
ATNConfig.create(ATNState state,
int alt,
PredictionContext context) |
static ATNConfig |
ATNConfig.create(ATNState state,
int alt,
PredictionContext context,
SemanticContext semanticContext) |
static ATNConfig |
ATNConfig.create(ATNState state,
int alt,
PredictionContext context,
SemanticContext semanticContext,
LexerActionExecutor lexerActionExecutor) |
static Transition |
CodePointTransitions.createWithCodePoint(ATNState target,
int codePoint)
If
codePoint is <= U+FFFF, returns a new AtomTransition. |
static Transition |
CodePointTransitions.createWithCodePointRange(ATNState target,
int codePointFrom,
int codePointTo)
|
IntervalSet[] |
LL1Analyzer.getDecisionLookahead(ATNState s)
Calculates the SLL(1) expected lookahead set for each outgoing transition
of an
ATNState. |
IntervalSet |
LL1Analyzer.LOOK(ATNState s,
ATNState stopState,
PredictionContext ctx)
Compute set of tokens that can follow
s in the ATN in the
specified ctx. |
IntervalSet |
LL1Analyzer.LOOK(ATNState s,
PredictionContext ctx)
Compute set of tokens that can follow
s in the ATN in the
specified ctx. |
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,
PredictionContext ctx)
Compute the set of valid tokens that can occur starting in state
s. |
void |
ATN.removeState(ATNState state) |
ATNConfig |
ATNConfig.transform(ATNState state,
boolean checkNonGreedy) |
ATNConfig |
ATNConfig.transform(ATNState state,
LexerActionExecutor lexerActionExecutor,
boolean checkNonGreedy) |
ATNConfig |
ATNConfig.transform(ATNState state,
PredictionContext context,
boolean checkNonGreedy) |
ATNConfig |
ATNConfig.transform(ATNState state,
SemanticContext semanticContext,
boolean checkNonGreedy) |
| Constructor and Description |
|---|
AbstractPredicateTransition(ATNState target) |
ActionTransition(ATNState target,
int ruleIndex) |
ActionTransition(ATNState target,
int ruleIndex,
int actionIndex,
boolean isCtxDependent) |
ATNConfig(ATNConfig c,
ATNState state,
PredictionContext context) |
ATNConfig(ATNState state,
int alt,
PredictionContext context) |
AtomTransition(ATNState target,
int label) |
EpsilonTransition(ATNState target) |
EpsilonTransition(ATNState target,
int outermostPrecedenceReturn) |
NotSetTransition(ATNState target,
IntervalSet set) |
PrecedencePredicateTransition(ATNState target,
int precedence) |
PredicateTransition(ATNState target,
int ruleIndex,
int predIndex,
boolean isCtxDependent) |
RangeTransition(ATNState target,
int from,
int to) |
RuleTransition(RuleStartState ruleStart,
int ruleIndex,
ATNState followState)
Deprecated.
Use
RuleTransition(RuleStartState, int, int, ATNState) instead. |
RuleTransition(RuleStartState ruleStart,
int ruleIndex,
int precedence,
ATNState followState) |
SetTransition(ATNState target,
IntervalSet set) |
Transition(ATNState target) |
WildcardTransition(ATNState target) |
| Modifier and Type | Field and Description |
|---|---|
ATNState |
DFA.atnStartState
From which ATN state did we create this DFA?
|
| Constructor and Description |
|---|
DFA(ATNState atnStartState)
Constructs a
DFA instance associated with a lexer mode. |
DFA(ATNState atnStartState,
int decision)
Constructs a
DFA instance associated with a decision. |
Copyright © 1992–2024 Daniel Sun. All rights reserved.