public class ParseForestGLL extends ParseForest
The SPPF is a graph representation of all the (possibly infinite) parses that can be used to recognize the input sequence as a sentence in the grammar. This forest is created by the GLL parser.
logcategory
Constructor and Description |
---|
ParseForestGLL(ParserOptions options,
ParserGrammar grammar,
int rightExtent,
Token[] inputTokens) |
Modifier and Type | Method and Description |
---|---|
ForestNodeGLL |
extendableLeaf() |
ForestNodeGLL |
findOrCreate(State state,
Symbol symbol,
int leftExtent,
int rightExtent) |
ForestNodeGLL |
mkPN(State slot,
int leftExtent,
int pivot,
int rightExtent) |
void |
prune() |
getAmbiguousNodes, getNodes, getOptions, getParseTreeCount, getRoot, isAmbiguous, isInfinitelyAmbiguous, serialize, serialize, serialize, size
public ParseForestGLL(ParserOptions options, ParserGrammar grammar, int rightExtent, Token[] inputTokens)
public ForestNodeGLL findOrCreate(State state, Symbol symbol, int leftExtent, int rightExtent)
public ForestNodeGLL extendableLeaf()
public ForestNodeGLL mkPN(State slot, int leftExtent, int pivot, int rightExtent)
public void prune()