summaryrefslogtreecommitdiff
path: root/src/runtime/c/pgf/parser.c
AgeCommit message (Collapse)Author
2013-11-01fix the robust parser for unknown tokenskr.angelov
2013-10-30use linref in the C linearizer. The robust linearization is now fully supportedkr.angelov
2013-10-30added the linref construction in GF. The PGF version number is now bumpedkr.angelov
2013-10-28another fix for 'pre'kr.angelov
2013-10-28fix the handling of 'pre' in the C runtimekr.angelov
2013-10-21bugfix for the custom literals in the C runtimekr.angelov
2013-10-09avoid warning in parser.c when debugging is OFFkr.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-08fix the robust parser after the change of GuStringkr.angelov
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-30better handling for nonExist in the C runtime. BIND is also supported in the ↵kr.angelov
linearizer but not in the parser yet
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-25fix the debug mode of the parser after the refactoring in libgukr.angelov
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-09-13minor optimization/refactoring in the grammar readerkr.angelov
2013-09-13the leftcorner indexing is now completely removed since it slowed down the ↵kr.angelov
loading without speeding up parsing a lot
2013-09-13fix the debug mode of the parser after the changes in the libgu APIkr.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-09-04remove the dependency on the HAVE_STATEMENT_EXPRESSIONS flag. This reduces ↵kr.angelov
the dependency on the ./configure script
2013-08-23nonExist now does the expected thingkr.angelov
2013-08-21fix in the C parserkr.angelov
2013-08-19word completion in the C runtime now returns multi-word expressions and the ↵kr.angelov
category for every expression
2013-08-19fullFormLexicon in C and Pythonkr.angelov
2013-08-16implemented lookupMorpho for C and Pythonkr.angelov
2013-07-03the parser in the C runtime now checks for duplicated resultskr.angelov
2013-06-27C runtime: fix the debug modes in the parser and in the reasoner after the ↵kr.angelov
changes in the printer
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-05-05fix the leftcorner filtering after the addition of word completionkr.angelov
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-03-20the calculation of lexical_prob in the statistical parser doesn't work ↵kr.angelov
properly. It should be fixed but for now I just disabled the optimization
2013-03-20replace #if with #ifdef when checking for the optional bottom up filtering ↵kr.angelov
in the C runtime
2013-03-19the bottom up filtering in the C runtime is temporary disabled. It takes too ↵kr.angelov
much memory and even makes it impossible to load the Finnish and the German parsing grammars.
2013-03-11bugfix in the statistical parserkr.angelov
2013-02-19the parser in the C runtime should not crash if the start category is not ↵kr.angelov
defined
2013-02-12now the beam size for the statistical parser can be configured by using the ↵kr.angelov
flag beam_size in the top-level concrete module
2013-02-12the statistical parser now uses a baseline lexical estimation of the beam sizekr.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
2012-12-19bugfix for linearization of metavariables at the root of a treekr.angelov
2012-12-19a major reimplementation of the linearizer in the C runtimekr.angelov
2012-12-13bugfix: the outside probability of a PgfItemConts must always be initialized ↵kr.angelov
to zero
2012-12-11bugfix for robust parsing with multi-word unitskr.angelov
2012-12-03added experimental script for chunking in the C runtimekr.angelov
2012-11-19remove the duplicated definition of PgfProductionIdx in parser.ckr.angelov
2012-11-16bugfix for the building of bottom-up filter in the C runtimekr.angelov
2012-11-14revised heuristic in the statistical parserkr.angelov
generated by cgit v1.2.3 (git 2.39.1) at 2026-06-06 07:08:32 +0000