summaryrefslogtreecommitdiff
path: root/src/runtime/c/pgf/pgf.c
AgeCommit message (Collapse)Author
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-26finally the statistical parser is able to return all possible abstract treeskr.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-11refactoring: now all named objects in the C runtime have an explicit name fieldkr.angelov
2013-02-11remove the pgf2yaml tool which was both broken and redundant. The ↵kr.angelov
declarations for generic programming from data.c are removed as well
2013-02-11the grammar reader in the C runtime is completely rewritten and it doesn't ↵kr.angelov
use the generic programming API
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-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-07a new reasoner in the C runtime. It supports tabling which makes it ↵kr.angelov
decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
2012-12-19rename linearize.{h/c} to linearizer.{h/c} which follows the convention used ↵kr.angelov
in parser.c and reasoner.c
2012-12-13a top-level API for parsing in the C runtimekr.angelov
2012-12-12started an official API to the C runtimekr.angelov