polyparse-1.13: A variety of alternative parser combinator libraries.

Safe HaskellSafe
LanguageHaskell98

Text.Parse

Contents

Synopsis

The Parse class is a replacement for the standard Read class.

The Parse class is a replacement for the standard Read class. It is a specialisation of the (poly) Parser monad for String input. There are instances defined for all Prelude types. For user-defined types, you can write your own instance, or use DrIFT to generate them automatically, e.g. {-! derive : Parse !-}

type TextParser a = Parser Char a Source #

A synonym for Parser Char, i.e. string input (no state)

class Parse a where Source #

The class Parse is a replacement for Read, operating over String input. Essentially, it permits better error messages for why something failed to parse. It is rather important that parse can read back exactly what is generated by the corresponding instance of show. To apply a parser to some text, use runParser.

Minimal complete definition

Nothing

Methods

parse :: TextParser a Source #

A straightforward parser for an item. (A minimal definition of a class instance requires either |parse| or |parsePrec|.)

parsePrec :: Int -> TextParser a Source #

A straightforward parser for an item, given the precedence of any surrounding expression. (Precedence determines whether parentheses are mandatory or optional.)

parseList :: TextParser [a] Source #

Parsing a list of items by default accepts the [] and comma syntax, except when the list is really a character string using "".

Instances
Parse Bool Source # 
Instance details

Defined in Text.Parse

Parse Char Source # 
Instance details

Defined in Text.Parse

Parse Double Source # 
Instance details

Defined in Text.Parse

Parse Float Source # 
Instance details

Defined in Text.Parse

Parse Int Source # 
Instance details

Defined in Text.Parse

Parse Integer Source # 
Instance details

Defined in Text.Parse

Parse Ordering Source # 
Instance details

Defined in Text.Parse

Parse () Source # 
Instance details

Defined in Text.Parse

Parse a => Parse [a] Source # 
Instance details

Defined in Text.Parse

Parse a => Parse (Maybe a) Source # 
Instance details

Defined in Text.Parse

(Parse a, Parse b) => Parse (Either a b) Source # 
Instance details

Defined in Text.Parse

(Parse a, Parse b) => Parse (a, b) Source # 
Instance details

Defined in Text.Parse

Methods

parse :: TextParser (a, b) Source #

parsePrec :: Int -> TextParser (a, b) Source #

parseList :: TextParser [(a, b)] Source #

(Parse a, Parse b, Parse c) => Parse (a, b, c) Source # 
Instance details

Defined in Text.Parse

Methods

parse :: TextParser (a, b, c) Source #

parsePrec :: Int -> TextParser (a, b, c) Source #

parseList :: TextParser [(a, b, c)] Source #

parseByRead :: Read a => String -> TextParser a Source #

If there already exists a Read instance for a type, then we can make a Parser for it, but with only poor error-reporting. The string argument is the expected type or value (for error-reporting only).

readByParse :: TextParser a -> ReadS a Source #

If you have a TextParser for a type, you can easily make it into a Read instance, by throwing away any error messages.

readsPrecByParsePrec :: (Int -> TextParser a) -> Int -> ReadS a Source #

If you have a TextParser for a type, you can easily make it into a Read instance, by throwing away any error messages.

Combinators specific to string input, lexed haskell-style

word :: TextParser String Source #

One lexical chunk. This is Haskell'98-style lexing - the result should match Prelude.lex apart from better error-reporting.

isWord :: String -> TextParser String Source #

Ensure that the next input word is the given string. (Note the input is lexed as haskell, so wordbreaks at spaces, symbols, etc.)

literal :: String -> TextParser String Source #

Ensure that the next input word is the given string. (No lexing, so mixed spaces, symbols, are accepted.)

optionalParens :: TextParser a -> TextParser a Source #

Allow nested parens around an item.

parens :: Bool -> TextParser a -> TextParser a Source #

Allow nested parens around an item (one set required when Bool is True).

field :: Parse a => String -> TextParser a Source #

Deal with named field syntax. The string argument is the field name, and the parser returns the value of the field.

constructors :: [(String, TextParser a)] -> TextParser a Source #

Parse one of a bunch of alternative constructors. In the list argument, the first element of the pair is the constructor name, and the second is the parser for the rest of the value. The first matching parse is returned.

enumeration :: Show a => String -> [a] -> TextParser a Source #

Parse one of the given nullary constructors (an enumeration). The string argument is the name of the type, and the list argument should contain all of the possible enumeration values.

Parsers for literal numerics and characters

parseInt :: Integral a => String -> a -> (Char -> Bool) -> (Char -> Int) -> TextParser a Source #

parseLitChar :: TextParser Char Source #

Parse a Haskell character literal, excluding the surrounding single quotes.

parseLitChar' :: TextParser Char Source #

Parse a Haskell character literal, including the surrounding single quotes.

Re-export all the more general combinators from Poly too

Strings as whole entities

allAsString :: TextParser String Source #

Simply return the entire remaining input String.