| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-11-06 | the content of ParseEngAbs3.probs is now merged with ParseEngAbs.probs. The ↵ | kr.angelov | |
| later is now retrained. Once the grammar is compiled with the .probs file now it doesn't need anything more to do robust parsing. The robustness itself is controlled by the flags 'heuristic_search_factor', 'meta_prob' and 'meta_token_prob' in ParseEngAbs.gf | |||
| 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%. | |||
| 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-03-24 | bugfix in the lProlog generator | krasimir | |
| 2010-03-24 | partial support for def-rules in the Lambda Prolog generation | krasimir | |
| 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-22 | produce optimized Lambda Prolog code | krasimir | |
| 2010-03-20 | added experimental generation of Lambda Prolog code. Could be used for ↵ | krasimir | |
| exhaustive generation with dependent types. Doesn't support def rules yet but supports high-order syntax and lambda expressions. | |||
