| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2020-03-06 | an API to access the names of all fields withing a category | krangelov | |
| 2017-10-04 | further extend the API of the C runtime | Krasimir Angelov | |
| 2017-10-03 | in the PGF2 api: remove showCategory. add categoryContext and ↵ | Krasimir Angelov | |
| functionIsConstructor | |||
| 2017-09-28 | the parser for abstract expressions in the C runtime now supports partial parses | Krasimir Angelov | |
| 2017-09-13 | added function pgf_write | Krasimir Angelov | |
| 2017-08-30 | bugfix for hasLinearization in the Haskell binding | Krasimir Angelov | |
| 2017-05-11 | bugfix for print names in the C runtime and expose the functionality from Java | krasimir | |
| 2017-04-19 | explicitly classify all functions in libpgf as either internal or API functions | krasimir | |
| 2017-01-26 | bring the Haskell binding a bit closer to the pure Haskell API | krasimir | |
| 2016-05-30 | added getFunctionProb in the Java and C API | krasimir | |
| 2015-12-22 | pgf_read should close the input file. | krasimir | |
| 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-11-27 | remove pgf/parser.h | kr.angelov | |
| 2014-10-09 | throw away the long obsolete runtime type information in the C runtime | kr.angelov | |
| 2014-10-09 | replace the hash maps in the abstract syntax with binary search tables | kr.angelov | |
| 2014-07-06 | embedded mode for GF grammar in Python. Only generation for now | kr.angelov | |
| 2014-04-10 | now fully functional Java API for custom literals | kr.angelov | |
| 2013-11-27 | added API in the C runtime and the Java binding for checking whether a given ↵ | kr.angelov | |
| function is linearizable in a given language. This is used in the Android UI for better vizualizations | |||
| 2013-11-15 | pgf_read should open the grammar file in binary mode to prevent the Windows ↵ | kr.angelov | |
| runtime from messing up the content. | |||
| 2013-11-06 | the content of ParseEngAbs3.probs is now merged with ParseEngAbs.probs. The ↵ | kr.angelov | |
| later is now retrained. Once the grammar is compiled with the .probs file now it doesn't need anything more to do robust parsing. The robustness itself is controlled by the flags 'heuristic_search_factor', 'meta_prob' and 'meta_token_prob' in ParseEngAbs.gf | |||
| 2013-10-30 | use linref in the C linearizer. The robust linearization is now fully supported | 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-05 | remove the read and write modules from libgu. this simplifies the i/o layer | 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-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 | we 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-26 | patch for adjustable heuristics from Python | kr.angelov | |
| 2013-06-25 | Now 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-05-07 | bug fix in the management of memory pools in the statistical parser | kr.angelov | |
| 2013-05-06 | the 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-01 | word completion in the C runtime. The runtime/python/test.py example is now ↵ | kr.angelov | |
| using readline with word completion | |||
| 2013-04-26 | finally the statistical parser is able to return all possible abstract trees | kr.angelov | |
| 2013-02-11 | the class PgfConcr from the Python binding now has a property name which ↵ | kr.angelov | |
| returns the name of the concrete syntax | |||
| 2013-02-11 | refactoring: now all named objects in the C runtime have an explicit name field | kr.angelov | |
| 2013-02-11 | remove the pgf2yaml tool which was both broken and redundant. The ↵ | kr.angelov | |
| declarations for generic programming from data.c are removed as well | |||
| 2013-02-11 | the grammar reader in the C runtime is completely rewritten and it doesn't ↵ | kr.angelov | |
| use the generic programming API | |||
| 2013-02-01 | This patch removes Gregoire's parse_tokens function in the python binding ↵ | kr.angelov | |
| 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-01-24 | Python binding: add a parsing function that accepts directly a list of tokens. | gregoire.detrez | |
| Is allows to define a tokenizer in python (or use an existing one, from nltk for instance.) | |||
| 2013-01-07 | a new reasoner in the C runtime. It supports tabling which makes it ↵ | kr.angelov | |
| decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order | |||
| 2012-12-19 | rename linearize.{h/c} to linearizer.{h/c} which follows the convention used ↵ | kr.angelov | |
| in parser.c and reasoner.c | |||
| 2012-12-13 | a top-level API for parsing in the C runtime | kr.angelov | |
| 2012-12-12 | started an official API to the C runtime | kr.angelov | |
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |