Package | Description |
---|---|
org.antlr.analysis | |
org.antlr.codegen | |
org.antlr.grammar.v3 | |
org.antlr.misc | |
org.antlr.tool |
Modifier and Type | Field | Description |
---|---|---|
protected IntSet |
Label.labelSet |
A set of token types or character codes if label==SET
|
IntSet |
DFA.recursiveAltSet |
Track whether an alt discovers recursion for each alt during
NFA to DFA conversion; >1 alt with recursion implies nonregular.
|
Modifier and Type | Method | Description |
---|---|---|
IntSet |
Label.getSet() |
Modifier and Type | Method | Description |
---|---|---|
List<IntSet> |
MachineProbe.getEdgeLabels(DFAState targetState) |
Return a list of edge labels from start state to targetState.
|
Modifier and Type | Method | Description |
---|---|---|
boolean |
Label.matches(IntSet set) |
|
void |
Label.setSet(IntSet set) |
Modifier and Type | Method | Description |
---|---|---|
String |
MachineProbe.getInputSequenceDisplay(Grammar g,
List<IntSet> labels) |
Given List<IntSet>, return a String with a useful representation of the
associated input string.
|
Constructor | Description |
---|---|
Label(IntSet labelSet) |
Make a set label
|
LookaheadSet(IntSet s) |
Modifier and Type | Method | Description |
---|---|---|
org.stringtemplate.v4.ST |
CodeGenerator.genSetExpr(org.stringtemplate.v4.STGroup templates,
IntSet set,
int k,
boolean partOfDFA) |
For intervals such as [3..3, 30..35], generate an expression that
tests the lookahead similar to LA(1)==3 || (LA(1)>=30&&LA(1)<=35)
|
Modifier and Type | Method | Description |
---|---|---|
IntSet |
TreeToNFAConverter.setRule() |
|
IntSet |
TreeToNFAConverter.setRule(GrammarAST t) |
Modifier and Type | Method | Description |
---|---|---|
void |
TreeToNFAConverter.setElement(IntSet elements) |
Modifier and Type | Class | Description |
---|---|---|
class |
BitSet |
A BitSet to replace java.util.BitSet.
|
class |
IntervalSet |
A set of integers that relies on ranges being common to do
"run-length-encoded" like compression (if you view an IntSet like
a BitSet with runs of 0s and 1s).
|
Modifier and Type | Method | Description |
---|---|---|
IntSet |
BitSet.and(IntSet a) |
|
IntSet |
IntSet.and(IntSet a) |
Return the intersection of this set with the argument, creating
a new set.
|
IntSet |
BitSet.complement() |
|
IntSet |
BitSet.complement(IntSet set) |
|
IntSet |
IntSet.complement(IntSet elements) |
|
IntSet |
BitSet.or(IntSet a) |
return this | a in a new set
|
IntSet |
IntervalSet.or(IntSet a) |
TODO: implement this!
|
IntSet |
IntSet.or(IntSet a) |
|
IntSet |
BitSet.subtract(IntSet a) |
|
IntSet |
IntSet.subtract(IntSet a) |
Modifier and Type | Method | Description |
---|---|---|
void |
BitSet.addAll(IntSet set) |
|
void |
IntervalSet.addAll(IntSet set) |
|
void |
IntSet.addAll(IntSet set) |
Add all elements from incoming set to this set.
|
IntSet |
BitSet.and(IntSet a) |
|
IntervalSet |
IntervalSet.and(IntSet other) |
Return a new set with the intersection of this set with other.
|
IntSet |
IntSet.and(IntSet a) |
Return the intersection of this set with the argument, creating
a new set.
|
IntSet |
BitSet.complement(IntSet set) |
|
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.
|
IntSet |
IntSet.complement(IntSet elements) |
|
static BitSet |
BitSet.of(IntSet set) |
|
IntSet |
BitSet.or(IntSet a) |
return this | a in a new set
|
IntSet |
IntervalSet.or(IntSet a) |
TODO: implement this!
|
IntSet |
IntSet.or(IntSet a) |
|
IntSet |
BitSet.subtract(IntSet a) |
|
IntervalSet |
IntervalSet.subtract(IntSet other) |
Compute this-other via this&~other.
|
IntSet |
IntSet.subtract(IntSet a) |
Modifier and Type | Field | Description |
---|---|---|
protected IntSet |
Grammar.charVocabulary |
TODO: hook this to the charVocabulary option
|
protected IntSet |
GrammarAST.setValue |
If this is a SET node, what are the elements?
|
Modifier and Type | Method | Description |
---|---|---|
IntSet |
Grammar.complement(int atom) |
|
IntSet |
Grammar.complement(IntSet set) |
For lexer grammars, return everything in unicode not in set.
|
IntSet |
Grammar.getAllCharValues() |
If there is a char vocabulary, use it; else return min to max char
as defined by the target.
|
protected IntSet |
NFAFactory.getCollapsedBlockAsSet(State blk) |
Given a collapsed block of alts (a set of atoms), pull out
the set and return it.
|
IntSet |
Grammar.getSetFromRule(TreeToNFAConverter nfabuilder,
String ruleName) |
Get the set equivalent (if any) of the indicated rule from this
grammar.
|
IntSet |
GrammarAST.getSetValue() |
|
IntSet |
Grammar.getTokenTypes() |
Return a set of all possible token or char types for this grammar
|
Modifier and Type | Method | Description |
---|---|---|
StateCluster |
NFAFactory.build_Set(IntSet set,
GrammarAST associatedAST) |
From set build single edge graph o->o-set->o.
|
IntSet |
Grammar.complement(IntSet set) |
For lexer grammars, return everything in unicode not in set.
|
void |
GrammarAST.setSetValue(IntSet setValue) |
Copyright © 1992–2019 ANTLR. All rights reserved.