|
|
|
|
|
|
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 ByteString 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 !-}
|
|
|
A synonym for a ByteString Parser, i.e. bytestring input (no state)
|
|
|
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.
| | Methods | | A straightforward parser for an item. (A minimal definition of
a class instance requires either |parse| or |parsePrec|.)
| | | A straightforward parser for an item, given the precedence of
any surrounding expression. (Precedence determines whether
parentheses are mandatory or optional.)
| | | Parsing a list of items by default accepts the [] and comma syntax,
except when the list is really a character string using "".
|
| | Instances | |
|
|
|
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). Use of this
wrapper function is NOT recommended with ByteString, because there
is a lot of inefficiency in repeated conversions to/from String.
|
|
|
If you have a TextParser for a type, you can easily make it into
a Read instance, by throwing away any error messages. Use of this
wrapper function is NOT recommended with ByteString, because there
is a lot of inefficiency in conversions to/from String.
|
|
|
If you have a TextParser for a type, you can easily make it into
a Read instance, by throwing away any error messages. Use of this
wrapper function is NOT recommended with ByteString, because there
is a lot of inefficiency in conversions to/from String.
|
|
Combinators specific to string input, lexed haskell-style
|
|
|
One lexical chunk (Haskell-style lexing).
|
|
|
Ensure that the next input word is the given string. (Note the input
is lexed as haskell, so wordbreaks at spaces, symbols, etc.)
|
|
|
Allow true string parens around an item.
|
|
|
Allow nested parens around an item (one set required when Bool is True).
|
|
|
Deal with named field syntax. The string argument is the field name,
and the parser returns the value of the field.
|
|
|
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.
|
|
|
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 |
|
|
|
|
|
|
|
|
|
parseUnsignedInteger uses the underlying ByteString readInteger, so
will be a lot faster than the generic character-by-character parseInt.
|
|
|
|
|
|
Re-export all the more general combinators from Poly too
|
|
module Text.ParserCombinators.Poly.ByteString |
|
ByteStrings and Strings as whole entities
|
|
|
Simply return the remaining input ByteString.
|
|
|
Simply return the remaining input as a String.
|
|
Produced by Haddock version 2.4.2 |