ChristmasTree

Alternative approach of 'read' that composes grammars instead of parsers.

http://www.cs.uu.nl/wiki/bin/view/Center/TTTAS

Latest on Hackage:

0.2.1.1

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

LicenseRef-LGPL licensed

Maintained by Marcos Viera

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.