| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2013-11-05 | Eliminate mutual dependencies between the GF compiler and the PGF library | hallgren | |
| + References to modules under src/compiler have been eliminated from the PGF library (under src/runtime/haskell). Only two functions had to be moved (from GF.Data.Utilities to PGF.Utilities) to make this possible, other apparent dependencies turned out to be vacuous. + In gf.cabal, the GF executable no longer directly depends on the PGF library source directory, but only on the exposed library modules. This means that there is less duplication in gf.cabal and that the 30 modules in the PGF library will no longer be compiled twice while building GF. To make this possible, additional PGF library modules have been exposed, even though they should probably be considered for internal use only. They could be collected in a PGF.Internal module, or marked as "unstable", to make this explicit. + Also, by using the -fwarn-unused-imports flag, ~220 redundant imports were found and removed, reducing the total number of imports by ~15%. | |||
| 2013-10-30 | linref is now used by the linearizer. The visible change is that the 'l' ↵ | kr.angelov | |
| command in the shell now can linearize discontinuous phrases | |||
| 2013-10-30 | added the linref construction in GF. The PGF version number is now bumped | kr.angelov | |
| 2013-10-21 | fix the grammar serialization for nonExist and BIND | kr.angelov | |
| 2013-10-03 | the symbol for nonExist in the GF runtime should be the last. this ↵ | kr.angelov | |
| simplifies the binary search in the C runtime | |||
| 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-03 | fix for linearization with 'pre' | kr.angelov | |
| 2013-09-03 | fix in the GF compiler and runtime which let us to define pre construct ↵ | kr.angelov | |
| detecting whether this is the last token. | |||
| 2013-08-23 | nonExist now does the expected thing | kr.angelov | |
| 2013-07-30 | the first approximation for a statistical model consistent with dependent ↵ | kr.angelov | |
| types in the abstract syntax | |||
| 2013-05-03 | [haskell runtime] Remove trailing whitespaces in VisualizeTree.hs | gregoire.detrez | |
| 2013-04-21 | reverse the direction of the arcs in the dependency trees | kr.angelov | |
| 2013-04-19 | remove the dead code left behind by Peter Ljunglöf in VisualizeTree | kr.angelov | |
| 2013-04-16 | added a malt_tab format to the vd command in the GF shell | kr.angelov | |
| 2013-04-16 | the generation of dependency trees in the Haskell runtime is now finally ↵ | kr.angelov | |
| working with bracketed strings. This also fixes some errors in the old implementation | |||
| 2013-04-15 | the compiler now sorts the list of functions per category in probability ↵ | kr.angelov | |
| order. this ensures probability order search in the C runtime | |||
| 2013-04-08 | PGF.hs: export function missingLins | hallgren | |
| Also in Commands.hs: be explicit about things imported from the PGF library that are not in the public API. Also a couple of haddock documentation fixes. | |||
| 2013-04-02 | Replace "CId" with "Language" in type signature for PGF.tabularLinearizes | john.j.camilleri | |
| 2013-01-29 | Avoid crash in random generation with probabilities | hallgren | |
| 2012-11-22 | PGFService.hs: fix type error caused by change to PGF.graphvizParseTree | hallgren | |
| Note that some of the graphviz functions have backwards incompatible changes that might also affect other clients of the PGF run-time library. Also added graphvizDefaults and export it together with GraphvizOptions from the PGF run-time library. | |||
| 2012-11-22 | better visualization of parse trees | peter.ljunglof | |
| 2012-08-30 | another fix for teyjus | kr.angelov | |
| 2012-08-30 | the loading of PGF files was broken by the Teyjus patch. Now this is fixed | kr.angelov | |
| 2012-08-29 | Use nub' instead of nub in some places, remove some unused nub imports | peter.ljunglof | |
| 2012-08-29 | Added an O(n log n) version of nub | peter.ljunglof | |
| The new nub is called nub', and it replaces the old sortNub which was not lazy and did not retain the order between the elements. | |||
| 2012-08-29 | A basic infrastructure for generating Teyjus bytecode from the GF abstract ↵ | kr.angelov | |
| syntax | |||
| 2012-06-10 | command option ma -known to drop unknown words | aarne | |
| 2012-03-26 | Fix List.foldl / Map.foldl ambiguosity | Sergei Trofimovich | |
| Fixes the following error: src/runtime/haskell/PGF/Expr.hs:111:14: Ambiguous occurrence `foldl' It could refer to either `List.foldl', imported from `Data.List' at src/runtime/haskell/PGF/Expr.hs:27:1-24 (and originally defined in `GHC.List') or `Map.foldl', imported from `Data.Map' at src/runtime/haskell/PGF/Expr.hs:28:1-40 | |||
| 2012-03-18 | PGF run-time library: function names in BracketedString (experimental) | hallgren | |
| + Make room for function names in the BracketedString data structure. + Fill in function names when linearizing an abstract syntax tree to a BracketedString. + Fill in wildCId when it is not obvious what the function is. + Function bracketedLinearize: for compatibility with the other linearization functions, return Leaf "" instead of error "cannot linearize". + Export flattenBracketedString from module PGF. + PGFServce: make function names available in the JSON representation of BracketedString. | |||
| 2011-12-19 | the parser now use nub instead of nubsort which means that the abstract ↵ | kr.angelov | |
| syntax trees will be returned lazily | |||
| 2011-12-08 | Now graphvizAbstractTree suppress the visualization of implicit arguments. | kr.angelov | |
| 2011-11-15 | now we store version number in every .gfo file. If the file is compiled with ↵ | kr.angelov | |
| different compiler then we simply recompile it. | |||
| 2011-11-10 | Now PMCFG is compiled per module and at the end we only link it. The new ↵ | kr.angelov | |
| compilation schema is few times faster. | |||
| 2011-10-25 | Preparations for release of GF 3.3 | hallgren | |
| + Changing version numbers and dates here and there. + Simplify build-binary-dist.sh since pgf-http need not be built anymore. + Use--gf-lib-path to make the sample grammars for minibar compile even if GF is not installed. | |||
| 2011-09-21 | fix in the proof search. when we start the generation from a template, we ↵ | kr.angelov | |
| must start the refinement from the expression that the typecheker generated | |||
| 2011-09-15 | added topological sort module to PGF - to be used in example based grammar ↵ | ra.monique | |
| writing | |||
| 2011-09-14 | quick fixes in PGF.TypeCheck suggested by Krasimir; to be revisited | aarne | |
| 2011-08-30 | bugfixes in the typechecker and the tree generator | kr.angelov | |
| 2011-08-30 | bugfix: allow higher-order variables in the linearization | kr.angelov | |
| 2011-08-29 | skip spaces before closing parenthesis in PGF.Expr.pFactor | aarne | |
| 2011-08-28 | import command now gives priority to new abstract syntax, and discards the ↵ | aarne | |
| old concretes if they are for the old abstract; the new priority is implemented in PGF.Data.unionPGF | |||
| 2011-03-17 | Adding a missing file for the tokenizer... | gdetrez | |
| 2011-02-06 | a simple clitic analysis command 'ca' | aarne | |
| 2011-01-08 | fix the computation of abstract expressions in the presence of implicit ↵ | krasimir | |
| arguments | |||
| 2011-01-08 | bugfix in the handling of implicit arguments in the typechecker | krasimir | |
| 2010-12-17 | bugfix: setProbabilities should be more robust when there are missing ↵ | krasimir | |
| probabilities for some functions or categories | |||
| 2010-12-14 | now every parse state keeps reference only to the concrete and the abstract ↵ | krasimir | |
| syntaxes but not to the whole PGF | |||
| 2010-12-14 | work-around in Tree.expr2tree to make Paraphrase work | aarne | |
| 2010-12-14 | optimization in the parser for large lexicons. Now, the parser is slightly ↵ | krasimir | |
| slower for grammars with a small lexicon but 3-4 times faster for the English Resource Grammar used in combination with Oxford Advanced Learners Dictionary | |||
| 2010-12-08 | fixed typos in the documentation for PGF.Parse | krasimir | |
 |
index : gf-core.git | |
| Unnamed repository; edit this file 'description' to name the repository. | Adrian |
| summaryrefslogtreecommitdiff |