删除基本表达式解析器中的左递归

7 parsing haskell left-recursion

作为练习,我正在使用以下GADT为Haskell中定义的极其简单的语言实现一个解析器(我的项目的真正语法涉及更多表达式,但这个提取对于这个问题已经足够了):

data Expr a where
    I   :: Int -> Expr Int
    Add :: [Expr Int] -> Expr Int
Run Code Online (Sandbox Code Playgroud)

解析函数如下:

expr :: Parser (Expr Int)
expr = foldl1 mplus
    [ lit 
    , add 
    ]   

lit :: Parser (Expr Int)
lit = I . read <$> some digit

add :: Parser (Expr Int)
add = do
  i0 <- expr
  is (== '+')
  i1 <- expr
  is <- many (is (== '+') *> expr)
  pure (Add (i0:i1:is))
Run Code Online (Sandbox Code Playgroud)

由于表达式语法的左递归性质,当我尝试解析像1+1使用expr解析器一样简单的东西时,解析器陷入无限循环.

我已经看到了如何使用以下内容的转换在Web上分解左递归的示例:

S -> S a | b
Run Code Online (Sandbox Code Playgroud)

变成这样的东西:

S -> b T
T -> a T
Run Code Online (Sandbox Code Playgroud)

但我正在努力将如何应用于我的解析器.

为了完整性,这里是实际实现解析器的代码:

newtype Parser a = Parser
    { runParser :: String -> [(a, String)]
    }   

instance Functor Parser where
    fmap f (Parser p) = Parser $ \s ->
      fmap (\(a, r) -> (f a, r)) (p s)

instance Applicative Parser where
    pure a = Parser $ \s -> [(a, s)] 
    (<*>) (Parser f) (Parser p) = Parser $ \s ->
      concat $ fmap (\(f', r) -> fmap (\(a, r') -> (f' a, r')) (p r)) (f >

instance Alternative Parser where
    empty = Parser $ \s -> []
    (<|>) (Parser a) (Parser b) = Parser $ \s ->
      case a s of
        (r:rs) -> (r:rs)
        []     -> case b s of
                    (r:rs) -> (r:rs)
                    []     -> []

instance Monad Parser where
    return = pure
    (>>=) (Parser a) f = Parser $ \s ->
      concat $ fmap (\(r, rs) -> runParser (f r) rs) (a s)

instance MonadPlus Parser where
    mzero = empty
    mplus (Parser a) (Parser b) = Parser $ \s -> a s ++ b s 

char  = Parser $ \case (c:cs) -> [(c, cs)]; [] -> []
is p  = char >>= \c -> if p c then pure c else empty
digit = is isDigit
Run Code Online (Sandbox Code Playgroud)

dfe*_*uer 3

假设您要解析涉及文字、加法和乘法的非括号表达式。您可以通过按优先级缩减列表来做到这一点。这是在 中执行此操作的一种方法attoparsec,它应该与您使用解析器执行的操作非常相似。我不是解析专家,所以可能会有一些错误或不恰当的地方。

import Data.Attoparsec.ByteString.Char8
import Control.Applicative

expr :: Parser (Expr Int)
expr = choice [add, mul, lit] <* skipSpace
-- choice is in Data.Attoparsec.Combinators, but is
-- actually a general Alternative operator.

add :: Parser (Expr Int)
add = Add <$> addList

addList :: Parser [Expr Int]
addList = (:) <$> addend <* skipSpace <* char '+' <*> (addList <|> ((:[]) <$> addend))

addend :: Parser (Expr Int)
addend = mul <|> multiplicand

mul :: Parser (Expr Int)
mul = Mul <$> mulList

mulList :: Parser [Expr Int]
mulList = (:) <$> multiplicand <* skipSpace <* char '*' <*> (mulList <|> ((:[]) <$> multiplicand))

multiplicand :: Parser (Expr Int)
multiplicand = lit

lit :: Parser (Expr Int)
lit = I <$> (skipSpace *> decimal)
Run Code Online (Sandbox Code Playgroud)