summaryrefslogtreecommitdiff
path: root/src/runtime/c/pgf/data.h
AgeCommit message (Collapse)Author
2013-10-30added the linref construction in GF. The PGF version number is now bumpedkr.angelov
2013-10-28fix the handling of 'pre' in the C runtimekr.angelov
2013-10-23tabular linearization in the C and Java runtimeskr.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-10-03the symbol for nonExist in the GF runtime should be the last. this ↵kr.angelov
simplifies the binary search in the C runtime
2013-09-27a major refactoring in the C and the Haskell runtimes. Note incompatible ↵kr.angelov
change in the PGF format!!! The following are the outcomes: - Predef.nonExist is fully supported by both the Haskell and the C runtimes - Predef.BIND is now an internal compiler defined token. For now it behaves just as usual for the Haskell runtime, i.e. it generates &+. However, the special treatment will let us to handle it properly in the C runtime. - This required a major change in the PGF format since both nonExist and BIND may appear inside 'pre' and this was not supported before.
2013-09-17a major refactoring in the C runtime. GuList is now removed and replaced ↵kr.angelov
with GuSeq. The GuSeq/GuBuf API is simplified
2013-09-13remove leftcorner_cat_idx which is now redundantkr.angelov
2013-08-23nonExist now does the expected thingkr.angelov
2013-06-26we no longer maintain an explicit list of functions per category since now ↵kr.angelov
it is implicitly kept in the JIT compiled code
2013-06-25Now there is a just-in-time compiler which generates native code for proof ↵kr.angelov
search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec.
2013-04-26finally the statistical parser is able to return all possible abstract treeskr.angelov
2013-04-18added API for computing bracketed strings from Python and Ckr.angelov
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-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-19a major reimplementation of the linearizer in the C runtimekr.angelov
2012-12-13a top-level API for parsing in the C runtimekr.angelov
2012-12-11bugfix for robust parsing with multi-word unitskr.angelov
2012-10-25a major refactoring in the robust parser: bottom-up filtering and garbage ↵kr.angelov
collection for the chart
2012-09-18the C runtime now has a type prob_t which is used only for probability valueskr.angelov
2012-09-06bugfix in the C parserkr.angelov
2012-06-13Use a separated tag for meta productions in the robust parser. This cleans ↵kr.angelov
up the code a lot
2012-06-12now there is a limit of 2000000 items in the chart of the robust parser. ↵kr.angelov
This prevents from explosion in the memory size but it will also prevent us from parsing some sentences.
2012-06-12now the robust parser is purely top-down and the meta rules compete on a ↵kr.angelov
fair basis with the grammar rules
2012-05-16another attempt to port the robust parser to MacOSkr.angelov
2012-05-08a new unbiased statistical parser. it is still far from perfect use it on ↵kr.angelov
your own risk.
2012-04-12some fixes in the robust parser and a new API for literalskr.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-07libpgf: implementation for built in literal categorieskr.angelov
2012-03-05libpgf: now all concrete functions and categories are explicitly linked to ↵kr.angelov
their abstract counter parts
2012-02-29libpgf: the first prototype for the robust parserkr.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-21libpgf: added index for fast lexicon lookup. Still not perfectkr.angelov
2012-02-18libpgf: remove the now redundant field extra_ccats in PgfConcrkr.angelov
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-02-17libpgf: simplify the loading of PgfCncCatkr.angelov
2012-01-24libpgf: few fixes to make the loading of grammars with def rules possiblekr.angelov
2012-01-23libpgf: debugging framework for the parserkr.angelov
2012-01-23libpgf: move the lindefs field from PgfCncCat to PgfCCat. display the list ↵kr.angelov
in the grammar printout
2012-01-21added an API for printing the PGF to human readable formatkr.angelov
2012-01-20initial import of the C runtimekr.angelov
2010-06-16grammar loader and unloader in C. Abstract Syntax only!krasimir
generated by cgit v1.2.3 (git 2.39.1) at 2026-06-19 02:28:13 +0000