ChristmasTree: Alternative approach of 'read' that composes grammars instead of parsers.
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]
Versions [faq] | 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) [details] |
License | LicenseRef-LGPL |
Copyright | Universiteit Utrecht |
Author | |
Maintainer | Marcos Viera <mviera@fing.edu.uy> |
Category | Parsing |
Home page | http://www.cs.uu.nl/wiki/bin/view/Center/TTTAS |
Uploaded | by DoaitseSwierstra at 2013-01-23T15:25:07Z |
Distributions | NixOS:0.2.1.1 |
Downloads | 6431 total (3 in the last 30 days) |
Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |
Modules
[Index]
Downloads
- ChristmasTree-0.2.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)