1 -- |Yet another parser combinator. This is mostly a subset of
2 -- "Text.ParserCombinators.Parsec" but there are some differences:
4 -- * This parser works on 'Data.ByteString.Base.LazyByteString'
5 -- instead of 'Prelude.String'.
7 -- * Backtracking is the only possible behavior so there is no \"try\"
10 -- * On success, the remaining string is returned as well as the
13 -- * You can choose whether to treat reaching EOF (trying to eat one
14 -- more letter at the end of string) a fatal error or to treat it a
15 -- normal failure. If a fatal error occurs, the entire parsing
16 -- process immediately fails without trying any backtracks. The
17 -- default behavior is to treat EOF fatal.
19 -- In general, you don't have to use this module directly.
20 module Network.HTTP.Lucu.Parser
55 import Control.Monad.State.Strict hiding (state)
56 import qualified Data.ByteString.Lazy as Lazy (ByteString)
57 import qualified Data.ByteString.Lazy.Char8 as B hiding (ByteString)
58 import qualified Data.Foldable as Fold
60 import qualified Data.Sequence as Seq
61 import Data.Sequence (Seq, (|>))
63 -- |@'Parser' a@ is obviously a parser which parses and returns @a@.
64 newtype Parser a = Parser {
65 runParser :: State ParserState (ParserResult a)
71 pstInput :: Lazy.ByteString
72 , pstIsEOFFatal :: !Bool
77 data ParserResult a = Success !a
78 | IllegalInput -- 受理出來ない入力があった
79 | ReachedEOF -- 限界を越えて讀まうとした
83 -- (>>=) :: Parser a -> (a -> Parser b) -> Parser b
84 instance Monad Parser where
85 p >>= f = Parser $! do saved <- get -- 失敗した時の爲に状態を保存
88 Success a -> runParser (f a)
89 IllegalInput -> do put saved -- 状態を復歸
91 ReachedEOF -> do put saved -- 状態を復歸
93 return !x = Parser $! return $! Success x
94 fail _ = Parser $! return $! IllegalInput
96 instance Functor Parser where
97 fmap f p = p >>= return . f
99 -- |@'failP'@ is just a synonym for @'Prelude.fail'
100 -- 'Prelude.undefined'@.
102 failP = fail undefined
104 -- |@'parse' p bstr@ parses @bstr@ with @p@ and returns @(# result,
106 parse :: Parser a -> Lazy.ByteString -> (# ParserResult a, Lazy.ByteString #)
107 parse !p input -- input は lazy である必要有り。
108 = let (!result, state') = runState (runParser p) (PST input True)
110 (# result, pstInput state' #) -- pstInput state' も lazy である必要有り。
112 -- |@'parseStr' p str@ packs @str@ and parses it.
113 parseStr :: Parser a -> String -> (# ParserResult a, Lazy.ByteString #)
114 parseStr !p input -- input は lazy である必要有り。
115 = parse p (B.pack input)
118 anyChar :: Parser Char
120 do state@(PST input _) <- get
124 do put $! state { pstInput = B.tail input }
125 return (Success $! B.head input)
130 do PST input _ <- get
136 -- |@'allowEOF' p@ makes @p@ treat reaching EOF a normal failure.
137 allowEOF :: Parser a -> Parser a
139 = Parser $! do saved@(PST _ isEOFFatal) <- get
140 put $! saved { pstIsEOFFatal = False }
142 result <- runParser f
145 put $! state { pstIsEOFFatal = isEOFFatal }
150 satisfy :: (Char -> Bool) -> Parser Char
159 char :: Char -> Parser Char
160 char !c = satisfy (== c)
163 string :: String -> Parser String
165 = let bs = B.pack str
170 let (bs', rest) = B.splitAt len $ pstInput st
171 st' = st { pstInput = rest }
172 if B.length bs' < len then
184 -- |This is the backtracking alternation. There is no non-backtracking
186 (<|>) :: Parser a -> Parser a -> Parser a
188 = Parser $! do saved <- get -- 状態を保存
189 result <- runParser f
191 Success a -> return $! Success a
192 IllegalInput -> do put saved -- 状態を復歸
194 ReachedEOF -> if pstIsEOFFatal saved then
202 choice :: [Parser a] -> Parser a
203 choice = foldl (<|>) failP
206 oneOf :: [Char] -> Parser Char
207 oneOf = foldl (<|>) failP . map char
210 notFollowedBy :: Parser a -> Parser ()
212 = Parser $! do saved <- get -- 状態を保存
213 result <- runParser p
215 Success _ -> do put saved -- 状態を復歸
217 IllegalInput -> do put saved -- 状態を復歸
219 ReachedEOF -> do put saved -- 状態を復歸
224 digit = do c <- anyChar
225 if c >= '0' && c <= '9' then
231 hexDigit :: Parser Char
232 hexDigit = do c <- anyChar
233 if (c >= '0' && c <= '9') ||
234 (c >= 'a' && c <= 'f') ||
235 (c >= 'A' && c <= 'F') then
241 many :: forall a. Parser a -> Parser [a]
244 let (# result, state' #) = many' state Seq.empty
248 many' :: ParserState -> Seq a -> (# ParserResult [a], ParserState #)
250 = case runState (runParser p) st of
251 (Success a, st') -> many' st' (soFar |> a)
252 (IllegalInput, _) -> (# Success (Fold.toList soFar), st #)
253 (ReachedEOF , _) -> if pstIsEOFFatal st then
256 (# Success (Fold.toList soFar), st #)
258 manyChar :: Parser Char -> Parser Lazy.ByteString
259 manyChar !p = Parser $!
261 case scan' state 0 of
263 -> do let (bs, rest) = B.splitAt len (pstInput state)
264 state' = state { pstInput = rest }
268 -> if pstIsEOFFatal state then
271 error "internal error"
272 _ -> error "internal error"
274 scan' :: ParserState -> Int64 -> ParserResult Int64
276 = case runState (runParser p) st of
277 (Success _ , st') -> scan' st' (soFar + 1)
278 (IllegalInput, _ ) -> Success soFar
279 (ReachedEOF , _ ) -> if pstIsEOFFatal st then
285 many1 :: Parser a -> Parser [a]
291 count :: Int -> Parser a -> Parser [a]
292 count !n !p = Parser $! count' n p Seq.empty
294 -- This implementation is rather ugly but we need to make it
295 -- tail-recursive to avoid stack overflow.
296 count' :: Int -> Parser a -> Seq a -> State ParserState (ParserResult [a])
297 count' 0 _ !soFar = return $! Success $! Fold.toList soFar
298 count' !n !p !soFar = do saved <- get
299 result <- runParser p
301 Success a -> count' (n-1) p (soFar |> a)
302 IllegalInput -> do put saved
304 ReachedEOF -> do put saved
309 option :: a -> Parser a -> Parser a
310 option def !p = p <|> return def
313 sepBy :: Parser a -> Parser sep -> Parser [a]
314 sepBy !p !sep = sepBy1 p sep <|> return []
317 sepBy1 :: Parser a -> Parser sep -> Parser [a]
320 xs <- many $! sep >> p
332 crlf :: Parser String
333 crlf = string "\x0d\x0a"