| Age | Commit message (Collapse) | Author |
|---|
|
|
|
files correctly.
The parser works on raw byte sequences read from source files. If parsing
succeeds the raw byte sequences are converted to proper Unicode characters
in a later phase. But the parser calls the function buildAnyTree, which can
fail and generate error messages containing source code fragments, which might
then containing raw byte sequences. To render these error messages correctly,
they need to be converted in accordance with the coding flag in the source
file. This is now done for UTF-8-encoded source files, but should ideally also
be done for other character encodings. (Latin-1-encoded files never suffered
from this problem, since raw bytes are proper Unicode characters in this case.)
|
|
+ Instead of "Internal error in ...", you now get a proper error message with
a source location and a function name.
+ Also added some missing error value propagation in the partial evaluator.
+ Also some other minor cleanup and error handling fixes.
|
|
To be specific: Amh, Ara, Lat, Tur and Mlt.
|
|
same as one of the expected ones: it shows full records rather than just lock fields.
|
|
|
|
Is allows to define a tokenizer in python (or use an existing one, from nltk for instance.)
|
|
|
|
This is accessible vis the `browse` command, by adding the flag `printnames`
e.g.: .../Letter.pgf?command=browse&id=Recipient&format=json&printnames=1
|
|
|
|
|
|
unhandled errors
|
|
|
|
Also a bug fix when switching to editor, although this still messes up
when using the letters grammar.
Also updated readme with options, and some style improvements.
|
|
|
|
|
|
"a"+("b"++"c") was simplified to "bb"++"c" instead of "ab"++c.
|
|
|
|
|
|
|
|
Tested it in Firefox 18 (which has the new Ionmonkey JavaScript engine).
Still get stack overflows.
|
|
This makes it possible to download PGF files from servers where the PGF service
is installed.
I am also considering making commmand=download the default instead of
command=grammar.
|
|
|
|
|
|
|
|
|
|
which is composed of Python objects. The new representation is not integrated with the core runtime yet
|
|
decideable for propositional logic. dependent types and high-order types are not supported yet. The generation is still in decreasing probability order
|
|
|
|
- added a paradigm for alternative plurals
- fixed usage of alternative plurals in Numerals
- added a distinction between numerals and posessive pronouns
- verb omission and appropriate cases in some uses of to be/to have
- fixed declination of personal names
- added a gender parameter to pronouns (similar to Polish RG)
- vowel insertion before short adjective suffix
- don't generate short forms for relative adjectives (might need lexicon update)
- minor Phrasebook fixes
|
|
|
|
It can leave wildcard tables in their origial form, but it easy to handle
them in the unfactor function in GeneratePMCFG.
|
|
|
|
|
|
It failed to delay table selection when the selector contains a run-time
variable, causing "gf: Prelude.(!!): index too large" instead.
Also:
+ Show better source locations on unexpected errors, to aid bug hunting.
+ Removed unused SourceGrammar argument to value2term.
|
|
It's like lookupResDef but it includes a source location in the output.
|
|
sentence
|
|
|
|
in parser.c and reasoner.c
|
|
|
|
|
|
Int was missing from the list of predefined canonical constants.
|
|
|
|
|
|
|
|
|
|
|
|
are always listed in decreasing probability order. There is also an API for generation from Python
|
|
FlexibleInstances does not imply TypeSynonymInstances, apparently.
|
|
The work done by the partial evaluator is now divied in two stages:
- A static "term traversal" stage that happens only once per term and uses
only statically known information. In particular, the values of lambda bound
variables are unknown during this stage. Some tables are transformed to
reduce the cost of pattern matching.
- A dynamic "function application" stage, where function bodies can be
evaluated repeatedly with different arguments, without the term traversal
overhead and without recomputing statically known information.
Also the treatment of predefined functions has been reworked to take advantage
of the staging and better handle partial applications.
|
