| Portability | unknown |
|---|---|
| Stability | experimental |
| Maintainer | bos@serpentine.com |
| Safe Haskell | None |
Data.Attoparsec.Types
Description
Simple, efficient parser combinators for strings, loosely based on the Parsec library.
Documentation
The core parser type. This is parameterised over the types i
of string being processed and t of internal state representation.
This type is an instance of the following classes:
-
Monad, wherefailthrows an exception (i.e. fails) with an error message. -
FunctorandApplicative, which follow the usual definitions. -
MonadPlus, wheremzerofails (with no error message) andmplusexecutes the right-hand parser if the left-hand one fails. When the parser on the right executes, the input is reset to the same state as the parser on the left started with. (In other words, attoparsec is a backtracking parser that supports arbitrary lookahead.) -
Alternative, which followsMonadPlus.
The result of a parse. This is parameterised over the type i
of string that was processed.
This type is an instance of Functor, where fmap transforms the
value in a Done result.
Constructors
| Fail i [String] String | The parse failed. The |
| Partial (i -> IResult i r) | Supply this continuation with more input so that the parser can resume. To indicate that no more input is available, pass an empty string to the continuation. __Note__: if you get a |
| Done i r | The parse succeeded. The |