| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
|
|
trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
|
|
|
|
|
|
one for the output trees. This means that the memory for parsing can be released as soon as the needed abstract trees are retrieved, while the trees themselves are retained in the separate output pool
|
|
per sentence
|
|
|
|
|
|
declarations for generic programming from data.c are removed as well
|
|
and adds another implementation which builds on the existing API for lexers in the C runtime. Now it is possible to write incremental Lexers in Python
|
|
|
|
|
|
|
|
in parser.c and reasoner.c
|
|
|
|
terminate with whitespace
|
|
|
|
|
|
|
|
collection for the chart
|
|
|
|
fair basis with the grammar rules
|
|
|
|
|
|
your own risk.
|
|
the same mechanism is now used for the metavariables
|
|
|
|
the best parse result
|
|
their abstract counter parts
|
|
statistical model with random weight for the meta variables.
|
|
|
|
pgf_parse_result for more accurate timing
|
|
|
|
which also makes the types PgfLzr and PgfParser redundant.
|
|
|
|
|
|
|
|
|
