| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2014-02-01 | new overload resolution, taking care of ad hoc overloading. | aarne | |
| 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-02-27 | Faster regular expression pattern matching in the grammar compiler. | hallgren | |
| The sequence operator (x+y) was implemented by splitting the string to be matched at all positions and trying to match the parts against the two subpatterns. To reduce the number of splits, we now estimate the minimum and maximum length of the string that the subpatterns could match. For common cases, where one of the subpatterns is a string of known length, like in (x+"y") or (x + ("a"|"o"|"u"|"e")+"y"), only one split will be tried. | |||
| 2013-02-27 | GF grammar pretty printer improvements | hallgren | |
| Allow line breaks in more places to make large terms more readable. | |||
| 2012-11-23 | Fix a prededence bug in GF grammar pretty printer | hallgren | |
| The pretty printer produced mkDet pre {"a"; "an" / vowel} Sg which is not accepted by the parser. The parser assigns pre { ... }, to prededence level 4, and this is now reflected in the pretty printer, so it prints mkDet (pre {"a"; "an" / vowel}) Sg (This caused a problem in GFSE since it parsers pretty printed grammars...) | |||
| 2012-06-25 | printing ResValue judgements as comments, to provide useful information when ↵ | aarne | |
| a conflict is found between parameter constructors | |||
| 2012-02-22 | gfse: experimental support for editing concrete syntax in text mode | hallgren | |
| 2011-11-29 | Sketch of the new type checker for the concrete syntax. Enabled only with ↵ | kr.angelov | |
| -new-comp | |||
| 2011-11-15 | now the pretty printer in GF has a new mode called Internal. This is the ↵ | kr.angelov | |
| most detailed mode and it can print even things that are not in the GF syntax. For example PMCFG snippets and indirections. | |||
| 2011-11-10 | Now PMCFG is compiled per module and at the end we only link it. The new ↵ | kr.angelov | |
| compilation schema is few times faster. | |||
| 2011-11-02 | merge GF.Infra.Modules and GF.Grammar.Grammar. This is a preparation for the ↵ | kr.angelov | |
| separate PGF building | |||
| 2011-11-02 | Now the compiler maintains more precise information for the source locations ↵ | kr.angelov | |
| of the different definitions. There is a --tags option which generates a list of all identifiers with their source locations. | |||
| 2011-10-20 | Introduce an explicit error value in the Term type | hallgren | |
| This makes it easier to treat run-time errors (e.g. caused by calls to Predef.error) in a way that is more typical for a lazy functional language. | |||
| 2011-09-22 | change the precedence for the left argument of -> | kr.angelov | |
| 2011-09-20 | module for analysing source grammars | aarne | |
| 2011-09-20 | command ss to show source (including gfo) in text; to be extended | aarne | |
| 2011-03-12 | make it possible to override opers defined in an interface by syntax ↵ | aarne | |
| 'instance Foo of Bar - [f,g,h]' | |||
| 2010-11-12 | operations in the abstract syntax | krasimir | |
| 2010-06-21 | GF.Grammar.Printer: print expressions with lincat and lin | krasimir | |
| 2010-06-18 | Yay!! Direct generation of PMCFG from GF grammar | krasimir | |
| 2010-06-08 | revert change in GF.Grammar.Printer that was intended for debugging only | krasimir | |
| 2010-05-28 | refactoring in GF.Grammar.Grammar | krasimir | |
| 2010-05-28 | bugfix in GF.Grammar.Printer | krasimir | |
| 2010-03-31 | fixed a deep bug in TypeCheck due to swap of arguments; print empty record ↵ | aarne | |
| as <> instead of {} to distinguish from empty record type | |||
| 2010-03-22 | store and propagate the exact source location for all judgements in the ↵ | krasimir | |
| grammar. It may not be used accurately in the error messages yet | |||
| 2010-03-18 | fix the precedence for patterns ~, - and @ | krasimir | |
| 2010-03-18 | syntax for inaccessible patterns in GF | krasimir | |
| 2010-02-22 | rule for pretty printing implicit arguments | krasimir | |
| 2010-02-22 | add pretty printing rule for implicit patterns | krasimir | |
| 2010-02-16 | no need to keep the list of constructors per category in .gfo | krasimir | |
| 2010-02-03 | fix the tabular printing when there is a V constructor | krasimir | |
| 2010-01-31 | refactor GF.Infra.Modules for better error messages | krasimir | |
| 2009-12-13 | reorganize the directories under src, and rescue the JavaScript interpreter ↵ | krasimir | |
| from deprecated | |||
