kr.angelov
df26b134fc
fix in the GF compiler and runtime which let us to define pre construct detecting whether this is the last token.
2013-09-03 07:51:25 +00:00
kr.angelov
a20cd77d25
nonExist now does the expected thing
2013-08-23 13:17:45 +00:00
kr.angelov
383d829d5a
the first approximation for a statistical model consistent with dependent types in the abstract syntax
2013-07-30 07:29:11 +00:00
gregoire.detrez
08a67b9f34
[haskell runtime] Remove trailing whitespaces in VisualizeTree.hs
2013-05-03 09:42:29 +00:00
kr.angelov
b1b68bf6b4
reverse the direction of the arcs in the dependency trees
2013-04-21 19:20:08 +00:00
kr.angelov
4e2044ab99
remove the dead code left behind by Peter Ljunglöf in VisualizeTree
2013-04-19 11:13:07 +00:00
kr.angelov
b49b9d459a
added a malt_tab format to the vd command in the GF shell
2013-04-16 18:22:37 +00:00
kr.angelov
f6d675c34b
the generation of dependency trees in the Haskell runtime is now finally working with bracketed strings. This also fixes some errors in the old implementation
2013-04-16 13:10:48 +00:00
kr.angelov
2f35964871
the compiler now sorts the list of functions per category in probability order. this ensures probability order search in the C runtime
2013-04-15 19:58:57 +00:00
hallgren
b8ce5ef5b3
PGF.hs: export function missingLins
...
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-08 15:38:11 +00:00
john.j.camilleri
458ffc42d1
Replace "CId" with "Language" in type signature for PGF.tabularLinearizes
2013-04-02 09:19:08 +00:00
hallgren
9faa3407ab
haddock bug workaround
2013-03-26 13:14:37 +00:00
Sergei Trofimovich
5b688b6359
ghc-7.6: add missing Num instance for Bits
...
Fixes the following build failure:
src/runtime/haskell/Data/Binary/IEEE754.lhs:256:17:
Could not deduce (Num a) arising from a use of `mask'
from the context (Bits a)
bound by the type signature for
clamp :: Bits a => BitCount -> a -> a
2013-03-09 21:19:53 +00:00
hallgren
4f243fbf12
Fix for a PGF portability problem
...
GF produced slightly different PGF files on 64-bit systems and 32-bit systems.
This could cause problems when a PGF was produced on a 32-bit system and used
on a 64-bit system.
To fix this, the GF compiler and the Haskell PGF run-time library now reads
and writes PGF files like the 32-bit version even when compiled on a 64-bit
system.
Note: the Haskell type Int is still used internally in GF, which could be
32 bits or 64 bits...
2013-02-13 14:28:06 +00:00
hallgren
211cd9bb25
Avoid crash in random generation with probabilities
2013-01-29 13:59:20 +00:00
hallgren
db544b1cc9
PGFService.hs: fix type error caused by change to PGF.graphvizParseTree
...
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 15:27:16 +00:00
peter.ljunglof
486a510611
better visualization of parse trees
2012-11-22 08:50:37 +00:00
kr.angelov
fe3b5c1360
the Haskell runtime now exports 'functionsByCat' which returns the list of all functions for a given category
2012-09-18 09:48:21 +00:00
kr.angelov
545e48e881
another fix for teyjus
2012-08-30 08:09:30 +00:00
kr.angelov
3f0b8c55ec
the loading of PGF files was broken by the Teyjus patch. Now this is fixed
2012-08-30 07:41:49 +00:00
peter.ljunglof
b416f5bbf7
Use nub' instead of nub in some places, remove some unused nub imports
2012-08-29 21:48:34 +00:00
peter.ljunglof
a7de16c34b
Added an O(n log n) version of nub
...
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 21:45:10 +00:00
kr.angelov
f8fe23fda7
A basic infrastructure for generating Teyjus bytecode from the GF abstract syntax
2012-08-29 11:43:02 +00:00
aarne
191ecc71b8
command option ma -known to drop unknown words
2012-06-10 10:43:57 +00:00
Sergei Trofimovich
24740d250b
Fix List.foldl / Map.foldl ambiguosity
...
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-26 20:18:23 +00:00
hallgren
07af8988d3
PGF run-time library: function names in BracketedString (experimental)
...
+ 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.
2012-03-18 20:12:26 +00:00
kr.angelov
bb6905e36f
the parser now use nub instead of nubsort which means that the abstract syntax trees will be returned lazily
2011-12-19 13:10:33 +00:00
kr.angelov
7c9bbd844b
Now graphvizAbstractTree suppress the visualization of implicit arguments.
2011-12-08 09:18:38 +00:00
kr.angelov
a2626e24dd
now we store version number in every .gfo file. If the file is compiled with different compiler then we simply recompile it.
2011-11-15 19:12:22 +00:00
kr.angelov
416d231c5e
Now PMCFG is compiled per module and at the end we only link it. The new compilation schema is few times faster.
2011-11-10 14:09:41 +00:00
hallgren
a8185fd997
Preparations for release of GF 3.3
...
+ 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-10-25 18:25:49 +00:00
hallgren
6c5ee3d666
PGF.hs: Add LANGUAGE BangPatterns to make GHC 7.2 happy
...
Also remove oddly named function forExample (topological sorting) from export
list.
2011-10-20 13:21:28 +00:00
kr.angelov
89fb9a7fdf
fix in the proof search. when we start the generation from a template, we must start the refinement from the expression that the typecheker generated
2011-09-21 13:30:09 +00:00
ra.monique
bdc77bf0e4
added topological sort module to PGF - to be used in example based grammar writing
2011-09-15 16:32:49 +00:00
aarne
d394f76e3d
quick fixes in PGF.TypeCheck suggested by Krasimir; to be revisited
2011-09-14 11:29:35 +00:00
kr.angelov
4215fc31bf
bugfixes in the typechecker and the tree generator
2011-08-30 11:24:59 +00:00
kr.angelov
41a60772c7
bugfix: allow higher-order variables in the linearization
2011-08-30 09:22:44 +00:00
aarne
380011eb7d
skip spaces before closing parenthesis in PGF.Expr.pFactor
2011-08-29 12:03:45 +00:00
aarne
769121788a
import command now gives priority to new abstract syntax, and discards the old concretes if they are for the old abstract; the new priority is implemented in PGF.Data.unionPGF
2011-08-28 10:35:55 +00:00
hallgren
00a08fb4fb
avoid warning from ghc-7.0
...
Warning: -fglasgow-exts is deprecated: Use individual extensions instead
2011-04-06 13:57:19 +00:00
hallgren
b4e3e8c0fa
avoid warning from ghc-7.0
...
Warning: -fglasgow-exts is deprecated: Use individual extensions instead
2011-04-06 13:43:29 +00:00
gdetrez
9a0889d687
Adding a missing file for the tokenizer...
2011-03-17 16:04:21 +00:00
gdetrez
45ecae4b77
Adding a basic lexicon-based tokenizer and the asociated command in gf shell
2011-02-10 15:00:06 +00:00
aarne
7445e56387
a simple clitic analysis command 'ca'
2011-02-06 16:19:24 +00:00
krasimir
5941995c59
fix the computation of abstract expressions in the presence of implicit arguments
2011-01-08 20:55:58 +00:00
krasimir
d465292fde
bugfix in the handling of implicit arguments in the typechecker
2011-01-08 12:55:50 +00:00
krasimir
e4b2b8541f
bugfix: setProbabilities should be more robust when there are missing probabilities for some functions or categories
2010-12-17 09:09:07 +00:00
krasimir
c571e6ef33
now every parse state keeps reference only to the concrete and the abstract syntaxes but not to the whole PGF
2010-12-14 17:20:53 +00:00
aarne
e7fbe756a3
work-around in Tree.expr2tree to make Paraphrase work
2010-12-14 14:36:05 +00:00
krasimir
7d58efb660
optimization in the parser for large lexicons. Now, the parser is slightly 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-14 08:46:22 +00:00