| Age | Commit message (Collapse) | Author |
|
|
|
|
|
|
|
|
|
|
|
search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The package network-2.4.1.1 thoughlessly introduced a backward incompatible
change to the function Network.URI.unEscapeString, see
https://github.com/haskell/network/commit/f2168b1f8978b4ad9c504e545755f0795ac869ce
This also affects the function Network.Shed.Httpd.queryToArguments, which is
used in GFServer.hs.
To remain compatible with older and newer versions of the network package,
we need to stay clear of queryToArguments and unEscapeString. A replacement
function has been added to server/URLEncoding.hs.
|
|
|
|
|
|
It needs to be updated manually when the list of available output format
changes.
|
|
|
|
mostly incorrect due to missing paradigms
|
|
the first element and a the list [e1,e2] as the second. This makes it easier to decompose partial abstract trees
|
|
|
|
|
|
|
|
exception if the grammar is missing
|
|
implementation for the binding
|
|
|
|
|
|
linearized
|
|
|
|
one for the output trees. This means that the memory for parsing can be released as soon as the needed abstract trees are retrieved, while the trees themselves are retained in the separate output pool
|
|
|
|
partial trees
|
|
|
|
using readline with word completion
|
|
|
|
|
|
|
|
|
|
The with(...) {...} statement has different scoping rules in Webkit browsers
and Gecko browsers, so it is better to avoid it.
|
|
The &+ operator is now consistently eliminated from the output of commmands
that produce linearizations. Before, only the commands translate and
translategroup did this.
|
|
Return the given default value instead.
|
|
via the minibar
|
|
The C run-time responds badly to input that is too long, so we return an
error message here instead.
The limit is 200 URL-encoded characters.
|
|
|
|
...for more streamlined code and better browser compatibility.
|
|
|
|
per sentence
|
|
|