Are Happy-generated parsers lazy?

John Meacham john@foo.net
Wed, 8 May 2002 02:13:40 -0700


I do not believe they are, as they are optimized for performance, even
if they were lazy, the check for the error condition right after the
parse would immediatly evaluate the whole parse tree to check for
errors, probably the best route is to use/roll your own parser
combinator library. they are pretty easy if you are comfortable with
monads, and can be made lazy. xml might be simple enough to just write a
parser by hand too. if you want an efficient data-exchange format and
you can wait a bit i am going to make a release of my XDR library soon,
useful for both exchanging data in a machine/time independant format or
communicating with known network protocols such as nfs.
	John

On Wed, May 08, 2002 at 10:41:19AM +0200, Michael Marte wrote:
> Hello,
> 
> I am running into trouble with the HaXml parser because it is not lazy.
> Hence I am considering to abondon the use of XML as data-exchange
> format. Anyway, XML documents are too verbose.
> 
> Now I wonder whether Happy-generated parsers are lazy?
> 
> Michael
> 
> 
> 
> _______________________________________________
> Haskell mailing list
> Haskell@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell
> 

-- 
---------------------------------------------------------------------------
John Meacham - California Institute of Technology, Alum. - john@foo.net
---------------------------------------------------------------------------