| Age | Commit message (Collapse) | Author |
|
|
|
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
|
|
+ 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.
|
|
syntax trees will be returned lazily
|
|
|
|
different compiler then we simply recompile it.
|
|
compilation schema is few times faster.
|
|
+ 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.
|
|
must start the refinement from the expression that the typecheker generated
|
|
writing
|
|
|
|
|
|
|
|
|
|
old concretes if they are for the old abstract; the new priority is implemented in PGF.Data.unionPGF
|
|
|
|
|
|
arguments
|
|
|
|
probabilities for some functions or categories
|
|
syntaxes but not to the whole PGF
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
graphviz and giza alignments
|
|
postpone the decision instead of failing immediately. added test case as well
|
|
metavariables as well
|
|
stack overflow for large search spaces
|
|
|
|
|
|
|
|
otherwise we force the exhaustive tree generation to be strict
|
|
command in the shell
|
|
|
|
generated from the parser
|
|
same monad in PGF.Forest.getAbsTrees
|
|
|
|
solutions found
|
|
in the types
|
|
types
|
|
after each solution
|
|
in the abstract syntax
|
|
Still not quite stable.
|