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