| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2012-12-19 | GF.Grammar.Lookup: new function lookupResDefLoc | hallgren | |
| It's like lookupResDef but it includes a source location in the output. | |||
| 2012-12-11 | partial evaluator work | hallgren | |
| * Evaluate operators once, not every time they are looked up * Remember the list of parameter values instead of recomputing it from the pattern type every time a table selection is made. * Quick fix for partial application of some predefined functions. | |||
| 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-11-07 | GF.Grammar.PatternMatch: relax overly restrictive type signatures | hallgren | |
| 2012-10-25 | GF.Grammar.Macros: add function collectPattOp | hallgren | |
| collectPattOp :: (Patt -> [a]) -> Patt -> [a] | |||
| 2012-10-24 | GF.Grammar.Macros: add function composPattOp | hallgren | |
| For Patt, analogous to composOp for Term. | |||
| 2012-09-28 | GF shell, show_operations: nicer looking types for linearization functions | hallgren | |
| Adding a lock field to the result type of linearization functions. TODO: figure out how to add a lock field to the argument types too. | |||
| 2012-09-27 | GF shell, show_operations: also show the types of linearization functions | hallgren | |
| This is a simple change in GF.Grammar.Lookup.allOpers, which is used only in the implementation of the show_operations command in the shell. This is useful when importing a concrete syntax (like LexiconEng) as a resource. However, the types don't always look as nice as I hoped... | |||
| 2012-08-29 | Use nub' instead of nub in some places, remove some unused nub imports | peter.ljunglof | |
| 2012-06-26 | Report many type errors instead of stopping after the first one | hallgren | |
| In GF.Compile.CheckGrammar, use a new topological sorting function that groups independent judgements, allowing them all to be checked before continuing or reporting errors. | |||
| 2012-06-25 | printing ResValue judgements as comments, to provide useful information when ↵ | aarne | |
| a conflict is found between parameter constructors | |||
| 2012-06-15 | Add file name to error message when reading a bad .gfo file (in some cases) | hallgren | |
| This turns error messages like gf: too few bytes. Failed reading at byte position 1 gf: /some/path/somefile.gfo: too few bytes. Failed reading at byte position 1 but a better fix would be to ignore bad .gfo files and compile from source. The problem is the way this decision is made in GF.Compile.ReadFiles.selectFormat... | |||
| 2012-05-04 | alex 3 incompatibility workaround | hallgren | |
| As a temporary workaround, alex is no longer invoked automatically when building with cabal. Developers who want to modify the lexer need to run alex on Lexer.x manually and record the modified Lexer.hs. src/compiler/GF/Grammar/lexer/Lexer.x -- hidden from cabal src/compiler/GF/Grammar/Lexer.hs -- update it manually | |||
| 2012-02-24 | the Predef function eqVal to compare equality of parameter values | aarne | |
| 2012-02-22 | gfse: experimental support for editing concrete syntax in text mode | hallgren | |
| 2011-12-02 | missing cases in GF.Grammar.Binary | kr.angelov | |
| 2011-11-30 | more stuff in the new type checker | kr.angelov | |
| 2011-11-29 | Sketch of the new type checker for the concrete syntax. Enabled only with ↵ | kr.angelov | |
| -new-comp | |||
| 2011-11-15 | fix in the versioning of the .gfo files | kr.angelov | |
| 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. | |||
| 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-15 | more structured format for errors and warnings from the compiler | kr.angelov | |
| 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-10-20 | Some experiments with PSeq (left commented out) | hallgren | |
| 2011-09-26 | don't count app nodes in term size | aarne | |
| 2011-09-24 | bug fixes in code size analysis | aarne | |
| 2011-09-22 | change the precedence for the left argument of -> | kr.angelov | |
| 2011-09-22 | the sd -size command now shows the size of all code needed for defining an oper | aarne | |
| 2011-09-22 | documented the ss command | aarne | |
| 2011-09-21 | statistics on grammar size in terms of constructors | aarne | |
| 2011-09-21 | commands ss to show source, and sd to show the dependencies of a constant | aarne | |
| 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-09-07 | GF.Grammar.Macros: simplify composOp and composSafeOp | hallgren | |
| 2011-09-01 | GF.Grammar.*: generalized the type of some functions that can not fail from ↵ | hallgren | |
| the Err monad to arbitrary monads | |||
| 2011-08-31 | GF.Infra.Modules: minor tweaks | hallgren | |
| Still keeping the modules both in a list and in a finite map. The overhead is smaller than I initially thought. | |||
| 2011-08-30 | GF.Infra.Modules: keep the modules of a grammar in a finite map instead of a ↵ | hallgren | |
| list This speeds up the compilation of PhrasebookFin.pgf by 12%, mosly by speeding up calls to lookupModule in calls from lookupParamValues, in calls from allParamValues. The invariant "modules are stored in dependency order" is no longer respected! But the type MGrammar is now abstract, making it easier to maintain this or other invariants in the future. | |||
| 2011-08-30 | GF.Grammar.Lookup: added function lookupQIdentInfo | hallgren | |
| + Avoids some code duplication by combinging lookupModule and lookupIdentInfo. + Also removed lookupIdentInfo from export list, since it is not used anywhere else. | |||
| 2011-08-30 | PatternMatch.hs: commented out suspicious unused function varsOfPatt | hallgren | |
| 2011-07-21 | GenIP, GenRP in Extra and any_Quant in ExtraEng | aarne | |
| 2011-06-02 | Predef functions toUpper, toLower, isUpper | aarne | |
| 2011-03-12 | make it possible to override opers defined in an interface by syntax ↵ | aarne | |
| 'instance Foo of Bar - [f,g,h]' | |||
| 2011-03-03 | overloaded opers included in sorting of judgements | aarne | |
| 2011-02-28 | the command show_operations to inspect opers in scope | aarne | |
| 2010-12-14 | option cc -list added | aarne | |
| 2010-12-10 | preparing resource api for multilingual documentation | aarne | |
| 2010-11-15 | bugfix for the abstract operations | krasimir | |
