| Age | Commit message (Collapse) | Author |
|
|
|
|
|
support BIND. The following things are still broken: parseval, word completion, handling 'pre', the robust mode
|
|
PgfSymbolKS, PgfExprFun and PgfLiteralStr now keep their strings as embedded flexible arrays. The latest change gives us the same compactness as the old representation but it is a lot easier to use.
|
|
change in the PGF format!!!
The following are the outcomes:
- Predef.nonExist is fully supported by both the Haskell and the C runtimes
- Predef.BIND is now an internal compiler defined token. For now
it behaves just as usual for the Haskell runtime, i.e. it generates &+.
However, the special treatment will let us to handle it properly in
the C runtime.
- This required a major change in the PGF format since both
nonExist and BIND may appear inside 'pre' and this was not supported
before.
|
|
|
|
with GuSeq. The GuSeq/GuBuf API is simplified
|
|
|
|
|
|
|
|
|
|
|
|
little benefit
|
|
|
|
for Android is temporary disabled
|
|
the dependency on the ./configure script
|
|
|
|
trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
|
|
it is implicitly kept in the JIT compiled code
|
|
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.
|
|
|
|
|
|
|