gf-core

2013-06-26 07:03:32 +00:00

data.c

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

data.h

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

edsl.h

initial import of the C runtime

2012-01-20 13:41:10 +00:00

expr.c

fix the encoding problem with unicode literals in the Python binding

2013-05-21 10:53:20 +00:00

expr.h

fix the encoding problem with unicode literals in the Python binding

2013-05-21 10:53:20 +00:00

jit.c

compatibility issue for MacOS X

2013-06-26 07:03:32 +00:00

lexer.c

This patch removes Gregoire's parse_tokens function in the python binding and adds another implementation which builds on the existing API for lexers in the C runtime. Now it is possible to write incremental Lexers in Python

2013-02-01 09:29:43 +00:00

lexer.h

word completion in the C runtime. The runtime/python/test.py example is now using readline with word completion

2013-05-01 06:09:55 +00:00

lightning.h

add the source code for GNU lightning in the source directory for the C runtime

2013-06-17 07:26:00 +00:00

linearizer.c

bugfix for the linearizer in the C runtime

2013-06-24 07:56:42 +00:00

linearizer.h

added API for computing bracketed strings from Python and C

2013-04-18 13:37:09 +00:00

literals.c

the statistical parser is now using two memory pools: one for parsing and 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-06 15:28:04 +00:00

literals.h

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

parser.c

bug fix in the management of memory pools in the statistical parser

2013-05-07 08:30:32 +00:00

parser.h

bug fix in the management of memory pools in the statistical parser

2013-05-07 08:30:32 +00:00

parseval.c

bug fix in the management of memory pools in the statistical parser

2013-05-07 08:30:32 +00:00

pgf.c

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

pgf.h

the statistical parser is now using two memory pools: one for parsing and 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-06 15:28:04 +00:00

printer.c

bugfix for the grammar printer in the C runtime

2013-05-30 20:20:02 +00:00

reader.c

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

reader.h

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

reasoner.c

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