Package | Description |
---|---|
org.antlr.v4.analysis | |
org.antlr.v4.automata | |
org.antlr.v4.codegen.model | |
org.antlr.v4.runtime | |
org.antlr.v4.runtime.atn | |
org.antlr.v4.tool | |
org.antlr.v4.tool.ast |
Modifier and Type | Method and Description |
---|---|
boolean |
LeftRecursionDetector.check(Rule enclosingRule,
ATNState s,
Set<ATNState> visitedStates)
From state s, look for any transition to a rule that is currently
being traced.
|
Modifier and Type | Method and Description |
---|---|
boolean |
LeftRecursionDetector.check(Rule enclosingRule,
ATNState s,
Set<ATNState> visitedStates)
From state s, look for any transition to a rule that is currently
being traced.
|
Modifier and Type | Field and Description |
---|---|
ATNState |
ATNFactory.Handle.left |
ATNState |
ATNFactory.Handle.right |
Modifier and Type | Field and Description |
---|---|
protected List<Triple<Rule,ATNState,ATNState>> |
ParserATNFactory.preventEpsilonClosureBlocks |
protected List<Triple<Rule,ATNState,ATNState>> |
ParserATNFactory.preventEpsilonClosureBlocks |
protected List<Triple<Rule,ATNState,ATNState>> |
ParserATNFactory.preventEpsilonOptionalBlocks |
protected List<Triple<Rule,ATNState,ATNState>> |
ParserATNFactory.preventEpsilonOptionalBlocks |
Modifier and Type | Method and Description |
---|---|
<T extends ATNState> |
ParserATNFactory.newState(Class<T> nodeType,
GrammarAST node) |
Modifier and Type | Method and Description |
---|---|
ATNState |
ParserATNFactory.newState() |
ATNState |
ATNFactory.newState() |
ATNState |
ParserATNFactory.newState(GrammarAST node) |
Modifier and Type | Method and Description |
---|---|
void |
ParserATNFactory.addFollowLink(int ruleIndex,
ATNState right) |
protected void |
ParserATNFactory.epsilon(ATNState a,
ATNState b) |
protected void |
ParserATNFactory.epsilon(ATNState a,
ATNState b,
boolean prepend) |
void |
ATNVisitor.visit_(ATNState s,
Set<Integer> visited) |
void |
ATNVisitor.visit(ATNState s) |
void |
TailEpsilonRemover.visitState(ATNState p) |
void |
ATNVisitor.visitState(ATNState s) |
Constructor and Description |
---|
ATNPrinter(Grammar g,
ATNState start) |
Handle(ATNState left,
ATNState right) |
Modifier and Type | Field and Description |
---|---|
ATNState |
RuleFunction.startState |
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 |
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 |
---|---|
protected ATNState |
LexerATNSimulator.getReachableTarget(Transition trans,
int t) |
protected ATNState |
ParserATNSimulator.getReachableTarget(Transition trans,
int ttype) |
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 |
ParserATNSimulator.computeStartState(ATNState p,
RuleContext ctx,
boolean fullCtx) |
protected ATNConfigSet |
LexerATNSimulator.computeStartState(CharStream input,
ATNState p) |
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,
RuleContext ctx)
Compute set of tokens that can follow
s in the ATN in the
specified ctx . |
IntervalSet |
LL1Analyzer.LOOK(ATNState s,
RuleContext 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,
RuleContext ctx)
Compute the set of valid tokens that can occur starting in state
s . |
void |
ATN.removeState(ATNState state) |
Modifier and Type | Method and Description |
---|---|
String |
DOTGenerator.getDOT(ATNState startState) |
String |
DOTGenerator.getDOT(ATNState startState,
boolean isLexer) |
String |
DOTGenerator.getDOT(ATNState startState,
String[] ruleNames,
boolean isLexer)
Return a String containing a DOT description that, when displayed,
will show the incoming state machine visually.
|
protected String |
DOTGenerator.getStateLabel(ATNState s) |
Modifier and Type | Field and Description |
---|---|
ATNState |
GrammarAST.atnState
If we build an ATN, we make AST node point at left edge of ATN construct
|
Copyright © 1992–2020 ANTLR. All rights reserved.