| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2021-07-08 | Remove two missing-methods warnings | John J. Camilleri | |
| 2015-06-23 | Bump version of .gfo and .pgf files, improve error messages on version mismatch | hallgren | |
| Becacuse of the new special tokens added to the Symbol type, .gfo and .pgf files produced with the current version of GF can not always be used with older versions of GF and the PGF run-time system. The PGF version number was increased from (2,0) to (2,1). GF can still read version (2,0) and (1,0), so old PGF files continue to work. The GFO version was increased from "GF03" to "GF04". | |||
| 2015-06-17 | forgot changes in the serialization in the Haskell runtime | krasimir | |
| 2015-05-11 | added all orthographic primitives | krasimir | |
| 2014-10-31 | now (+) in the abstract syntax works, i.e. it knows how to deal with partial ↵ | kr.angelov | |
| sums | |||
| 2014-10-30 | a more efficient tail call by using the new TUCK instruction | kr.angelov | |
| 2014-10-26 | an explicit SAVE instruction | kr.angelov | |
| 2014-10-22 | an explicit PUSH_FRAME instruction | kr.angelov | |
| 2014-10-16 | finally proper stack unwind in the evaluator | kr.angelov | |
| 2014-10-14 | the compiler now allows + to be used as a floating point addition in the ↵ | kr.angelov | |
| abstract syntax | |||
| 2014-10-09 | Prelude.CAPIT is now a built-in primitive. It still generates &| in the ↵ | kr.angelov | |
| Haskell runtime but will be intepreted in the C runtime | |||
| 2014-10-06 | using instruction RET was wrong; now use EVAL | kr.angelov | |
| 2014-09-29 | bugfix in the pattern matching compiler and a number of other fixes that I ↵ | kr.angelov | |
| somehow did not push before | |||
| 2014-09-11 | a major revision of the bytecode generator and JIT compiler. the effect is ↵ | kr.angelov | |
| that now we can compute with lambda functions and with true tail recursion | |||
| 2014-09-05 | the code for def rules now uses proper graph update to preserve lazyness | kr.angelov | |
| 2014-09-05 | full support for recursive def rules in the C runtime | kr.angelov | |
| 2014-09-01 | partial implementation for recursive def rules | kr.angelov | |
| 2014-08-11 | a partial support for def rules in the C runtime | kr.angelov | |
| The def rules are now compiled to byte code by the compiler and then to native code by the JIT compiler in the runtime. Not all constructions are implemented yet. The partial implementation is now in the repository but it is not activated by default since this requires changes in the PGF format. I will enable it only after it is complete. | |||
| 2013-12-17 | Add backward compatibility for reading old PGF files | hallgren | |
| Some backwards incompatible changes were made to the PGF file format after the release of GF 3.5. This patch adds a module for reading PGF files in the old format. This means that old PGF files on the grammaticalframework.org server will continue to work after we install the latest version of GF. | |||
| 2013-12-10 | bugfix in the grammar splitter | kr.angelov | |
| 2013-12-10 | option --split-pgf replaces option --mk-index. This splits the PGF into one ↵ | kr.angelov | |
| file for the abstract and one more for each concrete syntax. This is a preparation for being able to load only specific languages from the whole grammar. | |||
| 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-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%. | |||
| 2013-10-30 | added the linref construction in GF. The PGF version number is now bumped | kr.angelov | |
| 2013-10-21 | fix the grammar serialization for nonExist and BIND | kr.angelov | |
| 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 | |||
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |