| Age | Commit message (Collapse) | Author |
|
PGF service requests are stateless and can run in parallel, but some other
requests handled by the server are not and might even change the current
working directory temporarily, and this affects all threads, so it is
important that the PGF service requests access PGF files by absolute paths.
|
|
|
|
|
|
but it is not ready to be widely advertised yet, e.g. lexing and unlexing is
missing.
|
|
Translation'
The interface to the wide coverage translation is in js/gftranslate.js
and it assumes that the grammar is installed on the cloud server
as /robust/Translate8.pgf.
The list of supported languages is hardwired in gftranslate.js, since
there is no support for obtaining this info from the C run-time system
at the moment.
|
|
If the C run-time library is compiled and installed on your system, you can now
do 'cabal configure -fc-runtime' to get the following extras:
+ The haskell binding to the C run-time library will be included in the
PGF library (so you can import it in Haskell applications).
Documentation on the new modules will be included when you run
'cabal haddock'.
+ The new command 'pgf-shell', implemented on top of haskell binding to
the C run-time system.
+ Three new commands in the web API: c-parse, c-linearize and
c-translate. Their interfaces are similar to the corresponding commands
without the "c-" prefix, but they should be considered preliminary.
|
|
It also makes the generated haddock documentaiton more structured.
|
|
|
|
* The haskell-bind.cabal file makes it easy to build the haskell binding and
use it in ghci.
* pgf-shell.hs is a simple example of how to use the haskell binding.
|
|
Change the type of getConcr from
getConcr :: PGF -> Language -> Concr
to
getConcr :: PGF -> Language -> Maybe Concr
This is to prevent programs from crashing later if you try to select a
concrete syntax that is not present in a grammar.
|
|
|
|
|
|
|
|
|
|
Also rewrote Makefile2 in a more compact way.
|
|
When running a command like
gf -make L_1.gf ... L_n.gf
gf now avoids recreating the target PGF file if it already exists and is
up-to-date.
gf still reads all required .gfo files, so significant additional speed
improvements are still possible. This could be done by reading .gfo files
more lazily...
|
|
Also check that no additional output formats have been selected.
|
|
When running a command like
gf -make -name=T L_1.pgf ... L_n.pgf
gf now checks if T.pgf exists and is up-to-date before reading and computing
the union of the L_i.pgf files.
The name (T) of the target PGF file has to be given explicitly for this to work,
since otherwise the name is not known until the union has been computed.
If the functions for reading PGF files and computing the union were lazier,
this would not be necessary...
|
|
|
|
Someone who is familiar with the Python translation should check this.
|
|
It looks better on high resolution screens.
|
|
|
|
|
|
lexical activity
|
|
|
|
the same
|
|
shall be compiled with -split-pgf
|
|
completely loaded
|
|
Some backwards incompatible changes were made to the PGF file format after
the release of GF 3.5. This patch adds a module for reading PGF files in the
old format.
This means that old PGF files on the grammaticalframework.org server will
continue to work after we install the latest version of GF.
|
|
|
|
variants
|
|
|
|
|
|
The link shows the current build status.
|
|
|
|
There were two differences between the current output and the old gold file:
1. The trees are no longer generated with increasing depth
2. The meaning of the -depth flag has changed: for example,
"gt -cat=Nat -depth=1" used to generate only "zero",
now you also get "succ zero".
|
|
up with the stable Haskell runtime!
|
|
|
|
Added Haskell bindings for the C runtime. Work in progress, the files are not (and should not be) included in makefiles or anything.
|
|
|
|
|
|
|
|
file for the abstract and one more for each concrete syntax. This is a preparation for being able to load only specific languages from the whole grammar.
|
|
|
|
|
|
Some tests may fail on Windows because of \ instead of / in paths.
|
|
This is to avoid one trivial reason for failures in the test suite.
|
|
|
|
definitions
|
|
Trees are not generated with increasing depth.
|