| Age | Commit message (Collapse) | Author |
|
|
|
|
|
|
|
|
|
|
|
except those that require def rules. The design is consistent with the STG virtual machine
|
|
the embedded grammars especially pleasing
|
|
|
|
|
|
There are also some changes in src/runtime/python/setyp.py to support this.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
yet but HOAS is implemented. The API is accessible from Python as well
|
|
|
|
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.
|
|
and BIND
|
|
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.
|
|
|
|
|
|
runtime
|
|
|
|
|
|
category for every expression
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
|
|
|
|
|
|
|
|
|
|
|
|
the first element and a the list [e1,e2] as the second. This makes it easier to decompose partial abstract trees
|
|
|
|
|
|
exception if the grammar is missing
|
|
|
|
linearized
|