| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-09-27 | a major refactoring in the C and the Haskell runtimes. Note incompatible ↵ | kr.angelov | |
| 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-08-23 | nonExist now does the expected thing | kr.angelov | |
| 2012-08-30 | another fix for teyjus | kr.angelov | |
| 2012-08-30 | the loading of PGF files was broken by the Teyjus patch. Now this is fixed | kr.angelov | |
| 2012-08-29 | A basic infrastructure for generating Teyjus bytecode from the GF abstract ↵ | kr.angelov | |
| syntax | |||
| 2011-11-15 | now we store version number in every .gfo file. If the file is compiled with ↵ | kr.angelov | |
| different compiler then we simply recompile it. | |||
| 2010-12-14 | optimization in the parser for large lexicons. Now, the parser is slightly ↵ | krasimir | |
| slower for grammars with a small lexicon but 3-4 times faster for the English Resource Grammar used in combination with Oxford Advanced Learners Dictionary | |||
| 2010-08-09 | native representation for HOAS in PMCFG and incremental type checking of the ↵ | krasimir | |
| parse forest | |||
| 2010-07-13 | bugfix in the decoding of literals in PGF.Binary | krasimir | |
| 2010-06-09 | dead code elimination for PGF. Note: the produced grammars will not work ↵ | krasimir | |
| well with metavariables and high-order abstract syntax | |||
| 2010-05-26 | since now we don't do common subexpression elimination for PGF we could ↵ | krasimir | |
| simplify the PMCFG generation | |||
| 2010-03-24 | now for every category we store, in PGF, the list of functions for it in ↵ | krasimir | |
| source-code order. The order matters for the termination of the exhaustive generation with dependent types. | |||
| 2010-03-18 | pattern @ should be propagated to PGF | krasimir | |
| 2010-03-18 | syntax for inaccessible patterns in GF | krasimir | |
| 2010-01-27 | cleanup the code of the PGF interpreter and polish the binary serialization ↵ | krasimir | |
| to match the preliminary specification | |||
| 2010-01-17 | PGF is now real synchronous PMCFG | krasimir | |
| 2010-01-17 | now the linearization is completely based on PMCFG | krasimir | |
| 2009-12-14 | remove the old parsing code and the -erasing=on flag | krasimir | |
| 2009-12-13 | reorganize the directories under src, and rescue the JavaScript interpreter ↵ | krasimir | |
| from deprecated | |||
