 kr.angelov
|
795df19bfe
|
provide API to access the language code for the concrete language
|
2013-08-16 12:54:16 +00:00 |
|
|
kr.angelov
|
b08925fd3d
|
fixes in the C and Python API to make them closer to the Haskell API
|
2013-08-16 12:44:37 +00:00 |
|
|
kr.angelov
|
2fc9294f6e
|
added graphvizParseTree in the C and Python runtimes
|
2013-08-15 15:10:28 +00:00 |
|
|
kr.angelov
|
0496dec923
|
graphvizAbstractTree in the C and Python runtimes
|
2013-08-15 08:06:37 +00:00 |
|
|
kr.angelov
|
f1d407de09
|
added untested port of GNU lightning to ARM
|
2013-08-01 12:07:06 +00:00 |
|
|
kr.angelov
|
4f7369f714
|
the parser in the C runtime now checks for duplicated results
|
2013-07-03 12:30:30 +00:00 |
|
|
kr.angelov
|
96ea257fa3
|
complete pgf_expr_eq in the C runtime
|
2013-07-02 20:12:57 +00:00 |
|
|
kr.angelov
|
6971642cc7
|
hash function for abstract syntax trees
|
2013-07-02 19:12:53 +00:00 |
|
|
kr.angelov
|
1b41792237
|
C runtime: fix the debug modes in the parser and in the reasoner after the changes in the printer
|
2013-06-27 11:00:26 +00:00 |
|
|
kr.angelov
|
0d68a20d94
|
a complete Python API for reading, printing and manipulation of abstract trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
|
2013-06-27 09:39:15 +00:00 |
|
|
kr.angelov
|
03690ccc4b
|
we no longer maintain an explicit list of functions per category since now it is implicitly kept in the JIT compiled code
|
2013-06-26 09:35:50 +00:00 |
|
|
kr.angelov
|
b47dfd9dbb
|
forgot to add reasoner.h
|
2013-06-26 09:09:54 +00:00 |
|
|
kr.angelov
|
67872578c9
|
forgot to add jit.h
|
2013-06-26 09:08:47 +00:00 |
|
|
kr.angelov
|
c873531172
|
an optimization in the jitter for generating more compact code
|
2013-06-26 09:03:51 +00:00 |
|
|
kr.angelov
|
dba75911b0
|
patch for adjustable heuristics from Python
|
2013-06-26 07:36:03 +00:00 |
|
|
kr.angelov
|
966d3aee3f
|
compatibility issue for MacOS X
|
2013-06-26 07:03:32 +00:00 |
|
|
kr.angelov
|
38b3dfcad6
|
fix for x86_64
|
2013-06-26 06:43:33 +00:00 |
|
|
kr.angelov
|
16584d4368
|
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
|
10eb9dedb6
|
bugfix for the linearizer in the C runtime
|
2013-06-24 07:56:42 +00:00 |
|
|
kr.angelov
|
72cd14a5ae
|
add x86_64 support to GNU lightning
|
2013-06-20 08:27:04 +00:00 |
|
|
kr.angelov
|
ffa6cbd03c
|
fix for a couple of warnings that are generated when GNU lightning is used
|
2013-06-17 07:32:41 +00:00 |
|
|
kr.angelov
|
6c4f52faeb
|
add the source code for GNU lightning in the source directory for the C runtime
|
2013-06-17 07:26:00 +00:00 |
|
|
kr.angelov
|
935ae49376
|
bugfix for the grammar printer in the C runtime
|
2013-05-30 20:20:02 +00:00 |
|
|
kr.angelov
|
78aab96369
|
fix the encoding problem with unicode literals in the Python binding
|
2013-05-21 10:53:20 +00:00 |
|
|
kr.angelov
|
2eb37f6407
|
bug fix in the management of memory pools in the statistical parser
|
2013-05-07 08:30:32 +00:00 |
|
|
kr.angelov
|
561e478ed4
|
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 |
|
|
kr.angelov
|
307e0854ed
|
fix the leftcorner filtering after the addition of word completion
|
2013-05-05 10:30:06 +00:00 |
|
|
kr.angelov
|
be8d72d64c
|
bugfix in the C runtime which was causing an infinite loop while linearizing partial trees
|
2013-05-04 13:32:57 +00:00 |
|
|
kr.angelov
|
9cdd96363a
|
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 |
|
|
kr.angelov
|
6cc44193b8
|
finally the statistical parser is able to return all possible abstract trees
|
2013-04-26 20:44:01 +00:00 |
|
|
kr.angelov
|
f4cf8deab7
|
a trivial refactoring of the reasoner in the C runtime
|
2013-04-23 06:40:14 +00:00 |
|
|
kr.angelov
|
15fd8b15ab
|
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
|
2a0c69a412
|
added API for computing bracketed strings from Python and C
|
2013-04-18 13:37:09 +00:00 |
|
|
kr.angelov
|
cf0da12b8a
|
a bugfix which was causing an infinite loop in the C linearizer for some sentences
|
2013-04-05 09:11:24 +00:00 |
|
|
kr.angelov
|
b850ea2b9b
|
a very simple linearization for partial abstract trees in the C runtime
|
2013-04-05 08:42:56 +00:00 |
|
|
kr.angelov
|
650e1cfa43
|
the calculation of lexical_prob in the statistical parser doesn't work properly. It should be fixed but for now I just disabled the optimization
|
2013-03-20 12:28:52 +00:00 |
|
|
kr.angelov
|
fec34e7622
|
replace #if with #ifdef when checking for the optional bottom up filtering in the C runtime
|
2013-03-20 10:47:47 +00:00 |
|
|
kr.angelov
|
1ddcfc219e
|
the bottom up filtering in the C runtime is temporary disabled. It takes too much memory and even makes it impossible to load the Finnish and the German parsing grammars.
|
2013-03-19 10:59:44 +00:00 |
|
|
kr.angelov
|
cb37254882
|
bug fix in the linearizer in the C runtime
|
2013-03-14 12:31:49 +00:00 |
|
|
kr.angelov
|
2893397fbb
|
bugfix in the statistical parser
|
2013-03-11 14:47:43 +00:00 |
|
|
kr.angelov
|
5a54596fe8
|
the parser in the C runtime should not crash if the start category is not defined
|
2013-02-19 12:08:48 +00:00 |
|
|
kr.angelov
|
f86dcb6572
|
bugfix in the grammar reader in the C runtime
|
2013-02-19 12:04:10 +00:00 |
|
|
kr.angelov
|
ffb17bd26a
|
bugfix in the linearizer for the C runtime
|
2013-02-13 15:39:01 +00:00 |
|
|
kr.angelov
|
55203110bb
|
now the beam size for the statistical parser can be configured by using the flag beam_size in the top-level concrete module
|
2013-02-12 10:53:13 +00:00 |
|
|
kr.angelov
|
1f77afcfce
|
the statistical parser now uses a baseline lexical estimation of the beam size
|
2013-02-12 09:41:32 +00:00 |
|
|
kr.angelov
|
a6b35a9053
|
the class PgfConcr from the Python binding now has a property name which returns the name of the concrete syntax
|
2013-02-11 15:51:26 +00:00 |
|
|
kr.angelov
|
0b7b939aca
|
refactoring: now all named objects in the C runtime have an explicit name field
|
2013-02-11 14:10:54 +00:00 |
|
|
kr.angelov
|
56c8f91d19
|
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 |
|
|
kr.angelov
|
ff25ba8f90
|
the grammar reader in the C runtime is completely rewritten and it doesn't use the generic programming API
|
2013-02-11 10:16:58 +00:00 |
|
|
kr.angelov
|
e9b5557c6c
|
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 |
|