26 Commits

Author	SHA1	Message	Date
kr.angelov	478b46be87	typos in the documentation for the Python binding	2013-06-27 10:11:49 +00:00
kr.angelov	155afdf9b7	a complete Python API for reading, printing and manipulation of abstract trees and types. This includes dependent types, high-order abstract syntax and implicit arguments	2013-06-27 09:39:15 +00:00
kr.angelov	f4f76e4638	dummy compute function in the Python binding	2013-06-26 10:36:42 +00:00
kr.angelov	3c2d1890d0	patch for adjustable heuristics from Python	2013-06-26 07:36:03 +00:00
kr.angelov	f8073ea1cd	fíx in the Python binding for compatibility with Python<2.7	2013-06-19 19:31:55 +00:00
kr.angelov	0ad4c9bf65	fix an issue in the Python binding related to the 32 vs 64 bit compatibility	2013-06-19 18:47:52 +00:00
kr.angelov	b0b4f57775	bugfix in the python binding	2013-06-14 07:02:53 +00:00
kr.angelov	54a0642bee	now the call Expr.unpack("? e1 e2") in Python returns a pair with None as the first element and a the list [e1,e2] as the second. This makes it easier to decompose partial abstract trees	2013-05-31 09:24:15 +00:00
kr.angelov	1ce5fa3663	improved error message in the Python binding	2013-05-31 09:13:16 +00:00
kr.angelov	739b10f2a8	a simple refactoring in the Python runtime	2013-05-29 11:02:18 +00:00
kr.angelov	43bffd3f7d	readPGF in the Python runtime now throws "No such file or directory" exception if the grammar is missing	2013-05-29 10:49:56 +00:00
kr.angelov	b7cbee7940	fix the encoding problem with unicode literals in the Python binding	2013-05-21 10:53:20 +00:00
kr.angelov	517b8ff1ee	bugfix for bracketedLinearize which was causing crash if the tree cannot be linearized	2013-05-07 08:35:33 +00:00
kr.angelov	7ba27229b3	the statistical parser is now using two memory pools: one for parsing and one for the output trees. This means that the memory for parsing can be released as soon as the needed abstract trees are retrieved, while the trees themselves are retained in the separate output pool	2013-05-06 15:28:04 +00:00
kr.angelov	22f44ef61f	word completion in the C runtime. The runtime/python/test.py example is now using readline with word completion	2013-05-01 06:09:55 +00:00
kr.angelov	542dcaa0ec	the C runtime and the Python binding now have an API for parser evaluation. The API computes PARSEVAL and Exact Match for a given tree. As a side effect the abstract trees in Python are now compared for equality by value and not by reference	2013-04-19 10:57:46 +00:00
kr.angelov	f050609101	added API for computing bracketed strings from Python and C	2013-04-18 13:37:09 +00:00
kr.angelov	6a36ce77ff	the class PgfConcr from the Python binding now has a property name which returns the name of the concrete syntax	2013-02-11 15:51:26 +00:00
kr.angelov	5e2474e346	This patch removes Gregoire's parse_tokens function in the python binding and adds another implementation which builds on the existing API for lexers in the C runtime. Now it is possible to write incremental Lexers in Python	2013-02-01 09:29:43 +00:00
kr.angelov	84fa796de4	bugfix in the reference counting for Python	2013-01-29 09:41:12 +00:00
kr.angelov	05cb74d14a	the Python binding is in pure C again	2013-01-29 09:20:32 +00:00
kr.angelov	9b78da5357	now the Python binding has an alternative representation for abstract trees which is composed of Python objects. The new representation is not integrated with the core runtime yet	2013-01-07 15:11:12 +00:00
kr.angelov	8ec7ecacca	a bit more flexible API for parsing in Python	2012-12-14 16:00:52 +00:00
kr.angelov	20aaa4a989	The first prototype for exhaustive generation in the C runtime. The trees are always listed in decreasing probability order. There is also an API for generation from Python	2012-12-14 15:32:49 +00:00
kr.angelov	836b953b9d	an initial API for parsing and linearization from Python	2012-12-13 15:39:07 +00:00
kr.angelov	0891ef3f0f	an initial Python binding to the C runtime	2012-12-12 11:29:39 +00:00