3 Commits

Author	SHA1	Message	Date
kr.angelov	d553cb165a	Now there is a just-in-time compiler which generates native code for proof search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec.	2013-06-25 19:22:42 +00:00
kr.angelov	10ef298fa0	the grammar reader in the C runtime is completely rewritten and it doesn't use the generic programming API	2013-02-11 10:16:58 +00:00
kr.angelov	aa13090b66	started an official API to the C runtime	2012-12-12 11:25:58 +00:00