| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-09-27 | a major refactoring in the C and the Haskell runtimes. Note incompatible ↵ | kr.angelov | |
| change in the PGF format!!! The following are the outcomes: - Predef.nonExist is fully supported by both the Haskell and the C runtimes - Predef.BIND is now an internal compiler defined token. For now it behaves just as usual for the Haskell runtime, i.e. it generates &+. However, the special treatment will let us to handle it properly in the C runtime. - This required a major change in the PGF format since both nonExist and BIND may appear inside 'pre' and this was not supported before. | |||
| 2013-09-17 | a major refactoring in the C runtime. GuList is now removed and replaced ↵ | kr.angelov | |
| with GuSeq. The GuSeq/GuBuf API is simplified | |||
| 2013-06-26 | patch for adjustable heuristics from Python | kr.angelov | |
| 2013-05-07 | bug fix in the management of memory pools in the statistical parser | kr.angelov | |
| 2013-04-26 | finally the statistical parser is able to return all possible abstract trees | kr.angelov | |
| 2013-04-19 | the C runtime and the Python binding now have an API for parser evaluation. ↵ | kr.angelov | |
| 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 | |||
