Enhanced C#
Language of your choice: library documentation
|
Represents the possible interpretations of a single input character, in terms of transitions in the grammar. More...
Represents the possible interpretations of a single input character, in terms of transitions in the grammar.
For example, suppose the grammar is as follows (where "strings" are actually aliases for tokens):
If the starting position is right after "for", then ComputeNextSet will generate two Cases, one at $id."in" $collection
and another at .'=' stop
. In both cases, the Set is $id, so KthSet.Set will also be $id.
Public fields | |
int | LA = -1 |
List< Transition > | Cases = new List<Transition>() |
IPGTerminalSet | Set |
Set< AndPred > | AndReq |
KthSet | Prev |
int | Alt |
bool | IsNongreedyExit |
Properties | |
bool | HasAnyAndPreds [get] |
Public Member Functions | |
KthSet (KthSet prev) | |
KthSet (Pred start, int alt, IPGTerminalSet emptySet, bool isNongreedyExit=false) | |
void | UpdateSet (bool addEOF) |
override string | ToString () |
KthSet | Clone (bool update) |