| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-11-12 | added Predef.SOFT_BIND. This special token allows zero or more spaces ↵ | kr.angelov | |
| between ordinary tokens. It is also used in the English RGL to attach the commas to the previous word. | |||
| 2013-11-05 | Eliminate mutual dependencies between the GF compiler and the PGF library | hallgren | |
| + References to modules under src/compiler have been eliminated from the PGF library (under src/runtime/haskell). Only two functions had to be moved (from GF.Data.Utilities to PGF.Utilities) to make this possible, other apparent dependencies turned out to be vacuous. + In gf.cabal, the GF executable no longer directly depends on the PGF library source directory, but only on the exposed library modules. This means that there is less duplication in gf.cabal and that the 30 modules in the PGF library will no longer be compiled twice while building GF. To make this possible, additional PGF library modules have been exposed, even though they should probably be considered for internal use only. They could be collected in a PGF.Internal module, or marked as "unstable", to make this explicit. + Also, by using the -fwarn-unused-imports flag, ~220 redundant imports were found and removed, reducing the total number of imports by ~15%. | |||
| 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. | |||
| 2012-08-29 | A basic infrastructure for generating Teyjus bytecode from the GF abstract ↵ | kr.angelov | |
| syntax | |||
| 2010-10-02 | refactor the API for random generation again. Now PGF contains probabilities ↵ | krasimir | |
| in the abstract syntax | |||
| 2010-08-09 | native representation for HOAS in PMCFG and incremental type checking of the ↵ | krasimir | |
| parse forest | |||
| 2010-05-26 | since now we don't do common subexpression elimination for PGF we could ↵ | krasimir | |
| simplify the PMCFG generation | |||
| 2010-04-19 | use the native unicode support from GHC 6.12 | krasimir | |
| 2010-01-29 | bugfix in the PGF typechecker and more test cases | 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 | |
| 2010-01-05 | store the label names in PMCFG | krasimir | |
| 2009-12-14 | remove the old parsing code and the -erasing=on flag | krasimir | |
| 2009-12-14 | rename some modules that had GFCC in the name to PGF+something | krasimir | |
