Package | Description |
---|---|
org.antlr.analysis | |
org.antlr.tool |
Modifier and Type | Class | Description |
---|---|---|
class |
ActionLabel |
|
class |
PredicateLabel |
Modifier and Type | Field | Description |
---|---|---|
Label |
NFAState.incidentEdgeLabel |
For o-A->o type NFA tranitions, record the label that leads to this
state.
|
Label |
Transition.label |
What label must be consumed to transition to target
|
Modifier and Type | Field | Description |
---|---|---|
protected OrderedHashSet<Label> |
DFAState.reachableLabels |
As this state is constructed (i.e., as NFA states are added), we
can easily check for non-epsilon transitions because the only
transition that could be a valid label is transition(0).
|
Modifier and Type | Method | Description |
---|---|---|
protected Label |
LL1DFA.getLabelForSet(IntervalSet edgeSet) |
Modifier and Type | Method | Description |
---|---|---|
OrderedHashSet<Label> |
DFAState.getReachableLabels() |
|
List<Label> |
DecisionProbe.getSampleNonDeterministicInputSequence(DFAState targetState) |
Return a List<Label> indicating an input sequence that can be matched
from the start state of the DFA to the targetState (which is known
to have a problem).
|
Modifier and Type | Method | Description |
---|---|---|
void |
Label.add(Label a) |
|
protected void |
DFAState.addReachableLabel(Label label) |
Add label uniquely and disjointly; intersection with
another set or int/char forces breaking up the set(s).
|
int |
DFAState.addTransition(DFAState target,
Label label) |
Add a transition from this state to target with label.
|
protected static int |
NFAToDFAConverter.addTransition(DFAState d,
Label label,
DFAState targetState,
Map<Integer,Transition> targetToLabelMap) |
Add a transition from state d to targetState with label in normal case.
|
int |
Label.compareTo(Label o) |
|
static boolean |
Label.intersect(Label label,
Label edgeLabel) |
|
boolean |
Label.matches(Label other) |
|
DFAState |
NFAToDFAConverter.reach(DFAState d,
Label label) |
Given the set of NFA states in DFA state d, find all NFA states
reachable traversing label arcs.
|
Modifier and Type | Method | Description |
---|---|---|
String |
DecisionProbe.getInputSequenceDisplay(List<? extends Label> labels) |
Given List<Label>, return a String with a useful representation
of the associated input string.
|
protected boolean |
DecisionProbe.getNFAPath(NFAState s,
int labelIndex,
List<? extends Label> labels,
List<? super NFAState> path) |
Given a sample input sequence, you usually would like to know the
path taken through the NFA.
|
List<? extends NFAState> |
DecisionProbe.getNFAPathStatesForAlt(int firstAlt,
int alt,
List<? extends Label> labels) |
Given an alternative associated with a nondeterministic DFA state,
find the path of NFA states associated with the labels sequence.
|
protected void |
DecisionProbe.getSampleInputSequenceUsingStateSet(State startState,
State targetState,
Set<DFAState> states,
List<Label> labels) |
Given a start state and a final state, find a list of edge labels
between the two ignoring epsilon.
|
Constructor | Description |
---|---|
Transition(Label label,
State target) |
Modifier and Type | Method | Description |
---|---|---|
protected static Integer |
RandomPhrase.getTokenType(Label label) |
Copyright © 1992–2019 ANTLR. All rights reserved.