trans1 t r = trans2 t $ const r
satTok :: TokenValue -> Parser Token Token
-satTok t = satisfy ((===) t)
+satTok t = top >>= \tok=:(pos, tv) -> if (t === tok) (return tok) (fail <?> ("Token", pos))
parseSepList :: TokenValue (Parser Token a) -> Parser Token [a]
parseSepList sep p =
from Control.Monad import class Monad
from Control.Applicative import class Applicative, class Alternative
-:: Error = ParseError | LexError String | Expected [String]
+:: Error = ParseError | LexError String | Expected [String] Int
:: Parser a b = Parser ([a] -> (Either Error b, [a]))
instance Functor (Parser a)
instance toString Error
runParser :: (Parser a b) [a] -> (Either Error b, [a])
+(<?>) :: (Parser a b) (String, Int) -> Parser a b
fail :: Parser a b
top :: Parser a a
satisfy :: (a -> Bool) -> Parser a a
toString (LexError e) = "Lexer error: " +++ e
instance + Error where
- (+) (Expected as) (Expected bs) = Expected (as++bs)
- (+) _ r = r
+ (+) (Expected as _) (Expected bs p) = Expected (as++bs) p
+ (+) _ r = r
runParser :: (Parser a b) [a] -> (Either Error b, [a])
runParser (Parser f) i = f i
(Right r, rest) = (Right r, rest)
(Left e2, rest) = (Left (e1+e2), rest)
-<?> :: (Parser a b) String -> Parser a b
-<?> p e = Parser \i -> case runParser p i of
- (Left e1, rest) = (Left (e1+(Expected [e])), rest)
+//Try the parser, if it fails decorate the error with Expected of the given String and position
+(<?>) :: (Parser a b) (String, Int) -> Parser a b
+(<?>) p (e,pos) = Parser \i -> case runParser p i of
+ (Left e1, rest) = let error = (e1+(Expected [e] pos)) in (Left error, rest)
(Right r, rest) = (Right r, rest)
fail :: Parser a b