hallgren 1bba23991f Compute/ConcreteNew.hs: adding a Prawitz rewrite ...

(table { p_i => t_i } ! x).l ==> table { p_i => t_i.l } ! x

This was used in the old partial evaluator and can significantly reduce term
sizes in some cases.

2014-05-16 21:27:20 +00:00

..

Compute

Compute/ConcreteNew.hs: adding a Prawitz rewrite

2014-05-16 21:27:20 +00:00

TypeCheck

TypeCheck.RConcrete: contravariance in table types

2014-04-04 16:50:12 +00:00

CFGtoPGF.hs

refactor the compilation of CFG and EBNF grammars. Now they are parsed by using GF.Grammar.Parser just like the ordinary GF grammars. Furthermore now GF.Speech.CFG is moved to GF.Grammar.CFG. The new module is used by both the speech conversion utils and by the compiler for CFG grammars. The parser for CFG now consumes a lot less memory and can be used with grammars with more than 4 000 000 productions.

2014-03-21 21:25:05 +00:00

CheckGrammar.hs

experimental type checker module GF.Compile.TypeCheck.RConcrete.hs with record updates enabled by ** expressions. Can be changed back to Concrete.hs by just changing one import command in GF.Compile.CheckGrammar.hs. The worst thing that *should* happen with the new type checker is that some old code is detected to be invalid, which happens if it contains a type-incompatible record extension, e.g. {x = "foo"} ** {x = 1}. Previously such errors were silently ignored. A set of test runs detected one such error in the RGL, which was corrected. On the positive side, the new type checker now enables record updates in the natural way: R ** {x = 1} will give value x = 1 overshadowing any value of x in R (provided the expected type of x is Int). lib/src/experimental/PredicationSwe.gf illustrates this, as opposed to PredicationSwO.gf which has to use old-style copying of even the unchanged record fields.

2014-01-31 20:28:25 +00:00

Coding.hs

GFI: adapt to character encoding changes

2013-11-28 13:55:08 +00:00

ExampleBased.hs

Eliminate mutual dependencies between the GF compiler and the PGF library

2013-11-05 13:11:10 +00:00

Export.hs

Eliminate mutual dependencies between the GF compiler and the PGF library

2013-11-05 13:11:10 +00:00

GenerateBC.hs

catch all case in GenerateBC.genFun

2012-09-18 08:32:21 +00:00

GeneratePMCFG.hs

Fix an eta expansion bug in the grammar compiler

2014-05-16 14:10:07 +00:00

GetGrammar.hs

refactor the compilation of CFG and EBNF grammars. Now they are parsed by using GF.Grammar.Parser just like the ordinary GF grammars. Furthermore now GF.Speech.CFG is moved to GF.Grammar.CFG. The new module is used by both the speech conversion utils and by the compiler for CFG grammars. The parser for CFG now consumes a lot less memory and can be used with grammars with more than 4 000 000 productions.

2014-03-21 21:25:05 +00:00

GrammarToPGF.hs

Represent identifiers as UTF-8-encoded ByteStrings

2013-11-26 16:12:03 +00:00

Instructions.hs

Eliminate mutual dependencies between the GF compiler and the PGF library

2013-11-05 13:11:10 +00:00

ModDeps.hs

merge GF.Infra.Modules and GF.Grammar.Grammar. This is a preparation for the separate PGF building

2011-11-02 13:57:11 +00:00

Multi.hs

format .gfm for multiple modules in the same file; includes lines with ;-separated words

2010-11-30 14:50:24 +00:00

Optimize.hs

bugfix in the compiler for linref of empty record

2014-03-15 11:33:54 +00:00

PGFtoHaskell.hs

Eliminate mutual dependencies between the GF compiler and the PGF library

2013-11-05 13:11:10 +00:00

PGFtoJS.hs

added Predef.SOFT_BIND. This special token allows zero or more spaces between ordinary tokens. It is also used in the English RGL to attach the commas to the previous word.

2013-11-12 09:54:57 +00:00

PGFtoLProlog.hs

the content of ParseEngAbs3.probs is now merged with ParseEngAbs.probs. The 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-06 10:21:46 +00:00

PGFtoProlog.hs

the content of ParseEngAbs3.probs is now merged with ParseEngAbs.probs. The 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-06 10:21:46 +00:00

PGFtoPython.hs

PGFtoPython: add Python translations for nonExist, BIND and SOFT_BIND

2013-12-18 15:31:39 +00:00

ReadFiles.hs

GF.Compile.ReadFiles: reduced code duplication

2013-12-16 14:04:57 +00:00

Refresh.hs

added the linref construction in GF. The PGF version number is now bumped

2013-10-30 12:53:36 +00:00

Rename.hs

disabled ad hoc overloading, as it still causes mysterious errors. It is just a few lines in Rename.hs

2014-02-09 19:55:17 +00:00

SubExOpt.hs

Introduce type RawIdent; only 9 imports of Data.ByteString.Char8 remain

2013-09-19 20:48:10 +00:00

Tags.hs

Reduced clutter in monadic code

2013-11-20 00:45:33 +00:00

ToAPI.hs

Remove PGF.Signature

2013-11-06 13:27:29 +00:00

Update.hs

Show relative file paths in error messages

2013-12-06 15:43:34 +00:00