gf-core.git/src/compiler/GFC.hs, branch optimizeUnnamed repository; edit this file 'description' to name the repository.
https://git.adelon.net/gf-core.git/atom?h=optimize2014-10-15T21:04:29+00:00Rename modules GFI, GFC & GFServer...2014-10-15T21:04:29+00:00hallgrenhallgren@chalmers.se2014-10-15T21:04:29+00:00urn:sha1:b70dba87bab5dfc8039f0b9f69e0851f92324f8b
... to GF.Interactive, GF.Compiler & GF.Server, respectively.
(1) Refactor concurrency, (2) write to .gfo.tmp then rename to .gfo2014-09-08T15:43:20+00:00hallgrenhallgren@chalmers.se2014-09-08T15:43:20+00:00urn:sha1:4eb6b55e980fda9c4d260820f5a6d38dde3d0991
(1) introduces the module GF.Infra.Concurreny with lifted concurrency
operators (to reduce uses of liftIO) and some additional concurrency
utilities, e.g. a function for sequential logging that is used in
both GF.CompileInParallel and GFServer.
(2) avoids leaving broken .gfo files behind if compilation is aborted.
Experimental: parallel batch compilation of grammars2014-08-25T09:56:00+00:00hallgrenhallgren@chalmers.se2014-08-25T09:56:00+00:00urn:sha1:d84c5ef1715c3e4aed4098ee9c847e2dcc86cba4
On my laptop these changes speed up the full build of the RGL and example
grammars with 'cabal build' from ~95s to ~43s and the zero build from ~18s
to ~5s.
The main change is the introduction of the module GF.CompileInParallel that
replaces GF.Compile and the function GF.Compile.ReadFiles.getAllFiles. At
present, it is activated with the new -j flag, and it is only used when
combined with --make or --batch. In addition, to get parallel computations,
you need to add GHC run-time flags, e.g., +RTS -N -A20M -RTS, to the command
line.
The Setup.hs script has been modified to pass the appropriate flags to GF
for parallel compilation when compiling the RGL and example grammars, but you
need a recent version of Cabal for this to work (probably >=1.20).
Some additonal refactoring were made during this work. A new monad is used to
avoid warnings/error messages from different modules to be intertwined when
compiling in parallel, so some functios that were hardiwred to the IO or IOE
monads have been lifted to work in arbitrary monads that are instances in
the appropriate classes.
Fix warnings in 16 modules, mostly forward compatibility warnings from GHC 7.82014-08-13T22:16:18+00:00hallgrenhallgren@chalmers.se2014-08-13T22:16:18+00:00urn:sha1:cd5193b7e19e7ff5e49cdeafe149fdeec8e19fb0a partial support for def rules in the C runtime2014-08-11T10:59:10+00:00kr.angelovkr.angelov@gmail.com2014-08-11T10:59:10+00:00urn:sha1:584d589041f63fdd3ea777019679275657902c2d
The def rules are now compiled to byte code by the compiler and then to
native code by the JIT compiler in the runtime. Not all constructions
are implemented yet. The partial implementation is now in the repository
but it is not activated by default since this requires changes in the
PGF format. I will enable it only after it is complete.
The --output-dir option now applies also to PGF files2014-06-21T12:26:56+00:00hallgrenhallgren@chalmers.se2014-06-21T12:26:56+00:00urn:sha1:58156369fac13076ea41ad9e99931512d89ce906PGF library: expose only PGF and PGF.Internal instead of all modules2014-06-12T14:43:18+00:00hallgrenhallgren@chalmers.se2014-06-12T14:43:18+00:00urn:sha1:d6252d1c16d59ad26db0d08a531cddf39864d9db
PGF exports the public, stable API.
PGF.Internal exports additional things needed in the GF compiler & shell,
including the nonstardard version of Data.Binary.
now we compile context-free grammars directly to PGF without going via GF source code. This makes it quick and lightweight to compile big grammars such as the Berkley grammar2014-05-24T07:47:06+00:00kr.angelovkr.angelov@gmail.com2014-05-24T07:47:06+00:00urn:sha1:67f64cb233edb899b2b1ad550ae8c832960fb7a2refactor the compilation of CFG and EBNF grammars. Now they are parsed by using GF.Grammar.Parser just like the ordinary GF grammars. Furthermore now GF.Speech.CFG is moved to GF.Grammar.CFG. The new module is used by both the speech conversion utils and by the compiler for CFG grammars. The parser for CFG now consumes a lot less memory and can be used with grammars with more than 4 000 000 productions.2014-03-21T21:25:05+00:00kr.angelovkr.angelov@gmail.com2014-03-21T21:25:05+00:00urn:sha1:51a9ef72c7e32f06d2413a5aea5751df2780063bGFC.hs: encodeFile_ is not available in the standard Data.Binary2014-02-04T13:36:16+00:00hallgrenhallgren@chalmers.se2014-02-04T13:36:16+00:00urn:sha1:3900d3cfbb47539a8acbd332cdea6a0b1a2f1a60