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
gdetrez
1ed5b52a03
In the haskell code, we make the binary representation of the doubles compliant with IEEE 754.
...
The default binary representation in haskell's Data.Binary package is
homemade and quite complicated. Making it compliant with IEEE 754 will
make it easyer for the java runtimes (and probably others) to load the
PGF.
2010-10-19 18:34:29 +00:00
krasimir
0f4927dd40
fixed typos in the documentation for PGF.Parse
2010-12-08 10:32:18 +00:00
krasimir
b6446ec36d
simple refactoring in PGF.Macros and related
2010-12-06 14:19:51 +00:00
aarne
dd6e0b1730
moved PGF.ToApi to GF.Compile.ToAPI
2010-12-07 18:05:13 +00:00
ra.monique
7fba8c338d
no more IO in the syntax to API translator
2010-12-06 10:15:14 +00:00
aarne
00111b10c1
vt -api with conversion to resource API names
2010-12-06 09:53:04 +00:00
ra.monique
6268c2d7d9
added syntax to api translation module
2010-12-05 19:51:19 +00:00
krasimir
0b80b3ef0a
command ai in the shell now shows the probability of the tree
2010-11-24 12:51:54 +00:00
krasimir
115b4213d5
operations in the abstract syntax
2010-11-12 19:37:19 +00:00
ramona.enache
1f8a0f0876
added giza Alignments with command ga and merged the rendering algorithm for graphviz and giza alignments
2010-10-31 13:39:01 +00:00
krasimir
0ba1daf5eb
when faced with hard unification problem the type checker should just postpone the decision instead of failing immediately. added test case as well
2010-10-25 15:47:33 +00:00
krasimir
aa6b07afdb
when we print the bracketed string it is useful to print the attached metavariables as well
2010-10-25 12:21:12 +00:00
krasimir
822a70cf7a
change the TcM monad to continuation passing style. The old monad caused stack overflow for large search spaces
2010-10-21 15:01:52 +00:00
krasimir
82edf7bebb
support for proof search with high-order functions
2010-10-21 12:47:26 +00:00
krasimir
2991b7acef
bugfix in the term generation
2010-10-20 13:36:39 +00:00
krasimir
d45b4ae426
fixed typo which broke the parsing with -openclass
2010-10-20 09:04:48 +00:00
krasimir
4ac1cf4970
in the type checker monad we should use lazy pattern matching because otherwise we force the exhaustive tree generation to be strict
2010-10-19 13:04:41 +00:00
krasimir
775e59dabe
added explicit depth parameter to the parsing API and the corresponding command in the shell
2010-10-18 16:51:25 +00:00
krasimir
205ac48ac3
typo in PGF.TypeCheck which spoiled the previous patch
2010-10-18 16:50:55 +00:00
krasimir
702b4aad3b
now we use the GF reasoner to fillin meta variables in the abstract trees generated from the parser
2010-10-18 15:55:14 +00:00
krasimir
05a52d6937
now since the type checking monad TcM is nondeterministic we can use the same monad in PGF.Forest.getAbsTrees
2010-10-14 14:28:40 +00:00
krasimir
7fc638e030
bugfix in PGF.VisualizeTree for handling trees with implicit arguments
2010-10-13 13:32:48 +00:00
krasimir
09ce38742c
fix PGF.Generate.restart. The restart should be done only if there are some solutions found
2010-10-13 12:38:51 +00:00
krasimir
de0354f991
the exhaustive/random generator now knows how to handle computable functions in the types
2010-10-11 17:18:28 +00:00