Subject: Re: [Haskell] Monadic
parser combinators with logging
03.08.2006 02:54
On Thu, Aug 03, 2006 at 08:40:26AM +0200, Harald ROTTER wrote:
Thanks for the hint, I will try to implement the suggested monadic
structure.
I realized perhaps I should have made the hint slightly more explicit by
changing the name:
newtype ParserT m a = ParserT { runParserT :: (PState - m
Dear all,
I am a Haskell newbie and I try to find my way through Monad territory.
Actually I am studying the non-deterministic monadic parser combinators as
descibed by Hutton and Meijer. Although I find this very elegant
and concise I seem to have problems extending the parser monads.
I use
Dear all,
I am a Haskell newbie and I try to find my way through Monad territory.
Actually I am studying the non-deterministic monadic parser combinators as
descibed by Hutton and Meijer. Although I find this very elegant
and concise I seem to have problems extending the parser monads.
I use
On Wed, Aug 02, 2006 at 10:52:14AM +0200, Harald ROTTER wrote:
newtype Parser a = Parser { runParser :: (PState - [(a, PState)])}
as the parsing monad with the Parser state PState that contains the
remaining input after matching and possibly some additional user defined
state elements. I
