| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2015-04-22 | Examples for using Python bindings | prasanth.kolachina | |
| The examples directory contains two modules for using Python bindings in GF. The gf_utils module provides various Python functions to perform parsing and linearization using the C runtime. Additionally, the translation_pipeline module is an replica of the current pipeline used in the Wide-coverage Web translation pipeline. | |||
| 2015-01-05 | fix the reference counting for callbacks in Python | kr.angelov | |
| 2014-12-16 | change in the API for literals | kr.angelov | |
| The API in the C runtime as well as in the Haskell, Python and Java binding is changed. Now instead of adding the literal callbacks to the concrete syntax you need to supply them every time when you need to parse. The main reason is: - referentially transparent API for Haskell - when we start using memory mapped files we will not be allowed to change anything in the grammar data structures. At that point the old API would be impossible to use. | |||
| 2014-10-22 | CAPIT is now naturally supported in the C runtime | kr.angelov | |
| 2014-10-22 | make the fields of BracketedString in the Python binding read/write | kr.angelov | |
| 2014-10-09 | throw away the long obsolete runtime type information in the C runtime | kr.angelov | |
| 2014-09-25 | the literals API is now exposed in Python | kr.angelov | |
| 2014-09-17 | fix a portability problem with the Python binding (found by Prasanth) | kr.angelov | |
| 2014-07-08 | implemented computing with abstract syntax trees. It passes all test cases ↵ | kr.angelov | |
| except those that require def rules. The design is consistent with the STG virtual machine | |||
| 2014-07-06 | an API for visitor patterns on abstract syntax trees from Python. This makes ↵ | kr.angelov | |
| the embedded grammars especially pleasing | |||
| 2014-07-06 | small fix for the embedded mode in Python | kr.angelov | |
| 2014-07-06 | embedded mode for GF grammar in Python. Only generation for now | kr.angelov | |
| 2014-06-18 | build-binary-dist.sh: updated to include the Python binding to the C run-time | hallgren | |
| There are also some changes in src/runtime/python/setyp.py to support this. | |||
| 2014-05-22 | small fix in tabularLinearize | kr.angelov | |
| 2014-05-22 | added tabularLinearize in the python binding | kr.angelov | |
| 2014-03-20 | added hasLinearization method in the Python binding | kr.angelov | |
| 2014-03-20 | fix in the Python binding which was forgoten after a change in the C runtime | kr.angelov | |
| 2014-03-12 | compute the right word probability | kr.angelov | |
| 2013-12-10 | loading and unloading of languages in the C runtime and in the Python bindings | kr.angelov | |
| 2013-11-20 | fix in the Python binding | kr.angelov | |
| 2013-11-04 | A simple type checker in the C runtime. Dependent types are not supported ↵ | kr.angelov | |
| yet but HOAS is implemented. The API is accessible from Python as well | |||
| 2013-10-31 | bracketedLinearize in Python is now using the linref | kr.angelov | |
| 2013-10-09 | a major redesign in the C runtime. The parser and the linearizer now fully ↵ | kr.angelov | |
| support BIND. The following things are still broken: parseval, word completion, handling 'pre', the robust mode | |||
| 2013-10-04 | GuString is now an ordinary C string - it makes live easier. In addition ↵ | kr.angelov | |
| PgfSymbolKS, PgfExprFun and PgfLiteralStr now keep their strings as embedded flexible arrays. The latest change gives us the same compactness as the old representation but it is a lot easier to use. | |||
| 2013-09-30 | fix the bracketed linearization in Python after the introduction of nonExist ↵ | kr.angelov | |
| and BIND | |||
| 2013-09-30 | better handling for nonExist in the C runtime. BIND is also supported in the ↵ | kr.angelov | |
| linearizer but not in the parser yet | |||
| 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-24 | a small fix in the python binding after the refactoring in the C runtime | kr.angelov | |
| 2013-09-05 | remove the read and write modules from libgu. this simplifies the i/o layer | kr.angelov | |
| 2013-08-23 | Add INSTALL file for python bindings. Add note about libtool to INSTALL of c ↵ | john | |
| runtime | |||
| 2013-08-21 | change the locale in the test script for the Python binding | kr.angelov | |
| 2013-08-21 | fix a crash in the python binding | kr.angelov | |
| 2013-08-19 | word completion in the C runtime now returns multi-word expressions and the ↵ | kr.angelov | |
| category for every expression | |||
| 2013-08-19 | fullFormLexicon in C and Python | kr.angelov | |
| 2013-08-16 | implemented lookupMorpho for C and Python | kr.angelov | |
| 2013-08-16 | provide API to access the language code for the concrete language | kr.angelov | |
| 2013-08-16 | fixes in the C and Python API to make them closer to the Haskell API | kr.angelov | |
| 2013-08-15 | added graphvizParseTree in the C and Python runtimes | kr.angelov | |
| 2013-08-15 | graphvizAbstractTree in the C and Python runtimes | kr.angelov | |
| 2013-07-05 | the hash function for pgf.Expr is now really added | kr.angelov | |
| 2013-06-27 | typos in the documentation for the Python binding | kr.angelov | |
| 2013-06-27 | a 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-26 | dummy compute function in the Python binding | kr.angelov | |
| 2013-06-26 | patch for adjustable heuristics from Python | kr.angelov | |
| 2013-06-19 | fíx in the Python binding for compatibility with Python<2.7 | kr.angelov | |
| 2013-06-19 | fix an issue in the Python binding related to the 32 vs 64 bit compatibility | kr.angelov | |
| 2013-06-14 | bugfix in the python binding | kr.angelov | |
| 2013-05-31 | now 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-31 | improved error message in the Python binding | kr.angelov | |
| 2013-05-29 | a simple refactoring in the Python runtime | kr.angelov | |
