summaryrefslogtreecommitdiff
path: root/src/runtime/c/utils/pgf-parse.c
AgeCommit message (Collapse)Author
2017-01-26bring the Haskell binding a bit closer to the pure Haskell APIkrasimir
2014-12-16change in the API for literalskr.angelov
The API in the C runtime as well as in the Haskell, Python and Java binding is changed. Now instead of adding the literal callbacks to the concrete syntax you need to supply them every time when you need to parse. The main reason is: - referentially transparent API for Haskell - when we start using memory mapped files we will not be allowed to change anything in the grammar data structures. At that point the old API would be impossible to use.
2014-11-27remove pgf/parser.hkr.angelov
2014-10-24fix memory leak in the pgf-parse toolkr.angelov
2014-10-09throw away the long obsolete runtime type information in the C runtimekr.angelov
2013-11-02remove the include of lexer.h from pgf-parsekr.angelov
2013-10-09a major redesign in the C runtime. The parser and the linearizer now fully ↵kr.angelov
support BIND. The following things are still broken: parseval, word completion, handling 'pre', the robust mode
2013-10-04GuString is now an ordinary C string - it makes live easier. In addition ↵kr.angelov
PgfSymbolKS, PgfExprFun and PgfLiteralStr now keep their strings as embedded flexible arrays. The latest change gives us the same compactness as the old representation but it is a lot easier to use.
2013-09-26remove pgf/edsl.h from the C runtimekr.angelov
2013-09-12remove the logging from libgukr.angelov
2013-09-05remove the read and write modules from libgu. this simplifies the i/o layerkr.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-26patch for adjustable heuristics from Pythonkr.angelov
2013-05-07bug fix in the management of memory pools in the statistical parserkr.angelov
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-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-08fix warnings in pgf-parse.ckr.angelov
2013-01-08New PGF utility: pgf-parsepeter.ljunglof