The ChristmasTree package
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.
Properties
| Versions | 0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2, 0.2.1, 0.2.1.1 |
|---|---|
| Dependencies | base (4.*), containers, fgl (5.4.2.*), template-haskell (≥2.4), TTTAS (≥0.4), uulib (≥0.9.11) |
| License | LGPL |
| Copyright | Universiteit Utrecht |
| Maintainer | Marcos Viera <mviera@fing.edu.uy> |
| Stability | Experimental |
| Category | Parsing |
| Home page | http://www.cs.uu.nl/wiki/bin/view/Center/TTTAS |
| Upload date | Wed Jan 23 15:25:07 UTC 2013 |
| Uploaded by | DoaitseSwierstra |
| Built on | ghc-7.6 |
Modules
Downloads
- ChristmasTree-0.2.1.1.tar.gz (Cabal source package)
- package description (included in the package)