summaryrefslogtreecommitdiff
path: root/src/runtime/c/pgf/parser.c
AgeCommit message (Collapse)Author
2012-04-02simple cleanup in the robust parserkr.angelov
2012-03-12libpgf: a new implementation for literals which also allows custom literals. ↵kr.angelov
the same mechanism is now used for the metavariables
2012-03-09libpgf: added simple lexerkr.angelov
2012-03-07libpgf: implementation for built in literal categorieskr.angelov
2012-03-07libpgf: simple fix in the parser debuggerkr.angelov
2012-03-07libpgf: two APIs - one for finding all parse results and another for finding ↵kr.angelov
the best parse result
2012-03-05libpgf: now all concrete functions and categories are explicitly linked to ↵kr.angelov
their abstract counter parts
2012-03-02libpgf: preliminary version for the statistical ranking. we use naive ↵kr.angelov
statistical model with random weight for the meta variables.
2012-02-29libpgf: the first prototype for the robust parserkr.angelov
2012-02-28libpgf: another fix in the parser debuggerkr.angelov
2012-02-28libpgf: fix in the parser debuggerkr.angelov
2012-02-22libpgf: now we have both complete bottom up index for robust parsing and ↵kr.angelov
fast lexical lookup from the same index
2012-02-22libpgf: two small fixes in the parser debuggerkr.angelov
2012-02-21libpgf: added index for fast lexicon lookup. Still not perfectkr.angelov
2012-02-18libpgf: now the debugging mode for the parser is available only with ↵kr.angelov
compilation option.
2012-02-18libpgf: now the linearization index is created during the grammar loading ↵kr.angelov
which also makes the types PgfLzr and PgfParser redundant.
2012-01-26libpgf: switch to using callbacks and lazy prediction in the parser. this ↵kr.angelov
reduce the parsing time from 11 sec down to 3 sec.
2012-01-26libpgf: use a temporal pool for allocating the arrays in the continuation ↵kr.angelov
map of the parser
2012-01-23libpgf: debugging framework for the parserkr.angelov
2012-01-20initial import of the C runtimekr.angelov