( Parser
, ParserResult(..)
+ , failP
+
, parse
, parseStr
, notFollowedBy
, many
, many1
- , manyTill
- , many1Till
, count
, option
, sepBy
return x = x `seq` Parser $! return $! Success x
fail _ = Parser $! return $! IllegalInput
+-- |@'failP'@ is just a synonym for @'Prelude.fail Prelude.undefined'@.
+failP :: Parser a
+failP = fail undefined
+
-- |@'parse' p bstr@ parses @bstr@ with @p@ and returns @(result,
-- remaining)@.
parse :: Parser a -> ByteString -> (ParserResult a, ByteString)
if B.null input then
return ReachedEOF
else
- do let c = B.head input
- put (B.tail input, isEOFFatal)
- return (Success c)
+ do put (B.tail input, isEOFFatal)
+ return (Success $! B.head input)
eof :: Parser ()
satisfy :: (Char -> Bool) -> Parser Char
satisfy f = f `seq`
do c <- anyChar
- unless (f c) (fail "")
- return c
+ if f c then
+ return c
+ else
+ failP
char :: Char -> Parser Char
oneOf :: [Char] -> Parser Char
-oneOf = foldl (<|>) (fail "") . map char
+oneOf = foldl (<|>) failP . map char
notFollowedBy :: Parser a -> Parser ()
notFollowedBy p = p `seq`
- p >>= fail "" <|> return ()
+ (p >> failP) <|> return ()
digit :: Parser Char
if c >= '0' && c <= '9' then
return c
else
- fail ""
+ failP
hexDigit :: Parser Char
(c >= 'A' && c <= 'F') then
return c
else
- fail ""
+ failP
many :: Parser a -> Parser [a]
many1 :: Parser a -> Parser [a]
many1 p = p `seq`
- do ret <- many p
- case ret of
- [] -> fail ""
- xs -> return xs
-
-
-manyTill :: Parser a -> Parser end -> Parser [a]
-manyTill p end
- = p `seq` end `seq`
- many $! do x <- p
- end
- return x
-
-
-many1Till :: Parser a -> Parser end -> Parser [a]
-many1Till p end
- = p `seq` end `seq`
- many1 $! do x <- p
- end
- return x
+ do x <- p
+ xs <- many p
+ return (x:xs)
count :: Int -> Parser a -> Parser [a]