summaryrefslogtreecommitdiff
path: root/src/runtime
AgeCommit message (Collapse)Author
2013-08-19fullFormLexicon in C and Pythonkr.angelov
2013-08-19added GuEnum interface for iterating over maps in the C runtimekr.angelov
2013-08-16implemented lookupMorpho for C and Pythonkr.angelov
2013-08-16provide API to access the language code for the concrete languagekr.angelov
2013-08-16fixes in the C and Python API to make them closer to the Haskell APIkr.angelov
2013-08-15added graphvizParseTree in the C and Python runtimeskr.angelov
2013-08-15graphvizAbstractTree in the C and Python runtimeskr.angelov
2013-08-01added untested port of GNU lightning to ARMkr.angelov
2013-08-01a bit more on the Java to C binding. Now it is possible to load a grammar ↵kr.angelov
and query for the list of languages
2013-07-30the first approximation for a statistical model consistent with dependent ↵kr.angelov
types in the abstract syntax
2013-07-18bugfix for parsing floating point numbers in the C runtimekr.angelov
2013-07-05the hash function for pgf.Expr is now really addedkr.angelov
2013-07-03the parser in the C runtime now checks for duplicated resultskr.angelov
2013-07-02complete pgf_expr_eq in the C runtimekr.angelov
2013-07-02hash function for abstract syntax treeskr.angelov
2013-06-27C runtime: fix the debug modes in the parser and in the reasoner after the ↵kr.angelov
changes in the printer
2013-06-27typos in the documentation for the Python bindingkr.angelov
2013-06-27a complete Python API for reading, printing and manipulation of abstract ↵kr.angelov
trees and types. This includes dependent types, high-order abstract syntax and implicit arguments
2013-06-26dummy compute function in the Python bindingkr.angelov
2013-06-26we no longer maintain an explicit list of functions per category since now ↵kr.angelov
it is implicitly kept in the JIT compiled code
2013-06-26forgot to add reasoner.hkr.angelov
2013-06-26forgot to add jit.hkr.angelov
2013-06-26an optimization in the jitter for generating more compact codekr.angelov
2013-06-26patch for adjustable heuristics from Pythonkr.angelov
2013-06-26compatibility issue for MacOS Xkr.angelov
2013-06-26fix for x86_64kr.angelov
2013-06-25Now there is a just-in-time compiler which generates native code for proof ↵kr.angelov
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-24bugfix for the linearizer in the C runtimekr.angelov
2013-06-22bugfix for the word completion in the C runtimekr.angelov
2013-06-20add x86_64 support to GNU lightningkr.angelov
2013-06-19fíx in the Python binding for compatibility with Python<2.7kr.angelov
2013-06-19fix an issue in the Python binding related to the 32 vs 64 bit compatibilitykr.angelov
2013-06-17fix for a couple of warnings that are generated when GNU lightning is usedkr.angelov
2013-06-17add the source code for GNU lightning in the source directory for the C runtimekr.angelov
2013-06-14bugfix in the python bindingkr.angelov
2013-05-31now the call Expr.unpack("? e1 e2") in Python returns a pair with None as ↵kr.angelov
the first element and a the list [e1,e2] as the second. This makes it easier to decompose partial abstract trees
2013-05-31improved error message in the Python bindingkr.angelov
2013-05-30bugfix for the grammar printer in the C runtimekr.angelov
2013-05-29a simple refactoring in the Python runtimekr.angelov
2013-05-29readPGF in the Python runtime now throws "No such file or directory" ↵kr.angelov
exception if the grammar is missing
2013-05-28added a test class for the Java API plus a small refinement in the ↵kr.angelov
implementation for the binding
2013-05-28an initial skeleton for building a Java binding to the C runtimekr.angelov
2013-05-21fix the encoding problem with unicode literals in the Python bindingkr.angelov
2013-05-07bugfix for bracketedLinearize which was causing crash if the tree cannot be ↵kr.angelov
linearized
2013-05-07bug fix in the management of memory pools in the statistical parserkr.angelov
2013-05-06the statistical parser is now using two memory pools: one for parsing and ↵kr.angelov
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-05fix the leftcorner filtering after the addition of word completionkr.angelov
2013-05-04bugfix in the C runtime which was causing an infinite loop while linearizing ↵kr.angelov
partial trees
2013-05-03[haskell runtime] Remove trailing whitespaces in VisualizeTree.hsgregoire.detrez
2013-05-01word completion in the C runtime. The runtime/python/test.py example is now ↵kr.angelov
using readline with word completion
generated by cgit v1.2.3 (git 2.39.1) at 2026-05-20 15:16:41 +0000