summaryrefslogtreecommitdiff
path: root/src/runtime/python
AgeCommit message (Collapse)Author
2013-08-15graphvizAbstractTree in the C and Python runtimeskr.angelov
2013-07-05the hash function for pgf.Expr is now really addedkr.angelov
2013-06-27typos in the documentation for the Python bindingkr.angelov
2013-06-27a complete Python API for reading, printing and manipulation of abstract ↵kr.angelov
trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
2013-06-26dummy compute function in the Python bindingkr.angelov
2013-06-26patch for adjustable heuristics from Pythonkr.angelov
2013-06-19fíx in the Python binding for compatibility with Python<2.7kr.angelov
2013-06-19fix an issue in the Python binding related to the 32 vs 64 bit compatibilitykr.angelov
2013-06-14bugfix in the python bindingkr.angelov
2013-05-31now the call Expr.unpack("? e1 e2") in Python returns a pair with None as ↵kr.angelov
the first element and a the list [e1,e2] as the second. This makes it easier to decompose partial abstract trees
2013-05-31improved error message in the Python bindingkr.angelov
2013-05-29a simple refactoring in the Python runtimekr.angelov
2013-05-29readPGF in the Python runtime now throws "No such file or directory" ↵kr.angelov
exception if the grammar is missing
2013-05-21fix the encoding problem with unicode literals in the Python bindingkr.angelov
2013-05-07bugfix for bracketedLinearize which was causing crash if the tree cannot be ↵kr.angelov
linearized
2013-05-06the statistical parser is now using two memory pools: one for parsing and ↵kr.angelov
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-01word completion in the C runtime. The runtime/python/test.py example is now ↵kr.angelov
using readline with word completion
2013-04-19the C runtime and the Python binding now have an API for parser evaluation. ↵kr.angelov
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-18added API for computing bracketed strings from Python and Ckr.angelov
2013-02-11the class PgfConcr from the Python binding now has a property name which ↵kr.angelov
returns the name of the concrete syntax
2013-02-01This patch removes Gregoire's parse_tokens function in the python binding ↵kr.angelov
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-01-29bugfix in the reference counting for Pythonkr.angelov
2013-01-29the Python binding is in pure C againkr.angelov
2013-01-29added an API for composing and decomposing abstract trees from Pythonkr.angelov
2013-01-29fixed typos in the python binding: in a few places pgf_ExprType was used ↵kr.angelov
instead of pgf_ExprIterType
2013-01-24Python binding: add a parsing function that accepts directly a list of tokens.gregoire.detrez
Is allows to define a tokenizer in python (or use an existing one, from nltk for instance.)
2013-01-07now the Python binding has an alternative representation for abstract trees ↵kr.angelov
which is composed of Python objects. The new representation is not integrated with the core runtime yet
2012-12-14a bit more flexible API for parsing in Pythonkr.angelov
2012-12-14The first prototype for exhaustive generation in the C runtime. The trees ↵kr.angelov
are always listed in decreasing probability order. There is also an API for generation from Python
2012-12-13added simple error handling in the Python testkr.angelov
2012-12-13added a simple test for the Python bindingkr.angelov
2012-12-13an initial API for parsing and linearization from Pythonkr.angelov
2012-12-12an initial Python binding to the C runtimekr.angelov
generated by cgit v1.2.3 (git 2.39.1) at 2026-05-20 18:07:02 +0000