ChristmasTree-0.1.2: Changing Haskell's Read Implementation Such That by Mainpulating Abstract Syntax Trees it Reads Expressions Efficiently

The ChristmasTree package

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

Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2, 0.2.1, 0.2.1.1
Dependenciesbase (≥2 & <4), containers, fgl (≥5.4), haskell98, template-haskell, TTTAS, uulib
LicenseLGPL
CopyrightUniversiteit Utrecht
MaintainerMarcos Viera <mviera@fing.edu.uy>
StabilityExperimental
CategoryParsing
Home pagehttp://www.cs.uu.nl/wiki/bin/view/Center/TTTAS
Upload dateWed Oct 14 17:50:16 UTC 2009
Uploaded byMarcosViera
Built onghc-6.10
Build failureghc-6.12 (log)

Modules

Downloads