ChristmasTree: Changing Haskell's Read Implementation Such That by Mainpulating Abstract Syntax Trees it Reads Expressions Efficiently
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]
Downloads
- ChristmasTree-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 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, containers, fgl (>=5.4), haskell98, template-haskell, TTTAS, uulib [details] |
| License | LicenseRef-LGPL |
| Copyright | Universiteit Utrecht |
| Author | |
| Maintainer | Marcos Viera <mviera@fing.edu.uy> |
| Uploaded | by MarcosViera at 2008-12-05T16:26:56Z |
| Category | Parsing |
| Home page | http://www.cs.uu.nl/wiki/bin/view/Center/TTTAS |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 7691 total (18 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] |