gf-core.git - Unnamed repository; edit this file 'description' to name the repository.

Age	Commit message (Collapse)	Author
2021-07-07	Replace tabs for whitespace in source code	John J. Camilleri

2016-03-22	CFGtoPGF is now extended to support context-free grammars with primitive ↵	krasimir
	parameters
2016-03-21	bugfix: GF.Compile.CFGtoPGF now supports literal categories	krasimir

2015-02-16	Changes for compatibility with ghc-7.10-rc2	hallgren
	2 modules: Name clashes caused by Applicative-Monad change in Prelude 2 modules: Ambiguities caused by Foldable/Traversable in Prelude 2 modules: Backwards incompatible changes in time-1.5 for defaultTimeLocale 9 modules: {-# LANGUAGE FlexibleContexts #-} (because GHC checks inferred types now, in addition to explicitly given type signatures) Also silenced warnings about tab characters in source files.
2014-08-11	a partial support for def rules in the C runtime	kr.angelov
	The def rules are now compiled to byte code by the compiler and then to native code by the JIT compiler in the runtime. Not all constructions are implemented yet. The partial implementation is now in the repository but it is not activated by default since this requires changes in the PGF format. I will enable it only after it is complete.
2014-06-12	PGF library: expose only PGF and PGF.Internal instead of all modules	hallgren
	PGF exports the public, stable API. PGF.Internal exports additional things needed in the GF compiler & shell, including the nonstardard version of Data.Binary.
2014-05-24	now we compile context-free grammars directly to PGF without going via GF ↵	kr.angelov
	source code. This makes it quick and lightweight to compile big grammars such as the Berkley grammar
2014-03-21	refactor the compilation of CFG and EBNF grammars. Now they are parsed by ↵	kr.angelov
	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.