Modifier and Type | Method | Description |
---|---|---|
static boolean |
AnalysisPipeline.disjoint(IntervalSet[] altLook) |
Return whether lookahead sets are disjoint; no lookahead ⇒ not disjoint
|
Modifier and Type | Method | Description |
---|---|---|
IntervalSet |
LexerATNFactory.getSetFromCharSetLiteral(GrammarAST charSetAST) |
Modifier and Type | Method | Description |
---|---|---|
protected void |
LexerATNFactory.checkSetCollision(GrammarAST ast,
IntervalSet set,
int el) |
|
protected void |
LexerATNFactory.checkSetCollision(GrammarAST ast,
IntervalSet set,
int a,
int b) |
Modifier and Type | Method | Description |
---|---|---|
List<SrcOp> |
BlankOutputModelFactory.getLL1Test(IntervalSet look,
GrammarAST blkAST) |
|
List<SrcOp> |
OutputModelFactory.getLL1Test(IntervalSet look,
GrammarAST blkAST) |
|
List<SrcOp> |
ParserFactory.getLL1Test(IntervalSet look,
GrammarAST blkAST) |
Modifier and Type | Method | Description |
---|---|---|
TestSetInline |
Choice.addCodeForLookaheadTempVar(IntervalSet look) |
|
SrcOp |
LL1Loop.addCodeForLoopLookaheadTempVar(IntervalSet look) |
|
List<String[]> |
Choice.getAltLookaheadAsStringLists(IntervalSet[] altLookSets) |
|
ThrowNoViableAlt |
Choice.getThrowNoViableAlt(OutputModelFactory factory,
GrammarAST blkAST,
IntervalSet expecting) |
Constructor | Description |
---|---|
Sync(OutputModelFactory factory,
GrammarAST blkOrEbnfRootAST,
IntervalSet expecting,
int decision,
String position) |
|
TestSetInline(OutputModelFactory factory,
GrammarAST ast,
IntervalSet set,
int wordSize) |
|
ThrowEarlyExitException(OutputModelFactory factory,
GrammarAST ast,
IntervalSet expecting) |
|
ThrowNoViableAlt(OutputModelFactory factory,
GrammarAST blkOrEbnfRootAST,
IntervalSet expecting) |
|
ThrowRecognitionException(OutputModelFactory factory,
GrammarAST ast,
IntervalSet expecting) |
Modifier and Type | Field | Description |
---|---|---|
IntervalSet |
EscapeSequenceParsing.Result.propertyIntervalSet |
Modifier and Type | Method | Description |
---|---|---|
static String |
CharSupport.getIntervalSetEscapedString(IntervalSet intervalSet) |
Constructor | Description |
---|---|
Result(EscapeSequenceParsing.Result.Type type,
int codePoint,
IntervalSet propertyIntervalSet,
int startOffset,
int parseLength) |
Modifier and Type | Field | Description |
---|---|---|
protected IntervalSet |
DefaultErrorStrategy.lastErrorStates |
Modifier and Type | Method | Description |
---|---|---|
protected IntervalSet |
DefaultErrorStrategy.getErrorRecoverySet(Parser recognizer) |
|
protected IntervalSet |
DefaultErrorStrategy.getExpectedTokens(Parser recognizer) |
|
IntervalSet |
Parser.getExpectedTokens() |
Computes the set of input symbols which could follow the current parser
state and context, as given by
Recognizer.getState() and Parser.getContext() ,
respectively. |
IntervalSet |
RecognitionException.getExpectedTokens() |
Gets the set of input symbols which could potentially follow the
previously matched symbol at the time this exception was thrown.
|
IntervalSet |
Parser.getExpectedTokensWithinCurrentRule() |
Modifier and Type | Method | Description |
---|---|---|
protected void |
DefaultErrorStrategy.consumeUntil(Parser recognizer,
IntervalSet set) |
Consume tokens until one matches the given token set.
|
Modifier and Type | Field | Description |
---|---|---|
IntervalSet |
ATNState.nextTokenWithinRule |
Used to cache lookahead during parsing, not used during construction
|
IntervalSet |
SetTransition.set |
Modifier and Type | Method | Description |
---|---|---|
IntervalSet[] |
LL1Analyzer.getDecisionLookahead(ATNState s) |
Calculates the SLL(1) expected lookahead set for each outgoing transition
of an
ATNState . |
IntervalSet |
ATN.getExpectedTokens(int stateNumber,
RuleContext context) |
Computes the set of input symbols which could follow ATN state number
stateNumber in the specified full context . |
IntervalSet |
AtomTransition.label() |
|
IntervalSet |
RangeTransition.label() |
|
IntervalSet |
SetTransition.label() |
|
IntervalSet |
Transition.label() |
|
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 . |
Modifier and Type | Method | 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 . |
Modifier and Type | Method | Description |
---|---|---|
protected Transition |
ATNDeserializer.edgeFactory(ATN atn,
int type,
int src,
int trg,
int arg1,
int arg2,
int arg3,
List<IntervalSet> sets) |
|
static Transition |
ATNSimulator.edgeFactory(ATN atn,
int type,
int src,
int trg,
int arg1,
int arg2,
int arg3,
List<IntervalSet> sets) |
Constructor | Description |
---|---|
NotSetTransition(ATNState target,
IntervalSet set) |
|
SetTransition(ATNState target,
IntervalSet set) |
Modifier and Type | Field | Description |
---|---|---|
static IntervalSet |
IntervalSet.COMPLETE_CHAR_SET |
|
static IntervalSet |
IntervalSet.EMPTY_SET |
Modifier and Type | Method | Description |
---|---|---|
IntervalSet |
IntervalSet.addAll(IntSet set) |
|
IntervalSet |
IntervalSet.and(IntSet other) |
Return a new
IntSet object containing all elements that are
present in both the current set and the specified set a . |
IntervalSet |
IntervalSet.complement(int minElement,
int maxElement) |
|
IntervalSet |
IntervalSet.complement(IntSet vocabulary) |
Return a new
IntSet object containing all elements that are
present in elements but not present in the current set. |
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)
|
static IntervalSet |
IntervalSet.or(IntervalSet[] sets) |
combine all sets in the array returned the or'd value
|
IntervalSet |
IntervalSet.or(IntSet a) |
|
static IntervalSet |
IntervalSet.subtract(IntervalSet left,
IntervalSet right) |
Compute the set difference between two interval sets.
|
IntervalSet |
IntervalSet.subtract(IntSet a) |
|
static IntervalSet |
Utils.toSet(BitSet bits) |
Modifier and Type | Method | Description |
---|---|---|
static IntervalSet |
IntervalSet.or(IntervalSet[] sets) |
combine all sets in the array returned the or'd value
|
static IntervalSet |
IntervalSet.subtract(IntervalSet left,
IntervalSet right) |
Compute the set difference between two interval sets.
|
Constructor | Description |
---|---|
IntervalSet(IntervalSet set) |
Modifier and Type | Method | Description |
---|---|---|
static Map<Integer,Interval> |
Grammar.getStateToGrammarRegionMap(GrammarRootAST ast,
IntervalSet grammarTokenTypes) |
Modifier and Type | Method | Description |
---|---|---|
List<GrammarAST> |
GrammarAST.getNodesWithType(IntervalSet types) |
|
List<GrammarAST> |
GrammarAST.getNodesWithTypePreorderDFS(IntervalSet types) |
|
void |
GrammarAST.getNodesWithTypePreorderDFS_(List<GrammarAST> nodes,
IntervalSet types) |
Modifier and Type | Method | Description |
---|---|---|
static IntervalSet |
UnicodeData.getPropertyCodePoints(String propertyCodeOrAlias) |
Given a Unicode property (general category code, binary property name, or script name),
returns the
IntervalSet of Unicode code point ranges which have that property. |
Copyright © 1992–2019 ANTLR. All rights reserved.