| 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.
|
|
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
|
|
|
|
with GuSeq. The GuSeq/GuBuf API is simplified
|
|
|
|
|
|
loading without speeding up parsing a lot
|
|
|
|
|
|
|
|
|
|
|
|
for the other CPUs
|
|
little benefit
|
|
|
|
|
|
for Android is temporary disabled
|
|
the dependency on the ./configure script
|
|
|
|
|
|
|
|
|
|
|
|
category for every expression
|
|
|
|
|
|
|
