Copyright	Bryan O'Sullivan 2011, Mario Blažević <blamario@yahoo.com> 2014
License	BSD3
Maintainer	Mario Blažević
Stability	experimental
Portability	unknown
Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Picoparsec.Types

Description

Simple, efficient parser combinators for strings, loosely based on the Parsec library.

Synopsis

Documentation

The core parser type. This is parameterised over the type t of string being processed.

This type is an instance of the following classes:

Monad, where fail throws an exception (i.e. fails) with an error message.
Functor and Applicative, which follow the usual definitions.
MonadPlus, where mzero fails (with no error message) and mplus executes 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, Picoparsec is a backtracking parser that supports arbitrary lookahead.)
Alternative, which follows MonadPlus.

Instances

Monoid t => Alternative (Parser t)
Monad (Parser t)
Functor (Parser t)
Monoid t => MonadPlus (Parser t)
Applicative (Parser t)

The result of a parse. This is parameterised over the type t of string that was processed.

This type is an instance of Functor, where fmap transforms the value in a Done result.

Constructors

Fail t [String] String	The parse failed. The `t` parameter is the input that had not yet been consumed when the failure occurred. The `[String]` is a list of contexts in which the error occurred. The `String` is the message describing the error, if any.
Partial (t -> IResult t r)	Supply this continuation with more input so that the parser can resume. To indicate that no more input is available, use an empty string.
Done t r	The parse succeeded. The `t` parameter is the input that had not yet been consumed (if any) when the parse succeeded.

Instances

Functor (IResult t)
(Show t, Show r) => Show (IResult t r)
(NFData t, NFData r) => NFData (IResult t r)