References
ast
summary | ||
public |
C Children |
|
private |
F async _children_exhaust(children: Iterator) Exhausts the input children iterator. |
|
public |
F async * flatten(root: *) |
|
public |
Applies a given callable to each of the child of a given children async iterable. |
|
public |
F async materialize(root: *): * |
|
public |
Applies a given callable to each part of a given grammar rule (given as an iterable). |
|
public |
F async transform(tree: *, match: *, ctx: *): * |
error
summary | ||
public |
|
|
public |
|
|
public |
|
grammar
summary | ||
public |
C Grammar |
|
private |
F * _expandproduction(production: *) |
|
public |
F alphabet(productions: *): * |
|
public |
F expandobject(object: *): * |
|
public |
F from(object: *): * |
|
public |
|
ll1
summary | ||
public |
C Parser |
|
private |
F async _children_next_lazy(eof: Object, productions: Map, table: Map, tape: Tape, expected: Object): Promise<object> Get next child of table-driven predictive lazy parsing. |
|
private |
Generates the rows of the predictive parsing table for a grammar. |
|
private |
Computes the FOLLOW table for all nonterminals. |
|
private |
F _parse_lazy(eof: Object, productions: Map, table: Map, rule: Array, tape: Tape, nonterminal: String, production: String): Object Table-driven predictive lazy parsing. |
|
public |
List all reasons why a given grammar is not ll(1). |
|
public |
Compiles the predictive parsing table for a grammar. |
|
public |
Generate FOLLOW set for any rule given the FOLLOW sets for the nonterminals. |
|
public |
F from(grammar: *): * |
|
public |
Check if grammar is ll(1). |
|
public |
Parse |
util
summary | ||
public |
F anyIterator(object: *): * |
|
public |
Adds an element to a set and returns true if the set has changed. |
|
public |
Adds all elements of an iterable to a set and returns true if the set has changed. |