| 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%. | |||
| 2013-10-30 | added the linref construction in GF. The PGF version number is now bumped | kr.angelov | |
| 2013-10-02 | something in the typeinferencer of the latest GHC has changed. I need to add ↵ | kr.angelov | |
| a type signature for GF.Compile.GrammarToPGF.genCncFuns in order to compile. | |||
| 2013-09-23 | the compiler now sorts the list of sequences in the PGF files | kr.angelov | |
| 2013-09-23 | GrammarToPGF now looks only at the top modules for the PGF flags | kr.angelov | |
| 2013-09-23 | GF.Grammar.Grammar.allExtends now returns a list of source modules instead ↵ | kr.angelov | |
| of just the module names. This saves extra lookups later | |||
| 2013-09-19 | Introduce type RawIdent; only 9 imports of Data.ByteString.Char8 remain | hallgren | |
| The fact that identifiers are represented as ByteStrings is now an internal implentation detail in module GF.Infra.Ident. Conversion between ByteString and identifiers is only needed in the lexer and the Binary instances. | |||
| 2013-04-22 | a bit more informative error message in GrammarToPGF | kr.angelov | |
| 2013-02-12 | now the beam size for the statistical parser can be configured by using the ↵ | kr.angelov | |
| flag beam_size in the top-level concrete module | |||
| 2013-01-28 | Better error message for Predef.error | hallgren | |
| + Instead of "Internal error in ...", you now get a proper error message with a source location and a function name. + Also added some missing error value propagation in the partial evaluator. + Also some other minor cleanup and error handling fixes. | |||
| 2012-12-14 | The first prototype for exhaustive generation in the C runtime. The trees ↵ | kr.angelov | |
| are always listed in decreasing probability order. There is also an API for generation from Python | |||
| 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-12-02 | produce error message instead of failure of irrefutable pattern Ok ty_C in ↵ | aarne | |
| GrammarToPGF, to help find compilation errors; the ones I've found are because an inherited abstract excludes something that the inherited concrete does not exclude. | |||
| 2012-08-29 | A basic infrastructure for generating Teyjus bytecode from the GF abstract ↵ | kr.angelov | |
| syntax | |||
| 2012-01-14 | sorted the list of funs and cats in GrammatToPGF to get the predef ↵ | aarne | |
| categories in proper place and get gr, ai, gt work properly | |||
| 2011-11-24 | now if some module is compiled with -no-pmcfg then the PMCFG code is ↵ | kr.angelov | |
| generated at the end during the linking phase. Now the default compilation of the libraries with cabal is with -no-pmcfg. | |||
| 2011-11-14 | bugfix in the new PGF generation | 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-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 | GrammarToPGF.hs: comment out unused imports | hallgren | |
| 2011-03-12 | make later flags take priority over earlier ones in PGF generation | aarne | |
| 2010-11-12 | operations in the abstract syntax | krasimir | |
| 2010-10-02 | refactor the API for random generation again. Now PGF contains probabilities ↵ | krasimir | |
| in the abstract syntax | |||
| 2010-07-01 | reorganize the modules in GF.Compile.* | krasimir | |
| 2010-06-30 | compilation of pattern matching using the algorithm of Lennart Augustsson. ↵ | krasimir | |
| Not used yet | |||
| 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-05-28 | refactoring in GF.Grammar.Grammar | 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 | 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 | pattern @ should be propagated to PGF | krasimir | |
| 2010-03-18 | syntax for inaccessible patterns in GF | krasimir | |
| 2010-02-16 | no need to keep the list of constructors per category in .gfo | krasimir | |
| 2010-02-05 | bugfix in GrammarToPGF related to the compilation of def rules | krasimir | |
| 2010-01-31 | refactor GF.Infra.Modules for better error messages | krasimir | |
| 2010-01-29 | bugfix in the PGF typechecker and more test cases | krasimir | |
| 2010-01-27 | cleanup the code of the PGF interpreter and polish the binary serialization ↵ | krasimir | |
| to match the preliminary specification | |||
| 2010-01-26 | fix the PGF generation when it is used from the shell | krasimir | |
| 2010-01-17 | PGF is now real synchronous PMCFG | krasimir | |
| 2010-01-17 | now the linearization is completely based on PMCFG | krasimir | |
| 2010-01-17 | prettier parameter names in PGF | krasimir | |
| 2010-01-05 | printnames are now kept as String instead of Term in PGF | krasimir | |
| 2009-12-16 | one step deeper into records in PGF generation | aarne | |
| 2009-12-14 | remove the old parsing code and the -erasing=on flag | krasimir | |
| 2009-12-14 | rename some modules that had GFCC in the name to PGF+something | krasimir | |
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |