The ChristmasTree package

[Tags: lgpl, library]

ChristmasTree (Changing Haskell's Read Implementation Such That by Mainpulating ASTs it Reads Expressions Efficiently) is an alternative approach of read that composes grammars instead of parsers. It reads data in linear time, while the function read has an exponential behavior in some cases of data types with infix operators.

[Skip to ReadMe]


Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2, 0.2.1,
Change logNone available
Dependenciesbase (==4.*), containers, fgl (==5.4.2.*), template-haskell (>=2.4), TTTAS (>=0.4), uulib (>=0.9.11) [details]
CopyrightUniversiteit Utrecht
MaintainerMarcos Viera <>
Home page
UploadedWed Jan 23 15:25:07 UTC 2013 by DoaitseSwierstra
Downloads1737 total (63 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees

Readme for ChristmasTree-

Please check the right section in this file for instructions depending on how you obtained the source files.

Installing ChristmasTree from a source distribution

  The source distribution can be unpacked from the
  .tar.gz files distributed in the following page:

  System wide installation (assumming GHC is the
  Haskell compiler) can be done like this:

    ghc --make Setup.hs -o setup -package Cabal
    ./setup configure
    ./setup build
    ./setup install

Installing uulib to a non-standard location

  This is useful if you don't want (or can't)
  modify system wide settings.

    ghc --make Setup.hs -o setup -package Cabal
    ./setup configure --prefix=/foo
    ./setup build
    ./setup install --user

  The last command registers the package only for
  the user.

Optionally generating Haddock Documentation

  Output generated in dist/doc/html

    ./setup haddock