| Age | Commit message (Collapse) | Author |
|
returns the name of the concrete syntax
|
|
|
|
declarations for generic programming from data.c are removed as well
|
|
use the generic programming API
|
|
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
|
|
|
|
|
|
|
|
|
|
|
|
instead of pgf_ExprIterType
|
|
Is allows to define a tokenizer in python (or use an existing one, from nltk for instance.)
|
|
|
|
|
|
|
|
|
|
which is composed of Python objects. The new representation is not integrated with the core runtime yet
|
|
decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
|
|
|
|
sentence
|
|
|
|
in parser.c and reasoner.c
|
|
|
|
|
|
|
|
|
|
|
|
|
|
are always listed in decreasing probability order. There is also an API for generation from Python
|
|
terminate with whitespace
|
|
|
|
|
|
|
|
|
|
to zero
|
|
abstract expression
|
|
|
|
|
|
|
|
|
|
|
|
Note that some of the graphviz functions have backwards incompatible changes
that might also affect other clients of the PGF run-time library.
Also added graphvizDefaults and export it together with GraphvizOptions from
the PGF run-time library.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
times.
|
|
|