Package | Description |
---|---|
org.antlr.analysis | |
org.antlr.misc | |
org.antlr.tool |
Modifier and Type | Field and Description |
---|---|
IntervalSet |
LookaheadSet.tokenTypeSet |
Modifier and Type | Method and Description |
---|---|
protected Label |
LL1DFA.getLabelForSet(IntervalSet edgeSet) |
Constructor and Description |
---|
LL1DFA(int decisionNumber,
NFAState decisionStartState,
MultiMap<IntervalSet,Integer> edgeMap)
From a set of edgeset→list-of-alts mappings, create a DFA
that uses syn preds for all |list-of-alts|>1.
|
Modifier and Type | Field and Description |
---|---|
static IntervalSet |
IntervalSet.COMPLETE_SET |
Modifier and Type | Method and Description |
---|---|
IntervalSet |
IntervalSet.and(IntSet other)
Return a new set with the intersection of this set with other.
|
IntervalSet |
IntervalSet.complement(int minElement,
int maxElement) |
IntervalSet |
IntervalSet.complement(IntSet vocabulary)
Given the set of possible values (rather than, say UNICODE or MAXINT),
return a new set containing all elements in vocabulary, but not in
this.
|
static IntervalSet |
IntervalSet.of(int a)
Create a set with a single element, el.
|
static IntervalSet |
IntervalSet.of(int a,
int b)
Create a set with all ints within range [a..b] (inclusive)
|
IntervalSet |
IntervalSet.subtract(IntSet other)
Compute this-other via this&~other.
|
Modifier and Type | Method and Description |
---|---|
protected List<IntervalSet> |
Grammar.makeEdgeSetsDisjoint(List<IntervalSet> edges) |
Modifier and Type | Method and Description |
---|---|
protected List<IntervalSet> |
Grammar.makeEdgeSetsDisjoint(List<IntervalSet> edges) |
Copyright © 1992–2015 ANTLR. All rights reserved.