Text.Parsec.Iteratee.LinkedList

Module providing simple implementation based on mutable linked list. It is optimised for longer parsers.

Documentation

class Monad m => Reference r m where

Class connecting mutable variable and monad it exists in.

Methods

newRef

Arguments

:: a

An initial value

-> m (r a)

Create new reference.

readRef

Arguments

:: r a

Reference

-> m a

Reads a reference.

writeRef

Arguments

:: r a

Reference

-> a

New value

-> m ()

Write to reference.

modifyRef

Arguments

:: r a

Reference

-> (a -> m (a, b))

Computation

-> m b

Result of computation

Modify the reference. Default implementation is provided but it MUST be overloaded if the reference is atomic to provide an atomic write.

Instances

Reference TVar STM

Reference IORef IO

Reference MVar IO

Reference (STRef s) (ST s)

data (Monad m, Reference r m) => Cursor r m s el

Cursor holds current value and reference to possible next cursor

Instances

(Monad m, Nullable s, Reference r m, ListLike s el) => Stream (Cursor r m s el) (Iteratee s m) el

data (Monad m, Reference r m, ListLike s el) => NextCursor r m s el

Specify the 3 possible states of next cursor - existence, non-existence and not being evaluated

mkCursor :: (Monad m, Reference r m, ListLike s el) => m (Cursor r m s el)

Creates new cursor

parsecIteratee

Arguments

:: (Monad m, Reference r m, Nullable c, ListLike c el)

=> ParsecT (Cursor r m c el) u (Iteratee c m) a

Parser to run

-> u

A user state

-> SourceName

Source name

-> Iteratee c m (Either ParseError a)

Runs parser. If it suceed the remaining part of stream stands in stream, however if it fails the stream is not in defined state.

safeParsecIteratee

Arguments

:: (Monad m, Reference r m, Nullable c, ListLike c el)

=> ParsecT (Cursor r m c el) u (Iteratee c m) a

Parser to run

-> u

A user state

-> SourceName

Source name

-> Iteratee c m (Either ParseError a)

Runs parser. If it suceed the remaining part of stream stands in stream, however if it fails everything stands in stream.