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 ->
Thanks for the hint, I will try to implement the suggested monadic
structure.
As for the MonadState declaration:
If I put
instance MonadState PState Parser
then ghci complains:
Illegal instance declaration for 'MonadState PState Parser'
(The instance type must be of form
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 element
Brian Hulley wrote:
Chris Kuklewicz wrote:
Announcing: TextRegexLazy version 0.56
Where: Tarball from http://sourceforge.net/projects/lazy-regex
darcs get --partial http://evenmere.org/~chrisk/trl/stable/
License : BSD, except for
Great! - Thanks for all your hard work in making this av
Chris Kuklewicz wrote:
Announcing: TextRegexLazy version 0.56
Where: Tarball from http://sourceforge.net/projects/lazy-regex
darcs get --partial [--tag=0.56]
http://evenmere.org/~chrisk/trl/stable/ License : BSD, except for
Great! - Thanks for all your hard work in making this available
Ooops.
I just patched the efficiency of ByteStringPCRE to agree with the original
announcement.
Use
darcs get --partial http://evenmere.org/~chrisk/trl/stable/
to get the fixed version.
A new 0.57 tarball will go to sourceforge soon.
Chris Kuklewicz wrote:
Announcing: TextRegexLazy version
Announcing: TextRegexLazy version 0.56
Where: Tarball from http://sourceforge.net/projects/lazy-regex
darcs get --partial [--tag=0.56] http://evenmere.org/~chrisk/trl/stable/
License : BSD, except for DFAEngine.hs which is LGPL (derived from CTK light)
Development/unstable version is at:
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
new
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
new
