| Age | Commit message (Collapse) | Author |
|
search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec.
|
|
|
|
|
|
|
|
|
|
declarations for generic programming from data.c are removed as well
|
|
use the generic programming API
|
|
decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
|
|
|
|
|
|
|
|
collection for the chart
|
|
statistical model instead of computed internally. this avoids rounding errors while computing the sum of a large number of small values.
|
|
|
|
|
|
This prevents from explosion in the memory size but it will also prevent us from parsing some sentences.
|
|
fair basis with the grammar rules
|
|
your own risk.
|
|
the same mechanism is now used for the metavariables
|
|
|
|
their abstract counter parts
|
|
|
|
|
|
|
|
fast lexical lookup from the same index
|
|
|
|
|
|
which also makes the types PgfLzr and PgfParser redundant.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
in the grammar printout
|
|
|
|
|
|
|