kr.angelov
|
8cf03bc5b6
|
a major redesign in the C runtime. The parser and the linearizer now fully support BIND. The following things are still broken: parseval, word completion, handling 'pre', the robust mode
|
2013-10-09 12:08:51 +00:00 |
|
kr.angelov
|
780ba65c25
|
remove pgf/edsl.h from the C runtime
|
2013-09-26 11:59:35 +00:00 |
|
kr.angelov
|
2a49e4e1d6
|
a major refactoring in the C runtime. GuList is now removed and replaced with GuSeq. The GuSeq/GuBuf API is simplified
|
2013-09-17 12:45:00 +00:00 |
|
kr.angelov
|
9c3dd1e1e1
|
remove the logging from libgu
|
2013-09-12 09:30:02 +00:00 |
|
kr.angelov
|
14f8b96b56
|
remove the string internalization since it slows down grammar loading with little benefit
|
2013-09-05 13:34:49 +00:00 |
|
kr.angelov
|
7c0bad5092
|
remove the read and write modules from libgu. this simplifies the i/o layer
|
2013-09-05 11:20:39 +00:00 |
|
kr.angelov
|
504341dfba
|
remove dump and yaml from libgu
|
2013-09-05 10:01:47 +00:00 |
|
kr.angelov
|
5337b4bef7
|
graphvizAbstractTree in the C and Python runtimes
|
2013-08-15 08:06:37 +00:00 |
|
kr.angelov
|
3c2d1890d0
|
patch for adjustable heuristics from Python
|
2013-06-26 07:36:03 +00:00 |
|
kr.angelov
|
d553cb165a
|
Now there is a just-in-time compiler which generates native code for proof 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-06-25 19:22:42 +00:00 |
|
kr.angelov
|
542dcaa0ec
|
the C runtime and the Python binding now have an API for parser evaluation. The API computes PARSEVAL and Exact Match for a given tree. As a side effect the abstract trees in Python are now compared for equality by value and not by reference
|
2013-04-19 10:57:46 +00:00 |
|
kr.angelov
|
90c3304147
|
remove the pgf2yaml tool which was both broken and redundant. The declarations for generic programming from data.c are removed as well
|
2013-02-11 13:51:12 +00:00 |
|
peter.ljunglof
|
599b51830f
|
New PGF utility: pgf-parse
|
2013-01-08 10:19:53 +00:00 |
|
kr.angelov
|
a28ccc965c
|
rename linearize.{h/c} to linearizer.{h/c} which follows the convention used in parser.c and reasoner.c
|
2012-12-19 09:17:24 +00:00 |
|
kr.angelov
|
20aaa4a989
|
The first prototype for exhaustive generation in the C runtime. The trees are always listed in decreasing probability order. There is also an API for generation from Python
|
2012-12-14 15:32:49 +00:00 |
|
kr.angelov
|
aa13090b66
|
started an official API to the C runtime
|
2012-12-12 11:25:58 +00:00 |
|
kr.angelov
|
e174f37940
|
added experimental script for chunking in the C runtime
|
2012-12-03 10:07:54 +00:00 |
|
kr.angelov
|
83b321d862
|
An initial import of the teyjus source code in the C runtime for GF. The two runtime are still not connected but the source code compiles.
|
2012-07-31 15:16:04 +00:00 |
|
kr.angelov
|
f4c17cb7aa
|
another attempt to port the robust parser to MacOS
|
2012-05-16 15:18:44 +00:00 |
|
kr.angelov
|
230f309317
|
libpgf: a new implementation for literals which also allows custom literals. the same mechanism is now used for the metavariables
|
2012-03-12 14:25:51 +00:00 |
|
kr.angelov
|
1726995921
|
libpgf: added simple lexer
|
2012-03-09 09:14:44 +00:00 |
|
kr.angelov
|
28bce1cdc0
|
added an API for printing the PGF to human readable format
|
2012-01-21 10:27:55 +00:00 |
|
kr.angelov
|
2eee382a62
|
initial import of the C runtime
|
2012-01-20 13:41:10 +00:00 |
|