Text.Parsec.Prim

Documentation

unknownError :: State s u -> ParseError

sysUnExpectError :: String -> SourcePos -> Reply s u a

unexpected :: Stream s m t => String -> ParsecT s u m a

type ParsecT = ParsecDSL

runParsecT :: ParsecT s u m a -> ParsecDSL s u m a

mkPT :: Monad m => (State s u -> m (Consumed (m (Reply s u a)))) -> ParsecT s u m a

Low-level creation of the ParsecT type. You really shouldn't have to do this.

type Parsec s u = ParsecT s u Identity

data Consumed a :: * -> *

Constructors

Consumed a

Empty ~a

Instances

Functor Consumed

Methods

fmap :: (a -> b) -> Consumed a -> Consumed b

(<$) :: a -> Consumed b -> Consumed a

data Reply s u a :: * -> * -> * -> *

Constructors

Ok a ~(State s u) ParseError

Error ParseError

Instances

Functor (Reply s u)

Methods

fmap :: (a -> b) -> Reply s u a -> Reply s u b

(<$) :: a -> Reply s u b -> Reply s u a

data State s u :: * -> * -> *

Constructors

State

Fields

• stateInput :: s
• statePos :: ~SourcePos
• stateUser :: ~u

parsecMap :: (a -> b) -> ParsecT s u m a -> ParsecT s u m b

parserReturn :: a -> ParsecT s u m a

parserBind :: ParsecT s u m a -> (a -> ParsecT s u m b) -> ParsecT s u m b

mergeErrorReply :: ParseError -> Reply s u a -> Reply s u a

parserFail :: String -> ParsecT s u m a

parserZero :: ParsecT s u m a

parserPlus :: ParsecT s u m a -> ParsecT s u m a -> ParsecT s u m a

(<?>) :: ParsecT s u m a -> String -> ParsecT s u m a infix 0

(<|>) :: ParsecT s u m a -> ParsecT s u m a -> ParsecT s u m a infixr 1

label :: ParsecT s u m a -> String -> ParsecT s u m a

A synonym for <?>, but as a function instead of an operator.

labels :: ParsecT s u m a -> [String] -> ParsecT s u m a

lookAhead :: Stream s m t => ParsecT s u m a -> ParsecT s u m a

class Monad m => Stream s m t | s -> t where

An instance of Stream has stream type s, underlying monad m and token type t determined by the stream

Some rough guidelines for a "correct" instance of Stream:

• unfoldM uncons gives the [t] corresponding to the stream
• A Stream instance is responsible for maintaining the "position within the stream" in the stream state s. This is trivial unless you are using the monad in a non-trivial way.

Minimal complete definition

uncons

Methods

uncons :: s -> m (Maybe (t, s))

Instances

Monad m => Stream ByteString m Char

Methods

uncons :: ByteString -> m (Maybe (Char, ByteString))

Monad m => Stream ByteString m Char

Methods

uncons :: ByteString -> m (Maybe (Char, ByteString))

Monad m => Stream Text m Char

Methods

uncons :: Text -> m (Maybe (Char, Text))

Monad m => Stream Text m Char

Methods

uncons :: Text -> m (Maybe (Char, Text))

Monad m => Stream [tok] m tok

Methods

uncons :: [tok] -> m (Maybe (tok, [tok]))

tokens :: (Monad m, Stream s m t, Eq t) => ([t] -> String) -> (SourcePos -> [t] -> SourcePos) -> [t] -> ParsecT s u m [t]

try :: ParsecT s u m a -> ParsecT s u m a

token

Arguments

:: Stream s Identity t

=> (t -> String)

Token pretty-printing function.

-> (t -> SourcePos)

Computes the position of a token.

-> (t -> Maybe a)

Matching function for the token to parse.

-> Parsec s u a

tokenPrim

Arguments

:: Stream s m t

=> (t -> String)

Token pretty-printing function.

-> (SourcePos -> t -> s -> SourcePos)

Next position calculating function.

-> (t -> Maybe a)

Matching function for the token to parse.

-> ParsecT s u m a

tokenPrimEx :: Stream s m t => (t -> String) -> (SourcePos -> t -> s -> SourcePos) -> Maybe (SourcePos -> t -> s -> u -> u) -> (t -> Maybe a) -> ParsecT s u m a

many :: ParsecT s u m a -> ParsecT s u m [a]

skipMany :: ParsecT s u m a -> ParsecT s u m ()

manyAccum :: (a -> [a] -> [a]) -> ParsecT s u m a -> ParsecT s u m [a]

runPT :: (Monad m, Stream s m t) => ParsecT s u m a -> u -> SourceName -> s -> m (Either ParseError a)

runPTLog :: (MonadIO m, MonadReader LogType m, Stream s m t) => ParsecT s u m a -> u -> SourceName -> s -> m (Either ParseError a)

runP :: Stream s Identity t => Parsec s u a -> u -> SourceName -> s -> Either ParseError a

runParserT :: Stream s m t => ParsecT s u m a -> u -> SourceName -> s -> m (Either ParseError a)

runParserTLog :: (MonadIO m, MonadReader LogType m, Stream s m t) => ParsecT s u m a -> u -> SourceName -> s -> m (Either ParseError a)

runParser :: Stream s Identity t => Parsec s u a -> u -> SourceName -> s -> Either ParseError a

parse :: Stream s Identity t => Parsec s () a -> SourceName -> s -> Either ParseError a

parseTest :: (Stream s Identity t, Show a) => Parsec s () a -> s -> IO ()

parseTestLog :: (Stream s (ReaderT LogType IO) t, Show a) => ParsecT s () (ReaderT LogType IO) a -> s -> IO ()

getPosition :: Monad m => ParsecT s u m SourcePos

Returns the current source position. See also SourcePos.

getInput :: Monad m => ParsecT s u m s

Returns the current input

setPosition :: Monad m => SourcePos -> ParsecT s u m ()

setPosition pos sets the current source position to pos.

setInput :: Monad m => s -> ParsecT s u m ()

setInput input continues parsing with input. The getInput and setInput functions can for example be used to deal with #include files.

getParserState :: Monad m => ParsecT s u m (State s u)

Returns the full parser state as a State record.

setParserState :: Monad m => State s u -> ParsecT s u m (State s u)

setParserState st set the full parser state to st.

updateParserState :: Monad m => (State s u -> State s u) -> ParsecT s u m (State s u)

updateParserState f applies function f to the parser state.

getState :: Monad m => ParsecT s u m u

Returns the current user state.

putState :: Monad m => u -> ParsecT s u m ()

putState st set the user state to st.

modifyState :: Monad m => (u -> u) -> ParsecT s u m ()

modifyState f applies function f to the user state. Suppose that we want to count identifiers in a source, we could use the user state as:

 expr  = do{ x <- identifier
           ; modifyState (+1)
           ; return (Id x)
           }

setState :: Monad m => u -> ParsecT s u m ()

An alias for putState for backwards compatibility.

updateState :: Monad m => (u -> u) -> ParsecT s u m ()

An alias for modifyState for backwards compatibility.