| Age | Commit message (Collapse) | Author |
|
loading. The parser still seems to be 8 times slower than before I introduced the BIND. At least the Android UI now feels a lot more comfortable
|
|
|
|
|
|
|
|
|
|
later is now retrained. Once the grammar is compiled with the .probs file now it doesn't need anything more to do robust parsing. The robustness itself is controlled by the flags 'heuristic_search_factor', 'meta_prob' and 'meta_token_prob' in ParseEngAbs.gf
|
|
|
|
|
|
yet but HOAS is implemented. The API is accessible from Python as well
|
|
|
|
order to test it properly
|
|
|
|
|
|
|
|
Haskell
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
support BIND. The following things are still broken: parseval, word completion, handling 'pre', the robust mode
|
|
broken unicode library for C.
|
|
|
|
|
|
|
|
|
|
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.
|
|
simplifies the binary search in the C runtime
|
|
|
|
linearizer but not in the parser yet
|
|
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.
|
|
|
|
|
|
|
|
outside of the compilation window
|
|
|
|
|
|
|
|
|
|
|