| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2012-10-19 | Refactor compileSourceModule | hallgren | |
| There was 55 lines of rather repetitive code with calls to 6 compiler passes. They have been replaced with 19 lines that call the 6 compiler passes plus 26 lines of helper functions. | |||
| 2012-10-19 | Consistenly use SourceGrammar instead of [SourceModule] when calling ↵ | hallgren | |
| compiler passes | |||
| 2011-11-29 | fix the compilation after the patch for the new type checker | 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 | Now the errors messages from GF.Compile.Update also follow the new format | kr.angelov | |
| 2011-11-15 | more structured format for errors and warnings from the compiler | kr.angelov | |
| 2011-11-14 | the new design for -tags | 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-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-02-26 | removed message showing what modules are read unless in verbose mode | aarne | |
| 2010-10-25 | During the compilation, the final message "OK" should be displayed only if ↵ | krasimir | |
| we are not in silent mode. This was changed incidentally on the way. | |||
| 2010-10-02 | forgot to remove a trace message | krasimir | |
| 2010-10-02 | refactor the API for random generation again. Now PGF contains probabilities ↵ | krasimir | |
| in the abstract syntax | |||
| 2010-06-18 | Yay!! Direct generation of PMCFG from GF grammar | 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-04-19 | use the native unicode support from GHC 6.12 | krasimir | |
| 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-01-17 | PGF is now real synchronous PMCFG | krasimir | |
| 2009-12-14 | rename some modules that had GFCC in the name to PGF+something | krasimir | |
| 2009-12-13 | reorganize the directories under src, and rescue the JavaScript interpreter ↵ | krasimir | |
| from deprecated | |||
