Text.LParse.Parser

This module implements LParse's core: The parser data structure, instances of the important typeclasses and functions to run the parser

Documentation

data Parser r t a

The Parser structure itself wraps a function from a collection of tokens (collectively of type t) to a double continuation giving back a string in case of an error (the error message) and a pair (a,t) in case of a success (the parsing result and rest of the input)

Constructors

Parser

Fields

• pFunc :: t -> DCont r String (a, t)

Instances

Arrow (Parser r)

Lifting a function to an arrow applies the function to the input. (***) executes two parsers in parallel, giving both results as a pair (but only if both succeed)

Defined in Text.LParse.Parser

Methods

arr :: (b -> c) -> Parser r b c

first :: Parser r b c -> Parser r (b, d) (c, d)

second :: Parser r b c -> Parser r (d, b) (d, c)

(***) :: Parser r b c -> Parser r b' c' -> Parser r (b, b') (c, c')

(&&&) :: Parser r b c -> Parser r b c' -> Parser r b (c, c')

Category (Parser r :: Type -> Type -> Type)

The identity parser returns the input. Concatenating two parsers means using the parsing result of the first as tokens for the second

Defined in Text.LParse.Parser

Methods

id :: Parser r a a

(.) :: Parser r b c -> Parser r a b -> Parser r a c

Monad (Parser r t)

returning a value means building a parser that consumes no input and just gives back the value (i.e. always succeeds) the bind operator means using the parser, creating a second parser from the result (with the given function) and then parsing with that. Both parsers successively consume input, i.e. consume "a" >>= (const $ consume "b") will consume the string "ab"

Defined in Text.LParse.Parser

Methods

(>>=) :: Parser r t a -> (a -> Parser r t b) -> Parser r t b

(>>) :: Parser r t a -> Parser r t b -> Parser r t b

return :: a -> Parser r t a

fail :: String -> Parser r t a

Functor (Parser r t)

via Monad/Functor laws

Defined in Text.LParse.Parser

Methods

fmap :: (a -> b) -> Parser r t a -> Parser r t b

(<$) :: a -> Parser r t b -> Parser r t a

Applicative (Parser r t)

via Monad/Applicative laws

Defined in Text.LParse.Parser

Methods

pure :: a -> Parser r t a

(<*>) :: Parser r t (a -> b) -> Parser r t a -> Parser r t b

liftA2 :: (a -> b -> c) -> Parser r t a -> Parser r t b -> Parser r t c

(*>) :: Parser r t a -> Parser r t b -> Parser r t b

(<*) :: Parser r t a -> Parser r t b -> Parser r t a

Alternative (Parser r t)

an empty parser in the sense of Alternative always fails and throws nothing. Branching between parsers means trying both in a row and taking the first one that succeeds

Defined in Text.LParse.Parser

Methods

empty :: Parser r t a

(<|>) :: Parser r t a -> Parser r t a -> Parser r t a

some :: Parser r t a -> Parser r t [a]

many :: Parser r t a -> Parser r t [a]

MonadPlus (Parser r t)

Defined via Alternative

Defined in Text.LParse.Parser

Methods

mzero :: Parser r t a

mplus :: Parser r t a -> Parser r t a -> Parser r t a

pfix :: (a -> Parser (Either String (a, t)) t a) -> Parser r t a

MonadFix-analogue for Parser, using the DCont function dfix

check :: Parser Bool t a -> t -> Bool

Runs the parser on the tokens and returns whether the parse succeeded. Results are discarded.

parse :: Parser r t a -> t -> (a -> r) -> (String -> r) -> r

Runs the parser on the tokens, using two functions to run the contained continuation

doParse :: Parser (Either String a) t a -> t -> Either String a

Same as parse, but giving back the results via Either

forceParse :: Parser a t a -> t -> a

Same as parse, but assuming the parsing succeeds, hard failing via undefined otherwise

debugParse :: Show a => Parser (IO ()) t a -> t -> IO ()

Runs the parser and prints the results

debugParse' :: Parser (IO ()) t a -> t -> (a -> IO ()) -> IO ()

Runs the parser and prints the results via a custom printing function