HORIZON HASKELLDocslts/ghc-9.10.xc74966e2026-09-27Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · c74966e · 2026-09-27

Modulebase-4.20.2.0Haskell2010

Text.ParserCombinators.ReadP

This is a module of parser combinators, originally written by Koen Claessen. It parses all alternatives in parallel, so it never keeps hold of the beginning of the input string, a common source of space leaks with other parsers. The (+++) choice combinator is genuinely commutative; it makes no difference which branch is "shorter".

  • 2 types
  • 33 values
  • Packagebase-4.20.2.0
  • Exports35
  • LanguageHaskell2010
  • LicenceBSD-3-Clause
  • SourceReadP.hs

The ReadP type

1 declaration
newtypenewtype ReadP a
#
Instances6Monad, Functor, MonadFail, Applicative, Alternative, MonadPlus
  • Monad ReadPDefined in ghc-internal-9.1003.0 · GHC.Internal.Text.ParserCombinators.ReadP
  • Functor ReadPDefined in ghc-internal-9.1003.0 · GHC.Internal.Text.ParserCombinators.ReadP
  • MonadFail ReadPDefined in ghc-internal-9.1003.0 · GHC.Internal.Text.ParserCombinators.ReadP
  • Applicative ReadPDefined in ghc-internal-9.1003.0 · GHC.Internal.Text.ParserCombinators.ReadP
  • Alternative ReadPDefined in ghc-internal-9.1003.0 · GHC.Internal.Text.ParserCombinators.ReadP
  • MonadPlus ReadPDefined in ghc-internal-9.1003.0 · GHC.Internal.Text.ParserCombinators.ReadP

Primitive operations

5 declarations
valueget :: ReadP Char
#

Consumes and returns the next character. Fails if there is no input left.

valuelook :: ReadP String
#

Look-ahead: returns the part of the input that is left, without consuming it.

value(<++) :: ReadP a -> ReadP a -> ReadP a
#

Local, exclusive, left-biased choice: If left parser locally produces any result at all, then right parser is not used.

valuegather :: ReadP a -> ReadP (String, a)
#

Transforms a parser into one that does the same, but in addition returns the exact characters read. IMPORTANT NOTE: gather gives a runtime error if its first argument is built using any occurrences of readS_to_P.

Other operations

26 declarations
valueeof :: ReadP ()
#

Succeeds iff we are at the end of input

valuesatisfy :: (Char -> Bool) -> ReadP Char
#

Consumes and returns the next character, if it satisfies the specified predicate.

valuemunch :: (Char -> Bool) -> ReadP String
#

Parses the first zero or more characters satisfying the predicate. Always succeeds, exactly once having consumed all the characters Hence NOT the same as (many (satisfy p))

valuemunch1 :: (Char -> Bool) -> ReadP String
#

Parses the first one or more characters satisfying the predicate. Fails if none, else succeeds exactly once having consumed all the characters Hence NOT the same as (many1 (satisfy p))

valuecount :: Int -> ReadP a -> ReadP [a]
#

count n p parses n occurrences of p in sequence. A list of results is returned.

valuebetween :: ReadP open -> ReadP close -> ReadP a -> ReadP a
#

between open close p parses open, followed by p and finally close. Only the value of p is returned.

valueoption :: a -> ReadP a -> ReadP a
#

option x p will either parse p or return x without consuming any input.

valueoptional :: ReadP a -> ReadP ()
#

optional p optionally parses p and always returns ().

valuemany :: ReadP a -> ReadP [a]
#

Parses zero or more occurrences of the given parser.

valuemany1 :: ReadP a -> ReadP [a]
#

Parses one or more occurrences of the given parser.

valuesepBy :: ReadP a -> ReadP sep -> ReadP [a]
#

sepBy p sep parses zero or more occurrences of p, separated by sep. Returns a list of values returned by p.

valuesepBy1 :: ReadP a -> ReadP sep -> ReadP [a]
#

sepBy1 p sep parses one or more occurrences of p, separated by sep. Returns a list of values returned by p.

valueendBy :: ReadP a -> ReadP sep -> ReadP [a]
#

endBy p sep parses zero or more occurrences of p, separated and ended by sep.

valueendBy1 :: ReadP a -> ReadP sep -> ReadP [a]
#

endBy p sep parses one or more occurrences of p, separated and ended by sep.

valuechainr :: ReadP a -> ReadP (a -> a -> a) -> a -> ReadP a
#

chainr p op x parses zero or more occurrences of p, separated by op. Returns a value produced by a right associative application of all functions returned by op. If there are no occurrences of p, x is returned.

valuechainl :: ReadP a -> ReadP (a -> a -> a) -> a -> ReadP a
#

chainl p op x parses zero or more occurrences of p, separated by op. Returns a value produced by a left associative application of all functions returned by op. If there are no occurrences of p, x is returned.

valuemanyTill :: ReadP a -> ReadP end -> ReadP [a]
#

manyTill p end parses zero or more occurrences of p, until end succeeds. Returns a list of values returned by p.

Running a parser

3 declarations
typetype ReadS a = String -> [(a, String)]
#

A parser for a type a, represented as a function that takes a String and returns a list of possible parses as (a,String) pairs.

Note that this kind of backtracking parser is very inefficient; reading a large structure may be quite slow (cf ReadP).

valuereadP_to_S :: ReadP a -> ReadS a
#

Converts a parser into a Haskell ReadS-style function. This is the main way in which you can "run" a ReadP parser: the expanded type is readP_to_S :: ReadP a -> String -> [(a,String)]

valuereadS_to_P :: ReadS a -> ReadP a
#

Converts a Haskell ReadS-style function into a parser. Warning: This introduces local backtracking in the resulting parser, and therefore a possible inefficiency.

Properties

0 declarations