9 Commits

Author	SHA1	Message	Date
kr.angelov	426bc49a52	a major refactoring in the C and the Haskell runtimes. Note incompatible change in the PGF format!!! ... The following are the outcomes: - Predef.nonExist is fully supported by both the Haskell and the C runtimes - Predef.BIND is now an internal compiler defined token. For now it behaves just as usual for the Haskell runtime, i.e. it generates &+. However, the special treatment will let us to handle it properly in the C runtime. - This required a major change in the PGF format since both nonExist and BIND may appear inside 'pre' and this was not supported before.	2013-09-27 15:09:48 +00:00
aarne	191ecc71b8	command option ma -known to drop unknown words	2012-06-10 10:43:57 +00:00
aarne	7445e56387	a simple clitic analysis command 'ca'	2011-02-06 16:19:24 +00:00
krasimir	7d58efb660	optimization in the parser for large lexicons. Now, the parser is slightly slower for grammars with a small lexicon but 3-4 times faster for the English Resource Grammar used in combination with Oxford Advanced Learners Dictionary	2010-12-14 08:46:22 +00:00
aarne	e056cc2bfd	in example-based grammar conversion, warnings about unknown words	2010-01-28 10:06:16 +00:00
krasimir	890d455793	cleanup the code of the PGF interpreter and polish the binary serialization to match the preliminary specification	2010-01-27 09:39:14 +00:00
krasimir	9b362ff231	PGF is now real synchronous PMCFG	2010-01-17 21:35:36 +00:00
krasimir	af13bae2df	now the linearization is completely based on PMCFG	2010-01-17 17:05:21 +00:00
krasimir	f85232947e	reorganize the directories under src, and rescue the JavaScript interpreter from deprecated	2009-12-13 18:50:29 +00:00