attoparsec-0.10.4.0: Fast combinator parsing for bytestrings and text

Portabilityunknown
Stabilityexperimental
Maintainerbos@serpentine.com
Safe HaskellNone

Data.Attoparsec.Zepto

Description

A tiny, highly specialized combinator parser for ByteString strings.

While the main Attoparsec module generally performs well, this module is particularly fast for simple non-recursive loops that should not normally result in failed parses.

Warning: on more complex inputs involving recursion or failure, parsers based on this module may be as much as ten times slower than regular Attoparsec! You should only use this module when you have benchmarks that prove that its use speeds your code up.

Synopsis

Documentation

data Parser a Source

A simple parser.

This monad is strict in its state, and the monadic bind operator (>>=) evaluates each result to weak head normal form before passing it along.

Instances

Monad Parser 
Functor Parser 
MonadPlus Parser 
Applicative Parser 
Alternative Parser 
Monoid (Parser a) 

parse :: Parser a -> ByteString -> Either String aSource

Run a parser.

atEnd :: Parser BoolSource

Indicate whether the end of the input has been reached.

string :: ByteString -> Parser ()Source

Match a string exactly.

take :: Int -> Parser ByteStringSource

Consume n bytes of input.

takeWhile :: (Word8 -> Bool) -> Parser ByteStringSource

Consume input while the predicate returns True.