| 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.
|
|
the same mechanism is now used for the metavariables
|
|
|
|
|
|
|
|
the best parse result
|
|
their abstract counter parts
|
|
statistical model with random weight for the meta variables.
|
|
|
|
|
|
|
|
|
|
|
|
pgf_parse_result for more accurate timing
|
|
|
|
|
|
|
|
|
|
fast lexical lookup from the same index
|
|
|
|
|
|
|
|
|
|
compilation option.
|
|
|
|
which also makes the types PgfLzr and PgfParser redundant.
|
|
|
|
|
|
reduce the parsing time from 11 sec down to 3 sec.
|
|
map of the parser
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
in the grammar printout
|
|
|
|
|
|
|
|
syntax trees will be returned lazily
|
|
|
|
different compiler then we simply recompile it.
|