|
Text.ParserCombinators.TextParser |
|
|
|
|
|
Synopsis |
|
|
|
|
The Parse class is a replacement for the Read class. It is a
|
|
|
A synonym for Parser Char, i.e. string 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.
| | Methods | | | 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.
|
|
Combinators specific to string input, lexed haskell-style
|
|
|
One lexical chunk (Haskell-style lexing).
|
|
|
Ensure that the next input word is a given string. (Note the input
is lexed as haskell, so wordbreaks at spaces, symbols, etc.)
|
|
|
Allow true string parens around an item.
|
|
|
Deal with named field syntax.
|
|
|
Parse one of a bunch of alternative constructors.
|
|
|
Parse one of the given nullary constructors (an enumeration).
|
|
Re-export all the more general combinators too
|
|
module Text.ParserCombinators.Poly |
|
Produced by Haddock version 0.8 |