[email protected]
[Top] [All Lists]

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

Subject: Re: [Haskell-cafe] Continuable and serializable parsers.
From: Serguey Zefirov
Date: Fri, 25 Dec 2009 23:25:41 +0200
2009/12/25 Valery V. Vorotyntsev <[email protected]>:
>> 1) How to write a parser that could be restarted? Like, it will be
>> represented by a function that returns something along the lines
>>
>> data ParseStepResult input result =
>>    Success (Maybe (input -> ParseStepResult input result)) (Maybe result)
>>  | Failure
>>
>> (ie, parsers using stream combinators like Fudgets have that property)
>> ie, either a continuation of parsing process and result or failure flag.
>
> I think you're looking for `iteratees'.

I am looking more for the way to serialize intermediate parser
computations. The first problem is, actually, easy one. ;)
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe

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