| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Attoparsec.Combinators
Description
More readable combinators for writing parsers.
- appending :: (Applicative f, Monoid a) => f a -> f a -> f a
- alternating :: Alternative f => f a -> f a -> f a
- pured :: (Applicative g, Applicative f) => g a -> g (f a)
- concating :: (Monoid m, Applicative f) => f [m] -> f m
Documentation
appending :: (Applicative f, Monoid a) => f a -> f a -> f a Source #
Concatenate two parsers.
alternating :: Alternative f => f a -> f a -> f a Source #
Alternative parsers.
pured :: (Applicative g, Applicative f) => g a -> g (f a) Source #
Pure something.
concating :: (Monoid m, Applicative f) => f [m] -> f m Source #
Concatting the result of an action.