| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-02-01 | This 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-29 | bugfix in the reference counting for Python | kr.angelov | |
| 2013-01-29 | the Python binding is in pure C again | kr.angelov | |
| 2013-01-29 | added an API for composing and decomposing abstract trees from Python | kr.angelov | |
| 2013-01-29 | fixed typos in the python binding: in a few places pgf_ExprType was used ↵ | kr.angelov | |
| instead of pgf_ExprIterType | |||
| 2013-01-24 | Python 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-07 | now 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-14 | a bit more flexible API for parsing in Python | kr.angelov | |
| 2012-12-14 | The 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-13 | added simple error handling in the Python test | kr.angelov | |
| 2012-12-13 | added a simple test for the Python binding | kr.angelov | |
| 2012-12-13 | an initial API for parsing and linearization from Python | kr.angelov | |
| 2012-12-12 | an initial Python binding to the C runtime | kr.angelov | |
