gf-core.git/src/runtime/haskell/PGF/Morphology.hs, branch optimizeUnnamed repository; edit this file 'description' to name the repository.
https://git.adelon.net/gf-core.git/atom?h=optimize2013-11-05T13:11:10+00:00Eliminate mutual dependencies between the GF compiler and the PGF library2013-11-05T13:11:10+00:00hallgrenhallgren@chalmers.se2013-11-05T13:11:10+00:00urn:sha1:3814841d7d3b77b3f033cb98c1c0a04ac39435d7
+ References to modules under src/compiler have been eliminated from the PGF
library (under src/runtime/haskell). Only two functions had to be moved (from
GF.Data.Utilities to PGF.Utilities) to make this possible, other apparent
dependencies turned out to be vacuous.
+ In gf.cabal, the GF executable no longer directly depends on the PGF library
source directory, but only on the exposed library modules. This means that
there is less duplication in gf.cabal and that the 30 modules in the
PGF library will no longer be compiled twice while building GF.
To make this possible, additional PGF library modules have been exposed, even
though they should probably be considered for internal use only. They could
be collected in a PGF.Internal module, or marked as "unstable", to make
this explicit.
+ Also, by using the -fwarn-unused-imports flag, ~220 redundant imports were
found and removed, reducing the total number of imports by ~15%.
a major refactoring in the C and the Haskell runtimes. Note incompatible change in the PGF format!!!2013-09-27T15:09:48+00:00kr.angelovkr.angelov@gmail.com2013-09-27T15:09:48+00:00urn:sha1:426bc49a52b4efa0ef0129d713842d8c9abdf0ff
The following are the outcomes:
- Predef.nonExist is fully supported by both the Haskell and the C runtimes
- Predef.BIND is now an internal compiler defined token. For now
it behaves just as usual for the Haskell runtime, i.e. it generates &+.
However, the special treatment will let us to handle it properly in
the C runtime.
- This required a major change in the PGF format since both
nonExist and BIND may appear inside 'pre' and this was not supported
before.
command option ma -known to drop unknown words2012-06-10T10:43:57+00:00aarneaarne@chalmers.se2012-06-10T10:43:57+00:00urn:sha1:191ecc71b8b4645caf992822e18d4b506f0e55a4a simple clitic analysis command 'ca'2011-02-06T16:19:24+00:00aarneaarne@chalmers.se2011-02-06T16:19:24+00:00urn:sha1:7445e5638713276b471a0c8d5a53940704e8239doptimization in the parser for large lexicons. Now, the parser is slightly slower for grammars with a small lexicon but 3-4 times faster for the English Resource Grammar used in combination with Oxford Advanced Learners Dictionary2010-12-14T08:46:22+00:00krasimirkrasimir@chalmers.se2010-12-14T08:46:22+00:00urn:sha1:7d58efb6600d164101c439cf8954de637ea35c34in example-based grammar conversion, warnings about unknown words2010-01-28T10:06:16+00:00aarneaarne@chalmers.se2010-01-28T10:06:16+00:00urn:sha1:e056cc2bfd2e5e152edd9829b8d4d77637536a14cleanup the code of the PGF interpreter and polish the binary serialization to match the preliminary specification2010-01-27T09:39:14+00:00krasimirkrasimir@chalmers.se2010-01-27T09:39:14+00:00urn:sha1:890d45579300f39d50a5a18a9f6feed8634ae8baPGF is now real synchronous PMCFG2010-01-17T21:35:36+00:00krasimirkrasimir@chalmers.se2010-01-17T21:35:36+00:00urn:sha1:9b362ff231efbd43ffb4f1c6285c41a34caf3777now the linearization is completely based on PMCFG2010-01-17T17:05:21+00:00krasimirkrasimir@chalmers.se2010-01-17T17:05:21+00:00urn:sha1:af13bae2dfb9adaa7c4aa273961fc09cc7ba1b7areorganize the directories under src, and rescue the JavaScript interpreter from deprecated2009-12-13T18:50:29+00:00krasimirkrasimir@chalmers.se2009-12-13T18:50:29+00:00urn:sha1:f85232947e74ee7ef8c7b0ad2338212e7e68f1be