7 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
peter.ljunglof	b416f5bbf7	Use nub' instead of nub in some places, remove some unused nub imports	2012-08-29 21:48:34 +00:00
peter.ljunglof	a7de16c34b	Added an O(n log n) version of nub ... The new nub is called nub', and it replaces the old sortNub which was not lazy and did not retain the order between the elements.	2012-08-29 21:45:10 +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
krasimir	b0e110cf4f	native representation for HOAS in PMCFG and incremental type checking of the parse forest	2010-08-09 10:10:08 +00:00
krasimir	eb0bd54e68	rename isLiteralFCat -> isPredefFId, fcat(String|Int|Float) -> fid(String|Int|Float)	2010-06-30 07:40:22 +00:00
krasimir	d6f32b3bcd	dead code elimination for PGF. Note: the produced grammars will not work well with metavariables and high-order abstract syntax	2010-06-09 11:32:59 +00:00