msyds/gf-core
1
0
Fork 0
forked from GitHub/gf-core
Code Pull Requests Activity
6,497 Commits 21 Branches 11 Tags
f402d1687d2dbdc4c679f2dcc5831129a66f1d90
Commit Graph

139 Commits

Author SHA1 Message Date
kr.angelov
f75d1374ff 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
37e1ced6cf another fix for teyjus 2012-08-30 08:09:30 +00:00
kr.angelov
fe27540c49 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
f78505d88e Use nub' instead of nub in some places, remove some unused nub imports 2012-08-29 21:48:34 +00:00
peter.ljunglof
87260365c7 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
fd5220038d A basic infrastructure for generating Teyjus bytecode from the GF abstract syntax 2012-08-29 11:43:02 +00:00
aarne
8ef8af479f command option ma -known to drop unknown words 2012-06-10 10:43:57 +00:00
Sergei Trofimovich
4404be284d 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
c234e58a6a 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
5bbd1d6f73 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
c20745480f Now graphvizAbstractTree suppress the visualization of implicit arguments. 2011-12-08 09:18:38 +00:00
kr.angelov
1b85355d47 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
bbe42d1e90 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
fb43ab5019 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
3e5aded279 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
9bd15b0777 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
7fa94d7a90 added topological sort module to PGF - to be used in example based grammar writing 2011-09-15 16:32:49 +00:00
aarne
9f0bf57d79 quick fixes in PGF.TypeCheck suggested by Krasimir; to be revisited 2011-09-14 11:29:35 +00:00
kr.angelov
dbe00fd0eb bugfixes in the typechecker and the tree generator 2011-08-30 11:24:59 +00:00
kr.angelov
9a899edb0b bugfix: allow higher-order variables in the linearization 2011-08-30 09:22:44 +00:00
aarne
7bf4683c02 skip spaces before closing parenthesis in PGF.Expr.pFactor 2011-08-29 12:03:45 +00:00
aarne
250c9f8d82 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
1e1d91056d avoid warning from ghc-7.0 
Warning: -fglasgow-exts is deprecated: Use individual extensions instead
 2011-04-06 13:57:19 +00:00
hallgren
7f830ec5df avoid warning from ghc-7.0 
Warning: -fglasgow-exts is deprecated: Use individual extensions instead
 2011-04-06 13:43:29 +00:00
gdetrez
f2df9631fd Adding a missing file for the tokenizer... 2011-03-17 16:04:21 +00:00
gdetrez
5be1b5d493 Adding a basic lexicon-based tokenizer and the asociated command in gf shell 2011-02-10 15:00:06 +00:00
aarne
e4eccba450 a simple clitic analysis command 'ca' 2011-02-06 16:19:24 +00:00
krasimir
adbe9cd94d fix the computation of abstract expressions in the presence of implicit arguments 2011-01-08 20:55:58 +00:00
krasimir
e41df3c873 bugfix in the handling of implicit arguments in the typechecker 2011-01-08 12:55:50 +00:00
krasimir
e52f8dda61 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
f62d6a7ed4 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
22a3eb2f0a work-around in Tree.expr2tree to make Paraphrase work 2010-12-14 14:36:05 +00:00
krasimir
8a0b3b8ba8 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
99c38bf070 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
92266359d3 fixed typos in the documentation for PGF.Parse 2010-12-08 10:32:18 +00:00
krasimir
a9218ff45c simple refactoring in PGF.Macros and related 2010-12-06 14:19:51 +00:00
aarne
1b24f4490c moved PGF.ToApi to GF.Compile.ToAPI 2010-12-07 18:05:13 +00:00
ra.monique
1e5a0c9d9e no more IO in the syntax to API translator 2010-12-06 10:15:14 +00:00
aarne
86bc73cb03 vt -api with conversion to resource API names 2010-12-06 09:53:04 +00:00
ra.monique
faaddfe54b added syntax to api translation module 2010-12-05 19:51:19 +00:00
krasimir
159b68f946 command ai in the shell now shows the probability of the tree 2010-11-24 12:51:54 +00:00
krasimir
fe1205059b operations in the abstract syntax 2010-11-12 19:37:19 +00:00
ramona.enache
cd69929b4d 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
9802d534c0 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
75e8cba592 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
8c751d404f 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
09dde495ce support for proof search with high-order functions 2010-10-21 12:47:26 +00:00
krasimir
43cbc6693d bugfix in the term generation 2010-10-20 13:36:39 +00:00
krasimir
6e23da41a2 fixed typo which broke the parsing with -openclass 2010-10-20 09:04:48 +00:00
krasimir
5acec7be21 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