C# Class Antlr4.Runtime.Atn.PredicateTransition

TODO: this is old comment: A tree of semantic predicates from the grammar AST if label==SEMPRED.

TODO: this is old comment: A tree of semantic predicates from the grammar AST if label==SEMPRED. In the ATN, labels will always be exactly one predicate, but the DFA may have to combine a bunch of them as it collects predicates from multiple ATN configurations into a single DFA state.

Inheritance: AbstractPredicateTransition

Show file Open project: antlr/antlr4 Class Usage Examples

Public Properties

Property	Type	Description
isCtxDependent	bool
predIndex	int
ruleIndex	int

Public Methods

Method	Description
Matches ( int symbol, int minVocabSymbol, int maxVocabSymbol ) : bool
PredicateTransition ( ATNState target, int ruleIndex, int predIndex, bool isCtxDependent ) : Antlr4.Runtime.Atn

Private Methods

Method	Description
ToString ( ) : string

Method Details

Matches() public method

public Matches ( int symbol, int minVocabSymbol, int maxVocabSymbol ) : bool
symbol	int
minVocabSymbol	int
maxVocabSymbol	int
return	bool

PredicateTransition() public method

public PredicateTransition ( ATNState target, int ruleIndex, int predIndex, bool isCtxDependent ) : Antlr4.Runtime.Atn
target	ATNState
ruleIndex	int
predIndex	int
isCtxDependent	bool
return	Antlr4.Runtime.Atn

Property Details

isCtxDependent public property

public bool isCtxDependent
return	bool

predIndex public property

public int predIndex
return	int

ruleIndex public property

public int ruleIndex
return	int