summaryrefslogtreecommitdiff
path: root/src/runtime/c/pgf
AgeCommit message (Collapse)Author
2013-11-22bugfix in the debug mode for the parserkr.angelov
2013-11-21bugfix in the C runtimekr.angelov
2013-11-20fix in the Python bindingkr.angelov
2013-11-18bugfix in the robust parserkr.angelov
2013-11-15fixes in the C runtime to avoid warnings when compiling on MacOSkr.angelov
2013-11-15pgf_read should open the grammar file in binary mode to prevent the Windows ↵kr.angelov
runtime from messing up the content.
2013-11-15pgf_reader_done should do nothing if the reading has failedkr.angelov
2013-11-13bugfix in the C runtime which had made the parser up to 200 times slower for ↵kr.angelov
some sentences
2013-11-12added Predef.SOFT_BIND. This special token allows zero or more spaces ↵kr.angelov
between ordinary tokens. It is also used in the English RGL to attach the commas to the previous word.
2013-11-07factor of 3 speedup for the translation without slowing down the grammar ↵kr.angelov
loading. The parser still seems to be 8 times slower than before I introduced the BIND. At least the Android UI now feels a lot more comfortable
2013-11-07fix for the memory allocation in the jitter which should work for Windows.kr.angelov
2013-11-06fix in the parsing with prekr.angelov
2013-11-06the content of ParseEngAbs3.probs is now merged with ParseEngAbs.probs. The ↵kr.angelov
later is now retrained. Once the grammar is compiled with the .probs file now it doesn't need anything more to do robust parsing. The robustness itself is controlled by the flags 'heuristic_search_factor', 'meta_prob' and 'meta_token_prob' in ParseEngAbs.gf
2013-11-06when printing floating literals use %lg instead of %lf for better outputkr.angelov
2013-11-04fix the debug mode of the JIT compiler after the refactoring in libgukr.angelov
2013-11-04A simple type checker in the C runtime. Dependent types are not supported ↵kr.angelov
yet but HOAS is implemented. The API is accessible from Python as well
2013-11-04bug fix in the linearizerkr.angelov
2013-11-02linearization for HOAS trees. It should word but we need a type checker in ↵kr.angelov
order to test it properly
2013-11-01fix the parseval metric after the redesign in the C runtimekr.angelov
2013-11-01bugfix in the linearizerkr.angelov
2013-11-01fix the robust parser for unknown tokenskr.angelov
2013-11-01bugfix in linearizer.ckr.angelov
2013-11-01remove the include to mman.h in jit.c since it doesn't seem to be usedkr.angelov
2013-10-31bracketedLinearize in Python is now using the linrefkr.angelov
2013-10-30use linref in the C linearizer. The robust linearization is now fully supportedkr.angelov
2013-10-30fix the debug mode in the linearizer after the refactoring in libgukr.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-23tabular linearization in the C and Java runtimeskr.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-08bugfix in GNU lightning for ARMkr.angelov
2013-10-07fix the grammar printer after the change of GuString in libgukr.angelov
2013-10-04suppress warning in graphviz.ckr.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-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-30fix the graphviz visualization after the introduction of nonExist and BINDkr.angelov
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-26remove pgf/edsl.h from the C runtimekr.angelov
2013-09-25fix the debug mode of the parser after the refactoring in libgukr.angelov
2013-09-25added assertion in the JIT compiler which checks that we are not going ↵kr.angelov
outside of the compilation window
2013-09-18the PGF reader now releases strings that are not used after the loadingkr.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