kr.angelov
|
1b791158af
|
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
|
3566143f37
|
improved error message in the Python binding
|
2013-05-31 09:13:16 +00:00 |
|
kr.angelov
|
d66dfe13c2
|
a simple refactoring in the Python runtime
|
2013-05-29 11:02:18 +00:00 |
|
kr.angelov
|
fac39a78fe
|
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
|
78aab96369
|
fix the encoding problem with unicode literals in the Python binding
|
2013-05-21 10:53:20 +00:00 |
|
kr.angelov
|
f9f0fdcdf8
|
bugfix for bracketedLinearize which was causing crash if the tree cannot be linearized
|
2013-05-07 08:35:33 +00:00 |
|
kr.angelov
|
561e478ed4
|
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
|
9cdd96363a
|
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
|
15fd8b15ab
|
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
|
2a0c69a412
|
added API for computing bracketed strings from Python and C
|
2013-04-18 13:37:09 +00:00 |
|
kr.angelov
|
a6b35a9053
|
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
|
e9b5557c6c
|
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
|
87545f3f83
|
bugfix in the reference counting for Python
|
2013-01-29 09:41:12 +00:00 |
|
kr.angelov
|
d4717d533a
|
the Python binding is in pure C again
|
2013-01-29 09:20:32 +00:00 |
|
kr.angelov
|
66282bfcb7
|
added an API for composing and decomposing abstract trees from Python
|
2013-01-29 09:07:41 +00:00 |
|
kr.angelov
|
1723d8637c
|
fixed typos in the python binding: in a few places pgf_ExprType was used instead of pgf_ExprIterType
|
2013-01-29 09:06:23 +00:00 |
|
gregoire.detrez
|
459a9a855b
|
Python binding: add a parsing function that accepts directly a list of tokens.
Is allows to define a tokenizer in python (or use an existing one, from nltk for instance.)
|
2013-01-24 13:31:34 +00:00 |
|
kr.angelov
|
79bf7056f2
|
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
|
b367dfd80f
|
a bit more flexible API for parsing in Python
|
2012-12-14 16:00:52 +00:00 |
|
kr.angelov
|
8aefd1e072
|
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
|
6bc32db1c3
|
added simple error handling in the Python test
|
2012-12-13 16:44:39 +00:00 |
|
kr.angelov
|
81428c768c
|
added a simple test for the Python binding
|
2012-12-13 16:19:56 +00:00 |
|
kr.angelov
|
cc7ea9260b
|
an initial API for parsing and linearization from Python
|
2012-12-13 15:39:07 +00:00 |
|
kr.angelov
|
162fd5e512
|
an initial Python binding to the C runtime
|
2012-12-12 11:29:39 +00:00 |
|