gf-core.git/src/runtime/c/pgf/reader.h, branch master Unnamed repository; edit this file 'description' to name the repository. https://git.adelon.net/gf-core.git/atom?h=master 2017-04-19T09:34:23+00:00 explicitly classify all functions in libpgf as either internal or API functions 2017-04-19T09:34:23+00:00 krasimir krasimir@chalmers.se 2017-04-19T09:34:23+00:00 urn:sha1:7d72d99c2f7fc228d71df627a10a2ff776335b2b merge the states for reasoning and evaluation into a single structure 2015-07-03T11:53:52+00:00 krasimir krasimir@chalmers.se 2015-07-03T11:53:52+00:00 urn:sha1:b3680b60258372baa1d5e606026760ef223641b9 the orthographic tokens were broken when they appear inside a dictionary entry. Now this is fixed by treating those as syntactic rules 2015-06-12T13:03:19+00:00 krasimir krasimir@chalmers.se 2015-06-12T13:03:19+00:00 urn:sha1:e352742b8c8c2d60e328e9bbe25263aa6ccef293 fix in reader.h for compiling jpgf.c 2014-09-30T11:25:27+00:00 kr.angelov kr.angelov@gmail.com 2014-09-30T11:25:27+00:00 urn:sha1:f25b45e13d4f3a8b1a751896bc0fbf3e82e22eab now a complete JIT compiler and ByteCode compiler for the def rules in the abstract syntax. there might be some bugs yet to be found, meta variables and computation under lambda is only partially supported 2014-09-25T10:35:06+00:00 kr.angelov kr.angelov@gmail.com 2014-09-25T10:35:06+00:00 urn:sha1:14e6eec5ecdd9ca68a891dbf7173a3620f6e76c1 a partial support for def rules in the C runtime 2014-08-11T10:59:10+00:00 kr.angelov kr.angelov@gmail.com 2014-08-11T10:59:10+00:00 urn:sha1:584d589041f63fdd3ea777019679275657902c2d 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. loading and unloading of languages in the C runtime and in the Python bindings 2013-12-10T15:00:52+00:00 kr.angelov kr.angelov@gmail.com 2013-12-10T15:00:52+00:00 urn:sha1:0ece8f19abf4dba1d3c568aca60d2c960d75efa6 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-25T19:22:42+00:00 kr.angelov kr.angelov@gmail.com 2013-06-25T19:22:42+00:00 urn:sha1:d553cb165a5dd02c8d27e88a196e0e6b15cf389b the grammar reader in the C runtime is completely rewritten and it doesn't use the generic programming API 2013-02-11T10:16:58+00:00 kr.angelov kr.angelov@gmail.com 2013-02-11T10:16:58+00:00 urn:sha1:10ef298fa00bd100bc854c5c8570a550f470dde4 started an official API to the C runtime 2012-12-12T11:25:58+00:00 kr.angelov kr.angelov@gmail.com 2012-12-12T11:25:58+00:00 urn:sha1:aa13090b66d7ee1ffc68ad242c6419a83cf364d9