gf-core.git/src/runtime/haskell/PGF/Expr.hs, branch masterUnnamed repository; edit this file 'description' to name the repository.
https://git.adelon.net/gf-core.git/atom?h=master2025-02-18T11:41:14+00:00Bug fix for gf-shell command 'pt -compute' in Expr.hs by2025-02-18T11:41:14+00:00Hans Leissleiss@cis.uni-muenchen.de2025-02-18T11:41:14+00:00urn:sha1:643617ccc4faafa659aa16fae2870ac68a8f394b
tryMatch p (VConst _ _) env = match sig f eqs as0
showExpr and linearize now refresh the printed variables if needed2024-03-01T08:17:08+00:00aarnerantaaarne@chalmers.se2024-03-01T08:17:08+00:00urn:sha1:7e707508a72ce73d6c3e4b8881df37597f5b8801GF.Command.TreeOperations is now independent from the runtime's internals2017-09-05T08:29:02+00:00Krasimir Angelovkr.angelov@gmail.com2017-09-05T08:29:02+00:00urn:sha1:01a8e1b88f190a6170512efd303981e98b4b3134the embedded grammars now work with both the pure Haskell and the Haskell binding API2017-08-29T16:44:50+00:00Krasimir Angelovkr.angelov@gmail.com2017-08-29T16:44:50+00:00urn:sha1:b7b7a7c91cc861440dd541b5f4e9eb5b409bcce0a major revision of the bytecode generator and JIT compiler. the effect is that now we can compute with lambda functions and with true tail recursion2014-09-11T15:39:39+00:00kr.angelovkr.angelov@gmail.com2014-09-11T15:39:39+00:00urn:sha1:621d748bac0914a93e3d399f81616c70fd083bb5full support for recursive def rules in the C runtime2014-09-05T10:09:43+00:00kr.angelovkr.angelov@gmail.com2014-09-05T10:09:43+00:00urn:sha1:86b5f78c579ce5fcc9c96370644c41c35a421070a 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.
linearization by chunks in the GF shell: a new command 'lc' needed because 'l' requires type checking and trees with metavariable function heads don't type check. This will hopefully be a temporary command.2013-11-05T17:28:47+00:00aarneaarne@chalmers.se2013-11-05T17:28:47+00:00urn:sha1:aba666c5bc7a46cdc7de7e2a36869456c34909bdEliminate 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 basic infrastructure for generating Teyjus bytecode from the GF abstract syntax2012-08-29T11:43:02+00:00kr.angelovkr.angelov@gmail.com2012-08-29T11:43:02+00:00urn:sha1:f8fe23fda7b97d5301bfb2ec1d89ce9967c5b200