kr.angelov
efa4bc4d62
a major refactoring in the C and the Haskell runtimes. Note incompatible 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.
2013-09-27 15:09:48 +00:00
kr.angelov
fd5220038d
A basic infrastructure for generating Teyjus bytecode from the GF abstract syntax
2012-08-29 11:43:02 +00:00
krasimir
be9ad26aea
refactor the API for random generation again. Now PGF contains probabilities in the abstract syntax
2010-10-02 13:03:57 +00:00
krasimir
9aa7c88c5a
native representation for HOAS in PMCFG and incremental type checking of the parse forest
2010-08-09 10:10:08 +00:00
krasimir
5e2feb4b60
since now we don't do common subexpression elimination for PGF we could simplify the PMCFG generation
2010-05-26 09:37:32 +00:00
krasimir
0b6b30d4a8
use the native unicode support from GHC 6.12
2010-04-19 09:38:36 +00:00
krasimir
9e547710f5
bugfix in the PGF typechecker and more test cases
2010-01-29 21:10:14 +00:00
krasimir
3685595ece
cleanup the code of the PGF interpreter and polish the binary serialization to match the preliminary specification
2010-01-27 09:39:14 +00:00
krasimir
a039808141
PGF is now real synchronous PMCFG
2010-01-17 21:35:36 +00:00
krasimir
362f333ebd
now the linearization is completely based on PMCFG
2010-01-17 17:05:21 +00:00
krasimir
11218cdbca
store the label names in PMCFG
2010-01-05 08:35:33 +00:00
krasimir
76debee2c1
remove the old parsing code and the -erasing=on flag
2009-12-14 10:54:22 +00:00
krasimir
15ddc283d4
rename some modules that had GFCC in the name to PGF+something
2009-12-14 10:10:58 +00:00
