Package | Description |
---|---|
org.antlr.analysis | |
org.antlr.tool |
Modifier and Type | Class and Description |
---|---|
class |
DFAState
A DFA state represents a set of possible NFA configurations.
|
class |
NFAState
A state within an NFA.
|
Modifier and Type | Field and Description |
---|---|
State |
Transition.target
The target of this transition
|
Modifier and Type | Method and Description |
---|---|
protected void |
DecisionProbe.getSampleInputSequenceUsingStateSet(State startState,
State targetState,
Set states,
List<Label> labels)
Given a start state and a final state, find a list of edge labels
between the two ignoring epsilon.
|
Constructor and Description |
---|
Transition(int label,
State target) |
Transition(Label label,
State target) |
Modifier and Type | Method and Description |
---|---|
protected IntSet |
NFAFactory.getCollapsedBlockAsSet(State blk)
Given a collapsed block of alts (a set of atoms), pull out
the set and return it.
|
String |
DOTGenerator.getDOT(State startState)
Return a String containing a DOT description that, when displayed,
will show the incoming state machine visually.
|
protected String |
DOTGenerator.getStateLabel(State s) |
String |
FASerializer.serialize(State s) |
String |
FASerializer.serialize(State s,
boolean renumber)
Return a string representation of a state machine.
|
protected void |
FASerializer.walkFANormalizingStateNumbers(State s)
In stateNumberTranslator, get a map from State to new, normalized
state number.
|
protected void |
DOTGenerator.walkRuleNFACreatingDOT(org.antlr.stringtemplate.StringTemplate dot,
State s)
Do a depth-first walk of the state machine graph and
fill a DOT description template.
|
protected void |
FASerializer.walkSerializingFA(List lines,
State s) |
Copyright © 2020. All rights reserved.