[email protected]
[Top] [All Lists]

Re: [Haskell-cafe] Continuable and serializable parsers.

Subject: Re: [Haskell-cafe] Continuable and serializable parsers.
From: Serguey Zefirov
Date: Sat, 26 Dec 2009 00:04:23 +0200
2009/12/25 Felipe Lessa <[email protected]>:
>> I am looking more for the way to serialize intermediate parser
>> computations. The first problem is, actually, easy one. ;)
>
> Probably you'll have to create a data constructor for each step
> of your parser.
>
> AFAIK, one of HAppS modules does a similar transformation via
> Template Haskell.  The functions specify transactions, and each
> transaction is converted to a serializable data type.  Then it's
> possible to create a transaction log by serializing them before
> their execution.
>
> Of course you could also modify Happy instead of writing a TH
> transformation.  Both are preprocessor.  TH would be more
> convenient, though.

Thank you very much.

I think, I will try Template Haskell approach, I prefer combinators
over the generators.
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe

<Prev in Thread] Current Thread [Next in Thread>