| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2012-08-29 | Emacs only recognizes utf-8, not UTF-8, in file headers | peter.ljunglof | |
| 2012-08-29 | A basic infrastructure for generating Teyjus bytecode from the GF abstract ↵ | kr.angelov | |
| syntax | |||
| 2012-08-01 | the first draft of GF.Compile.Instructions | kr.angelov | |
| 2012-07-02 | Minor changes in Python export | peter.ljunglof | |
| 2012-06-28 | Fixed minor bug in prolog export | peter.ljunglof | |
| 2012-06-27 | major changes to the prolog export | peter.ljunglof | |
| 2012-06-27 | cleanup in the python export | peter.ljunglof | |
| 2012-06-26 | Experiment with parallel grammar checks | hallgren | |
| Introduced the function parallelCheck :: [Check a] -> Check [a] that runs independent checks in parallel, potentially allowing faster grammar compilation on multi-core computers, if you run gf with +RTS -N. However, on my dual core laptop, this seems to slow down compilation somewhat even though CPU utilization goes up as high as 170% at times. (This is with GF compiled with GHC 7.0.4.) | |||
| 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 | GF.Compile.Rename: report many errors instead of stopping after the first one | hallgren | |
| Using accumulated errors in the Check monad. TODO: some errors are still not accumulated, but thanks to checkMapRecover at least one error per judgement is reported. | |||
| 2012-06-25 | Check monad: support for accumulated errors | hallgren | |
| In addition to warnings, the Check monad in GF.Infra.CheckM can now accumulate errors. There are two new functions checkAccumError: Message -> Check () accumulateError :: (a -> Check a) -> a -> Check a The former (with the same type as checkWarn) is used to report an accumulated (nonfatal) error. The latter converts fatal errors into accumulated errors. Accumulated errors are reported as regular errors by runCheck. Also, the Check monad type has been made abstract. | |||
| 2012-06-25 | Export PGF in Python format | peter.ljunglof | |
| 2012-06-25 | checkMapRecover: find undefined idents in all jments in Rename | aarne | |
| 2012-05-15 | missing case in partial evaluation of + fixed | aarne | |
| 2012-03-26 | Workaround for bug in ghc-7.2.2 | hallgren | |
| An apparent bug in ghc-7.2.2 causes the type Value to be exported from PGF.Data. Workaround: restrict the imports from PGF.Data in GF.Command.Abstract and GF.Compile.GeneratePMCFG to avoid the clash with locally defined type Value. (ghc-7.0.4 and ghc-7.4.1 appear to be free from this bug.) | |||
| 2012-02-28 | bug fix in AppPredefined: don't compare values that contain variables. this ↵ | aarne | |
| should be checked even more generally. | |||
| 2012-02-28 | buf fix in the compiler for HOAS | kr.angelov | |
| 2012-02-24 | the Predef function eqVal to compare equality of parameter values | aarne | |
| 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-12-02 | The typechecker is still unfinished but at least it can typecheck the ↵ | kr.angelov | |
| English resource grammar | |||
| 2011-11-30 | Hopefully complete Value type and a little bit more on computations. | 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-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-22 | make addSequencesB(V) strict. Otherwise we get stack overflow when compiling ↵ | kr.angelov | |
| LangFre | |||
| 2011-11-17 | rebuildModule should do location globalization too | kr.angelov | |
| 2011-11-17 | bugfix in the overload resolution. It was accidentally introduced as part of ↵ | kr.angelov | |
| the per module PMCFG generation | |||
| 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 errors messages from GF.Compile.Update also follow the new format | kr.angelov | |
| 2011-11-15 | the indirections in the .gf-tags files now point directly to the origin of ↵ | kr.angelov | |
| the corresponding indentifiers | |||
| 2011-11-15 | more structured format for errors and warnings from the compiler | kr.angelov | |
| 2011-11-14 | bugfix in the new PGF generation | 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-11-01 | Remove configuration flag cclazy | hallgren | |
| 2011-10-25 | Recording an alternative version of look in Compute/ConcreteLazy.hs | hallgren | |
| Commented out, causes problems in the greek example. | |||
| 2011-10-25 | qualification with real module name accepted, as in GF refman | aarne | |
| 2011-10-24 | use associativity to force more precompilation of pre expressions | aarne | |
| 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 | Compute/ConcreteLazy.hs: no need to reverse when looking up labels in records | hallgren | |
| 2011-10-20 | AppPredefined.hs: more readable notation for the types of primitives | hallgren | |
| 2011-09-09 | Remove unused function computeConcreteRec. | hallgren | |
| This also allows the parameter rec to be removed from function computeTermOpt. (The change is made in GF.Compile.Compute.ConcreteLazy, but not in GF.Compile.Compute.ConcreteStrict.) | |||
| 2011-09-01 | Add lazy version of GF.Compile.Compute.Concrete | hallgren | |
| This patch adds GF.Compile.Compute.ConcreteLazy, which replaces the Err monad with the Identity monad. While the Err monad makes the interpreter (hyper)strict, the Identity monad let's the interpreter inherit Haskell's laziness. This can give big speedups: from 50s to 1s in one example, from ~4 minutes to ~2 minutes for the RGL. This is still experimental and might be buggy, so it is off by default. You can turn it on by configuring with the -fcclazy flag, e.g. cabal configure -fcclazy Let me know if anything breaks. | |||
| 2011-08-31 | GF.Compile.Coding: cleaner code | hallgren | |
| Refine function codeTerm into codeTerm, codeLTerm and codeLTerms. | |||
| 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 | GrammarToPGF.hs: comment out unused imports | hallgren | |
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |