gf-core.git/src/compiler/GF/Grammar/Grammar.hs, branch optimize Unnamed repository; edit this file 'description' to name the repository. https://git.adelon.net/gf-core.git/atom?h=optimize 2022-10-04T15:01:47+00:00 Extract the previous optimization to its own function 2022-10-04T15:01:47+00:00 Andreas Källberg anka.213@gmail.com 2022-10-02T19:57:11+00:00 urn:sha1:a58c6d49d4b5d5cf750c36c9071279fccd9c468f Use a Set in isInherited to speed up long extend lists 2022-10-04T15:01:47+00:00 Andreas Källberg anka.213@gmail.com 2022-10-02T19:49:56+00:00 urn:sha1:fef7b80d8e988f6ad8de720a9e3a1098bc5f8a3a Now the time is O(log(n)*m) instead of O(n*m) where n is the number of items in the extend list e.g. abstract FromWordNet = WordNet [ a_couple_Card, a_la_carte_Adv, a_la_mode_Adv, a_little_Card, ... ]; Preliminary new shell feature: cc -trace. 2015-09-28T22:23:56+00:00 hallgren hallgren@chalmers.se 2015-09-28T22:23:56+00:00 urn:sha1:35be1828241bb8dacdf326810af388b7b349e591 You can now do things like cc -trace mkV "debug" to see a trace of all opers with their arguments and results during the computation of mkV "debug". Comment out some dead code found with -fwarn-unused-binds 2015-08-28T13:59:43+00:00 hallgren hallgren@chalmers.se 2015-08-28T13:59:43+00:00 urn:sha1:5bfaf10de597af504e6d2784309e533b09a6451c Also fixed some warnings and tightened some imports Various small changes for improved documentation 2014-10-22T15:45:52+00:00 hallgren hallgren@chalmers.se 2014-10-22T15:45:52+00:00 urn:sha1:6ee67cd04ffbce375d7f10e74a5d9eb742d6428d ModuleName and Ident are now distinct types 2014-10-21T19:20:31+00:00 hallgren hallgren@chalmers.se 2014-10-21T19:20:31+00:00 urn:sha1:391b301881bee7de9580f2c6d819144161e6a51d This makes the documentation clearer, and can potentially catch more programming mistakes. Renaming SourceGrammar to Grammar and similarly for some related types 2014-10-21T14:42:31+00:00 hallgren hallgren@chalmers.se 2014-10-21T14:42:31+00:00 urn:sha1:3bfcfa157dc291e03bfb4db3baed8b0098d76f50 Included renamings: SourceGrammar -> Grammar SourceModule -> Module SourceModInfo -> ModuleInfo emptySourceGrammar -> emptyGrammar Also introduces a type synonym (which might be good to turn into a newtype): type ModuleName = Ident The reason is to make types like the following more self documenting: type Module = (ModuleName,ModuleInfo) type QIdent = (ModuleName,Ident) More haddock documentation improvements 2014-10-16T14:03:57+00:00 hallgren hallgren@chalmers.se 2014-10-16T14:03:57+00:00 urn:sha1:c924491289259fa8a5a259ed97f2d9e817e3338c Introducing GF.Text.Pretty for more concise pretty printers and GF.Infra.Location for modularity 2014-07-27T22:06:23+00:00 hallgren hallgren@chalmers.se 2014-07-27T22:06:23+00:00 urn:sha1:30cda5151651e712803527b6ab4e5abc07536f2c GF.Text.Pretty provides the class Pretty and overloaded versions of the pretty printing combinators in Text.PrettyPrint, allowing pretty printable values to be used directly instead of first having to convert them to Doc with functions like text, int, char and ppIdent. Some modules have been converted to use GF.Text.Pretty, but not all. Precedences could be added to simplify the pretty printers for terms and patterns. GF.Infra.Location contains the types Location and L, factored out from GF.Grammar.Grammar, and the class HasSourcePath. This allowed the import of GF.Grammar.Grammar to be removed from GF.Infra.CheckM, making it more like a pure library module. PGF library: expose only PGF and PGF.Internal instead of all modules 2014-06-12T14:43:18+00:00 hallgren hallgren@chalmers.se 2014-06-12T14:43:18+00:00 urn: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.