Text.Megaparsec

Description

This module includes everything you need to get started writing a parser. If you are new to Megaparsec and don't know where to begin, take a look at the tutorials https://markkarpov.com/learn-haskell.html#megaparsec-tutorials.

In addition to the Text.Megaparsec module, which exports and re-exports most everything that you may need, we advise to import Text.Megaparsec.Char if you plan to work with a stream of Char tokens or Text.Megaparsec.Byte if you intend to parse binary data.

It is common to start working with the library by defining a type synonym like this:

type Parser = Parsec Void Text
^    ^
|    |
Custom error component    Input stream type

Then you can write type signatures like Parser Int—for a parser that returns an Int for example.

Similarly (since it's known to cause confusion), you should use ParseErrorBundle type parametrized like this:

ParseErrorBundle Text Void
^    ^
|    |
Input stream type    Custom error component (the same you used in Parser)

Megaparsec uses some type-level machinery to provide flexibility without compromising on type safety. Thus type signatures are sometimes necessary to avoid ambiguous types. If you're seeing an error message that reads like “Type variable e0 is ambiguous …”, you need to give an explicit signature to your parser to resolve the ambiguity. It's a good idea to provide type signatures for all top-level definitions.

Synopsis

# Re-exports

Note that we re-export monadic combinators from Control.Monad.Combinators because these are more efficient than Applicative-based ones. Thus many and some may clash with the functions from Control.Applicative. You need to hide the functions like this:

import Control.Applicative hiding (many, some)

Also note that you can import Control.Monad.Combinators.NonEmpty if you wish that combinators like some return NonEmpty lists. The module lives in the parser-combinators package (you need at least version 0.4.0).

This module is intended to be imported qualified:

import qualified Control.Monad.Combinators.NonEmpty as NE

Other modules of interest are:

# Data types

data State s Source #

This is the Megaparsec's state parametrized over stream type s.

Constructors

 State FieldsstateInput :: sThe rest of input to processstateOffset :: !IntNumber of processed tokens so farSince: 7.0.0statePosState :: PosState sState that is used for line/column calculationSince: 7.0.0
Instances
 Eq s => Eq (State s) Source # Instance detailsDefined in Text.Megaparsec.State Methods(==) :: State s -> State s -> Bool #(/=) :: State s -> State s -> Bool # Data s => Data (State s) Source # Instance detailsDefined in Text.Megaparsec.State Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> State s -> c (State s) #gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (State s) #toConstr :: State s -> Constr #dataTypeOf :: State s -> DataType #dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (State s)) #dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (State s)) #gmapT :: (forall b. Data b => b -> b) -> State s -> State s #gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> State s -> r #gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> State s -> r #gmapQ :: (forall d. Data d => d -> u) -> State s -> [u] #gmapQi :: Int -> (forall d. Data d => d -> u) -> State s -> u #gmapM :: Monad m => (forall d. Data d => d -> m d) -> State s -> m (State s) #gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> State s -> m (State s) #gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> State s -> m (State s) # Show s => Show (State s) Source # Instance detailsDefined in Text.Megaparsec.State MethodsshowsPrec :: Int -> State s -> ShowS #show :: State s -> String #showList :: [State s] -> ShowS # Generic (State s) Source # Instance detailsDefined in Text.Megaparsec.State Associated Typestype Rep (State s) :: Type -> Type # Methodsfrom :: State s -> Rep (State s) x #to :: Rep (State s) x -> State s # NFData s => NFData (State s) Source # Instance detailsDefined in Text.Megaparsec.State Methodsrnf :: State s -> () # type Rep (State s) Source # Instance detailsDefined in Text.Megaparsec.State type Rep (State s) = D1 (MetaData "State" "Text.Megaparsec.State" "megaparsec-7.0.5-Gn6hBXoFgoh4KamQ3srNHL" False) (C1 (MetaCons "State" PrefixI True) (S1 (MetaSel (Just "stateInput") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 s) :*: (S1 (MetaSel (Just "stateOffset") SourceUnpack SourceStrict DecidedStrict) (Rec0 Int) :*: S1 (MetaSel (Just "statePosState") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (PosState s)))))

data PosState s Source #

Special kind of state that is used to calculate line/column positions on demand.

Since: 7.0.0

Constructors

 PosState FieldspstateInput :: sThe rest of input to processpstateOffset :: !IntOffset corresponding to beginning of pstateInputpstateSourcePos :: !SourcePosSource position corresponding to beginning of pstateInputpstateTabWidth :: PosTab width to use for column calculationpstateLinePrefix :: StringPrefix to prepend to offending line
Instances
 Eq s => Eq (PosState s) Source # Instance detailsDefined in Text.Megaparsec.State Methods(==) :: PosState s -> PosState s -> Bool #(/=) :: PosState s -> PosState s -> Bool # Data s => Data (PosState s) Source # Instance detailsDefined in Text.Megaparsec.State Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PosState s -> c (PosState s) #gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (PosState s) #toConstr :: PosState s -> Constr #dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (PosState s)) #dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (PosState s)) #gmapT :: (forall b. Data b => b -> b) -> PosState s -> PosState s #gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PosState s -> r #gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PosState s -> r #gmapQ :: (forall d. Data d => d -> u) -> PosState s -> [u] #gmapQi :: Int -> (forall d. Data d => d -> u) -> PosState s -> u #gmapM :: Monad m => (forall d. Data d => d -> m d) -> PosState s -> m (PosState s) #gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PosState s -> m (PosState s) #gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PosState s -> m (PosState s) # Show s => Show (PosState s) Source # Instance detailsDefined in Text.Megaparsec.State MethodsshowsPrec :: Int -> PosState s -> ShowS #show :: PosState s -> String #showList :: [PosState s] -> ShowS # Source # Instance detailsDefined in Text.Megaparsec.State Associated Typestype Rep (PosState s) :: Type -> Type # Methodsfrom :: PosState s -> Rep (PosState s) x #to :: Rep (PosState s) x -> PosState s # NFData s => NFData (PosState s) Source # Instance detailsDefined in Text.Megaparsec.State Methodsrnf :: PosState s -> () # type Rep (PosState s) Source # Instance detailsDefined in Text.Megaparsec.State type Rep (PosState s) = D1 (MetaData "PosState" "Text.Megaparsec.State" "megaparsec-7.0.5-Gn6hBXoFgoh4KamQ3srNHL" False) (C1 (MetaCons "PosState" PrefixI True) ((S1 (MetaSel (Just "pstateInput") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 s) :*: S1 (MetaSel (Just "pstateOffset") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 Int)) :*: (S1 (MetaSel (Just "pstateSourcePos") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 SourcePos) :*: (S1 (MetaSel (Just "pstateTabWidth") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Pos) :*: S1 (MetaSel (Just "pstateLinePrefix") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 String)))))

type Parsec e s = ParsecT e s Identity Source #

Parsec is a non-transformer variant of the more general ParsecT monad transformer.

data ParsecT e s m a Source #

ParsecT e s m a is a parser with custom data component of error e, stream type s, underlying monad m and return type a.

Instances
 (Ord e, Stream s) => MonadParsec e s (ParsecT e s m) Source # Instance detailsDefined in Text.Megaparsec.Internal Methodsfailure :: Maybe (ErrorItem (Token s)) -> Set (ErrorItem (Token s)) -> ParsecT e s m a Source #fancyFailure :: Set (ErrorFancy e) -> ParsecT e s m a Source #label :: String -> ParsecT e s m a -> ParsecT e s m a Source #hidden :: ParsecT e s m a -> ParsecT e s m a Source #try :: ParsecT e s m a -> ParsecT e s m a Source #lookAhead :: ParsecT e s m a -> ParsecT e s m a Source #notFollowedBy :: ParsecT e s m a -> ParsecT e s m () Source #withRecovery :: (ParseError s e -> ParsecT e s m a) -> ParsecT e s m a -> ParsecT e s m a Source #observing :: ParsecT e s m a -> ParsecT e s m (Either (ParseError s e) a) Source #eof :: ParsecT e s m () Source #token :: (Token s -> Maybe a) -> Set (ErrorItem (Token s)) -> ParsecT e s m a Source #tokens :: (Tokens s -> Tokens s -> Bool) -> Tokens s -> ParsecT e s m (Tokens s) Source #takeWhileP :: Maybe String -> (Token s -> Bool) -> ParsecT e s m (Tokens s) Source #takeWhile1P :: Maybe String -> (Token s -> Bool) -> ParsecT e s m (Tokens s) Source #takeP :: Maybe String -> Int -> ParsecT e s m (Tokens s) Source #getParserState :: ParsecT e s m (State s) Source #updateParserState :: (State s -> State s) -> ParsecT e s m () Source # (Stream s, MonadState st m) => MonadState st (ParsecT e s m) Source # Instance detailsDefined in Text.Megaparsec.Internal Methodsget :: ParsecT e s m st #put :: st -> ParsecT e s m () #state :: (st -> (a, st)) -> ParsecT e s m a # (Stream s, MonadReader r m) => MonadReader r (ParsecT e s m) Source # Instance detailsDefined in Text.Megaparsec.Internal Methodsask :: ParsecT e s m r #local :: (r -> r) -> ParsecT e s m a -> ParsecT e s m a #reader :: (r -> a) -> ParsecT e s m a # (Stream s, MonadError e' m) => MonadError e' (ParsecT e s m) Source # Instance detailsDefined in Text.Megaparsec.Internal MethodsthrowError :: e' -> ParsecT e s m a #catchError :: ParsecT e s m a -> (e' -> ParsecT e s m a) -> ParsecT e s m a # MonadTrans (ParsecT e s) Source # Instance detailsDefined in Text.Megaparsec.Internal Methodslift :: Monad m => m a -> ParsecT e s m a # Stream s => Monad (ParsecT e s m) Source # return returns a parser that succeeds without consuming input. Instance detailsDefined in Text.Megaparsec.Internal Methods(>>=) :: ParsecT e s m a -> (a -> ParsecT e s m b) -> ParsecT e s m b #(>>) :: ParsecT e s m a -> ParsecT e s m b -> ParsecT e s m b #return :: a -> ParsecT e s m a #fail :: String -> ParsecT e s m a # Functor (ParsecT e s m) Source # Instance detailsDefined in Text.Megaparsec.Internal Methodsfmap :: (a -> b) -> ParsecT e s m a -> ParsecT e s m b #(<$) :: a -> ParsecT e s m b -> ParsecT e s m a # (Stream s, MonadFix m) => MonadFix (ParsecT e s m) Source # Since: 6.0.0 Instance detailsDefined in Text.Megaparsec.Internal Methodsmfix :: (a -> ParsecT e s m a) -> ParsecT e s m a # Stream s => MonadFail (ParsecT e s m) Source # Instance detailsDefined in Text.Megaparsec.Internal Methodsfail :: String -> ParsecT e s m a # Stream s => Applicative (ParsecT e s m) Source # pure returns a parser that succeeds without consuming input. Instance detailsDefined in Text.Megaparsec.Internal Methodspure :: a -> ParsecT e s m a #(<*>) :: ParsecT e s m (a -> b) -> ParsecT e s m a -> ParsecT e s m b #liftA2 :: (a -> b -> c) -> ParsecT e s m a -> ParsecT e s m b -> ParsecT e s m c #(*>) :: ParsecT e s m a -> ParsecT e s m b -> ParsecT e s m b #(<*) :: ParsecT e s m a -> ParsecT e s m b -> ParsecT e s m a # (Stream s, MonadIO m) => MonadIO (ParsecT e s m) Source # Instance detailsDefined in Text.Megaparsec.Internal MethodsliftIO :: IO a -> ParsecT e s m a # (Ord e, Stream s) => Alternative (ParsecT e s m) Source # empty is a parser that fails without consuming input. Instance detailsDefined in Text.Megaparsec.Internal Methodsempty :: ParsecT e s m a #(<|>) :: ParsecT e s m a -> ParsecT e s m a -> ParsecT e s m a #some :: ParsecT e s m a -> ParsecT e s m [a] #many :: ParsecT e s m a -> ParsecT e s m [a] # (Ord e, Stream s) => MonadPlus (ParsecT e s m) Source # mzero is a parser that fails without consuming input. Instance detailsDefined in Text.Megaparsec.Internal Methodsmzero :: ParsecT e s m a #mplus :: ParsecT e s m a -> ParsecT e s m a -> ParsecT e s m a # (Stream s, MonadCont m) => MonadCont (ParsecT e s m) Source # Instance detailsDefined in Text.Megaparsec.Internal MethodscallCC :: ((a -> ParsecT e s m b) -> ParsecT e s m a) -> ParsecT e s m a # (a ~ Tokens s, IsString a, Eq a, Stream s, Ord e) => IsString (ParsecT e s m a) Source # Since: 6.3.0 Instance detailsDefined in Text.Megaparsec.Internal MethodsfromString :: String -> ParsecT e s m a # (Stream s, Semigroup a) => Semigroup (ParsecT e s m a) Source # Since: 5.3.0 Instance detailsDefined in Text.Megaparsec.Internal Methods(<>) :: ParsecT e s m a -> ParsecT e s m a -> ParsecT e s m a #sconcat :: NonEmpty (ParsecT e s m a) -> ParsecT e s m a #stimes :: Integral b => b -> ParsecT e s m a -> ParsecT e s m a # (Stream s, Monoid a) => Monoid (ParsecT e s m a) Source # Since: 5.3.0 Instance detailsDefined in Text.Megaparsec.Internal Methodsmempty :: ParsecT e s m a #mappend :: ParsecT e s m a -> ParsecT e s m a -> ParsecT e s m a #mconcat :: [ParsecT e s m a] -> ParsecT e s m a # # Running parser Arguments  :: Parsec e s a Parser to run -> String Name of source file -> s Input for parser -> Either (ParseErrorBundle s e) a parse p file input runs parser p over Identity (see runParserT if you're using the ParsecT monad transformer; parse itself is just a synonym for runParser). It returns either a ParseErrorBundle (Left) or a value of type a (Right). errorBundlePretty can be used to turn ParseErrorBundle into the string representation of the error message. See Text.Megaparsec.Error if you need to do more advanced error analysis. main = case parse numbers "" "11,2,43" of Left bundle -> putStr (errorBundlePretty bundle) Right xs -> print (sum xs) numbers = decimal sepBy char ',' parseMaybe :: (Ord e, Stream s) => Parsec e s a -> s -> Maybe a Source # parseMaybe p input runs the parser p on input and returns the result inside Just on success and Nothing on failure. This function also parses eof, so if the parser doesn't consume all of its input, it will fail. The function is supposed to be useful for lightweight parsing, where error messages (and thus file names) are not important and entire input should be parsed. For example, it can be used when parsing of a single number according to a specification of its format is desired. Arguments  :: (ShowErrorComponent e, Show a, Stream s) => Parsec e s a Parser to run -> s Input for parser -> IO () The expression parseTest p input applies the parser p against the input input and prints the result to stdout. Useful for testing. Arguments  :: Parsec e s a Parser to run -> String Name of source file -> s Input for parser -> Either (ParseErrorBundle s e) a runParser p file input runs parser p on the input stream of tokens input, obtained from source file. The file is only used in error messages and may be the empty string. Returns either a ParseErrorBundle (Left) or a value of type a (Right). parseFromFile p file = runParser p file <$> readFile file

Arguments

 :: Parsec e s a Parser to run -> State s Initial state -> (State s, Either (ParseErrorBundle s e) a)

The function is similar to runParser with the difference that it accepts and returns parser state. This allows to specify arbitrary textual position at the beginning of parsing, for example. This is the most general way to run a parser over the Identity monad.

Since: 4.2.0

Arguments

 :: Monad m => ParsecT e s m a Parser to run -> String Name of source file -> s Input for parser -> m (Either (ParseErrorBundle s e) a)

runParserT p file input runs parser p on the input list of tokens input, obtained from source file. The file is only used in error messages and may be the empty string. Returns a computation in the underlying monad m that returns either a ParseErrorBundle (Left) or a value of type a (Right).

Arguments

 :: Monad m => ParsecT e s m a Parser to run -> State s Initial state -> m (State s, Either (ParseErrorBundle s e) a)

This function is similar to runParserT, but like runParser' it accepts and returns parser state. This is thus the most general way to run a parser.

Since: 4.2.0

# Primitive combinators

class (Stream s, MonadPlus m) => MonadParsec e s m | m -> e s where Source #

Type class describing monads that implement the full set of primitive parsers.

Note carefully that the following primitives are “fast” and should be taken advantage of as much as possible if your aim is a fast parser: tokens, takeWhileP, takeWhile1P, and takeP.

Minimal complete definition

Methods

Arguments

 :: Maybe (ErrorItem (Token s)) Unexpected item (if any) -> Set (ErrorItem (Token s)) Expected items -> m a

The most general way to stop parsing and report a trivial ParseError.

Since: 6.0.0

Arguments

 :: Set (ErrorFancy e) Fancy error components -> m a

The most general way to stop parsing and report a fancy ParseError. To report a single custom parse error, see customFailure.

Since: 6.0.0

label :: String -> m a -> m a Source #

The parser label name p behaves as parser p, but whenever the parser p fails without consuming any input, it replaces names of “expected” tokens with the name name.

hidden :: m a -> m a Source #

hidden p behaves just like parser p, but it doesn't show any “expected” tokens in error message when p fails.

Please use hidden instead of the old label "" idiom.

try :: m a -> m a Source #

The parser try p behaves like parser p, except that it backtracks the parser state when p fails (either consuming input or not).

This combinator is used whenever arbitrary look ahead is needed. Since it pretends that it hasn't consumed any input when p fails, the (<|>) combinator will try its second alternative even if the first parser failed while consuming input.

For example, here is a parser that is supposed to parse the word “let” or the word “lexical”:

>>> parseTest (string "let" <|> string "lexical") "lexical"
1:1:
unexpected "lex"
expecting "let"


What happens here? The first parser consumes “le” and fails (because it doesn't see a “t”). The second parser, however, isn't tried, since the first parser has already consumed some input! try fixes this behavior and allows backtracking to work:

>>> parseTest (try (string "let") <|> string "lexical") "lexical"
"lexical"


try also improves error messages in case of overlapping alternatives, because Megaparsec's hint system can be used:

>>> parseTest (try (string "let") <|> string "lexical") "le"
1:1:
unexpected "le"
expecting "let" or "lexical"


Please note that as of Megaparsec 4.4.0, string backtracks automatically (see tokens), so it does not need try. However, the examples above demonstrate the idea behind try so well that it was decided to keep them. You still need to use try when your alternatives are complex, composite parsers.

lookAhead :: m a -> m a Source #

If p in lookAhead p succeeds (either consuming input or not) the whole parser behaves like p succeeded without consuming anything (parser state is not updated as well). If p fails, lookAhead has no effect, i.e. it will fail consuming input if p fails consuming input. Combine with try if this is undesirable.

notFollowedBy :: m a -> m () Source #

notFollowedBy p only succeeds when the parser p fails. This parser never consumes any input and never modifies parser state. It can be used to implement the “longest match” rule.

Arguments

 :: (ParseError s e -> m a) How to recover from failure -> m a Original parser -> m a Parser that can recover from failures

withRecovery r p allows continue parsing even if parser p fails. In this case r is called with the actual ParseError as its argument. Typical usage is to return a value signifying failure to parse this particular object and to consume some part of the input up to the point where the next object starts.

Note that if r fails, original error message is reported as if without withRecovery. In no way recovering parser r can influence error messages.

Since: 4.4.0

Arguments

 :: m a The parser to run -> m (Either (ParseError s e) a)

observing p allows to “observe” failure of the p parser, should it happen, without actually ending parsing but instead getting the ParseError in Left. On success parsed value is returned in Right as usual. Note that this primitive just allows you to observe parse errors as they happen, it does not backtrack or change how the p parser works in any way.

Since: 5.1.0

eof :: m () Source #

This parser only succeeds at the end of input.

Arguments

 :: (Token s -> Maybe a) Matching function for the token to parse -> Set (ErrorItem (Token s)) Expected items (in case of an error) -> m a

The parser token test expected accepts a token t with result x when the function test t returns Just x. expected specifies the collection of expected items to report in error messages.

This is the most primitive combinator for accepting tokens. For example, the satisfy parser is implemented as:

satisfy f = token testToken E.empty
where
testToken x = if f x then Just x else Nothing

Note: type signature of this primitive was changed in the version 7.0.0.

Arguments

 :: (Tokens s -> Tokens s -> Bool) Predicate to check equality of chunks -> Tokens s Chunk of input to match against -> m (Tokens s)

The parser tokens test chk parses a chunk of input chk and returns it. The supplied predicate test is used to check equality of given and parsed chunks after a candidate chunk of correct length is fetched from the stream.

This can be used for example to write chunk:

chunk = tokens (==)

Note that beginning from Megaparsec 4.4.0, this is an auto-backtracking primitive, which means that if it fails, it never consumes any input. This is done to make its consumption model match how error messages for this primitive are reported (which becomes an important thing as user gets more control with primitives like withRecovery):

>>> parseTest (string "abc") "abd"
1:1:
unexpected "abd"
expecting "abc"


This means, in particular, that it's no longer necessary to use try with tokens-based parsers, such as string and string'. This feature does not affect performance in any way.

Arguments

 :: Maybe String Name for a single token in the row -> (Token s -> Bool) Predicate to use to test tokens -> m (Tokens s) A chunk of matching tokens

Parse zero or more tokens for which the supplied predicate holds. Try to use this as much as possible because for many streams the combinator is much faster than parsers built with many and satisfy.

The following equations should clarify the behavior:

takeWhileP (Just "foo") f = many (satisfy f <?> "foo")
takeWhileP Nothing      f = many (satisfy f)

The combinator never fails, although it may parse the empty chunk.

Since: 6.0.0

Arguments

 :: Maybe String Name for a single token in the row -> (Token s -> Bool) Predicate to use to test tokens -> m (Tokens s) A chunk of matching tokens

Similar to takeWhileP, but fails if it can't parse at least one token. Note that the combinator either succeeds or fails without consuming any input, so try is not necessary with it.

Since: 6.0.0

Arguments

 :: Maybe String Name for a single token in the row -> Int How many tokens to extract -> m (Tokens s) A chunk of matching tokens

Extract the specified number of tokens from the input stream and return them packed as a chunk of stream. If there is not enough tokens in the stream, a parse error will be signaled. It's guaranteed that if the parser succeeds, the requested number of tokens will be returned.

The parser is roughly equivalent to:

takeP (Just "foo") n = count n (anyChar <?> "foo")
takeP Nothing      n = count n anyChar

Note that if the combinator fails due to insufficient number of tokens in the input stream, it backtracks automatically. No try is necessary with takeP.

Since: 6.0.0

getParserState :: m (State s) Source #

Return the full parser state as a State record.

updateParserState :: (State s -> State s) -> m () Source #

updateParserState f applies the function f to the parser state.

Instances

# Derivatives of primitive combinators

Arguments

 :: MonadParsec e s m => Token s Token to match -> m (Token s)

single t only matches the single token t.

semicolon = single ';'

See also: token, anySingle, char, char.

Since: 7.0.0

Arguments

 :: MonadParsec e s m => (Token s -> Bool) Predicate to apply -> m (Token s)

The parser satisfy f succeeds for any token for which the supplied function f returns True.

digitChar = satisfy isDigit <?> "digit"
oneOf cs  = satisfy (elem cs)

See also: anySingle, anySingleBut, oneOf, noneOf.

Since: 7.0.0

anySingle :: MonadParsec e s m => m (Token s) Source #

Parse and return a single token. It's a good idea to attach a label to this parser.

anySingle = satisfy (const True)

See also: satisfy, anySingleBut.

Since: 7.0.0

Arguments

 :: MonadParsec e s m => Token s Token we should not match -> m (Token s)

Match any token but the given one. It's a good idea to attach a label to this parser.

anySingleBut t = satisfy (/= t)

See also: single, anySingle, satisfy.

Since: 7.0.0

Arguments

 :: (Foldable f, MonadParsec e s m) => f (Token s) Collection of matching tokens -> m (Token s)

oneOf ts succeeds if the current token is in the supplied collection of tokens ts. Returns the parsed token. Note that this parser cannot automatically generate the “expected” component of error message, so usually you should label it manually with label or (<?>).

oneOf cs = satisfy (elem cs)

See also: satisfy.

digit = oneOf ['0'..'9'] <?> "digit"

Performance note: prefer satisfy when you can because it's faster when you have only a couple of tokens to compare to:

quoteFast = satisfy (\x -> x == '\'' || x == '\"')
quoteSlow = oneOf "'\""

Since: 7.0.0

Arguments

 :: (Foldable f, MonadParsec e s m) => f (Token s) Collection of taken we should not match -> m (Token s)

As the dual of oneOf, noneOf ts succeeds if the current token not in the supplied list of tokens ts. Returns the parsed character. Note that this parser cannot automatically generate the “expected” component of error message, so usually you should label it manually with label or (<?>).

noneOf cs = satisfy (notElem cs)

See also: satisfy.

Performance note: prefer satisfy and anySingleBut when you can because it's faster.

Since: 7.0.0

Arguments

 :: MonadParsec e s m => Tokens s Chunk to match -> m (Tokens s)

chunk chk only matches the chunk chk.

divOrMod = chunk "div" <|> chunk "mod"

See also: tokens, string, string.

Since: 7.0.0

(<?>) :: MonadParsec e s m => m a -> String -> m a infix 0 Source #

A synonym for label in the form of an operator.

unexpected :: MonadParsec e s m => ErrorItem (Token s) -> m a Source #

The parser unexpected item fails with an error message telling about unexpected item item without consuming any input.

unexpected item = failure (Just item) Set.empty

customFailure :: MonadParsec e s m => e -> m a Source #

Report a custom parse error. For a more general version, see fancyFailure.

customFailure = fancyFailure . E.singleton . ErrorCustom

Since: 6.3.0

match :: MonadParsec e s m => m a -> m (Tokens s, a) Source #

Return both the result of a parse and a chunk of input that was consumed during parsing. This relies on the change of the stateOffset value to evaluate how many tokens were consumed. If you mess with it manually in the argument parser, prepare for troubles.

Since: 5.3.0

Arguments

 :: MonadParsec e s m => (ParseError s e -> ParseError s e) How to process ParseErrors -> m a The “region” that the processing applies to -> m a

Specify how to process ParseErrors that happen inside of this wrapper. As a side effect of the current implementation changing errorOffset with this combinator will also change the final stateOffset in the parser state (try to avoid that because stateOffset will go out of sync with factual position in the input stream and pretty-printing of parse errors afterwards will be incorrect).

Since: 5.3.0

takeRest :: MonadParsec e s m => m (Tokens s) Source #

Consume the rest of the input and return it as a chunk. This parser never fails, but may return the empty chunk.

takeRest = takeWhileP Nothing (const True)

Since: 6.0.0

atEnd :: MonadParsec e s m => m Bool Source #

Return True when end of input has been reached.

atEnd = option False (True <\$ hidden eof)

Since: 6.0.0

# Parser state combinators

getInput :: MonadParsec e s m => m s Source #

Return the current input.

setInput :: MonadParsec e s m => s -> m () Source #

setInput input continues parsing with input.

getSourcePos :: MonadParsec e s m => m SourcePos Source #

Return the current source position. This function is not cheap, do not call it e.g. on matching of every token, that's a bad idea. Still you can use it to get SourcePos to attach to things that you parse.

The function works under the assumption that we move in the input stream only forwards and never backwards, which is always true unless the user abuses the library.

Since: 7.0.0

getOffset :: MonadParsec e s m => m Int Source #

Get the number of tokens processed so far.

See also: setOffset.

Since: 7.0.0

setOffset :: MonadParsec e s m => Int -> m () Source #

Set the number of tokens processed so far.

See also: getOffset.

Since: 7.0.0

setParserState :: MonadParsec e s m => State s -> m () Source #

setParserState st sets the parser state to st.

See also: getParserState, updateParserState.