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
|
dba75911b0
|
patch for adjustable heuristics from Python
|
2013-06-26 07:36:03 +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
|
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
|
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
|
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 |
|
gregoire.detrez
|
459a9a855b
|
Python binding: add a parsing function that accepts directly a list of tokens.
Is allows to define a tokenizer in python (or use an existing one, from nltk for instance.)
|
2013-01-24 13:31:34 +00:00 |
|
kr.angelov
|
3be31c62e9
|
a new reasoner in the C runtime. It supports tabling which makes it decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
|
2013-01-07 12:50:32 +00:00 |
|
kr.angelov
|
6201640d7b
|
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
|
2ba632dc9f
|
a top-level API for parsing in the C runtime
|
2012-12-13 14:44:33 +00:00 |
|
kr.angelov
|
1376df457d
|
started an official API to the C runtime
|
2012-12-12 11:25:58 +00:00 |
|