【发布时间】:2015-03-25 14:03:03
【问题描述】:
我正在尝试转换以下语法产生式
callExpr:
primaryExpr
| callExpr primaryExpr
到 Haskell 中的 Parsec 表达式。
显然问题在于它是左递归的,所以我试图解析它的递归上升风格。我试图实现的伪代码是:
e = primaryExp
while(true) {
e2 = primaryExp
if(e2 failed) break;
e = CallExpr(e, e2)
}
我尝试将其翻译成 Haskell 是:
callExpr :: IParser Expr
callExpr = do
e <- primaryExpr
return $ callExpr' e
where
callExpr' e = do
e2m <- optionMaybe primaryExpr
e' <- maybe e (\e2 -> callExpr' (CallExpr e e2)) e2m
return e'
primaryExpr 的类型为 IParser Expr
而IParser被定义为
type IParser a = ParsecT String () (State SourcePos) a
然而,这给了我以下类型错误:
Couldn't match type `ParsecT String () (State SourcePos) t0'
with `Expr'
Expected type: ParsecT String () (State SourcePos) Expr
Actual type: ParsecT
String
()
(State SourcePos)
(ParsecT String () (State SourcePos) t0)
In a stmt of a 'do' block: return $ callExpr' e
In the expression:
do { e <- primaryExpr;
return $ callExpr' e }
In an equation for `callExpr':
callExpr
= do { e <- primaryExpr;
return $ callExpr' e }
where
callExpr' e
= do { e2m <- optionMaybe primaryExpr;
.... }
如何修复这种类型的错误?
【问题讨论】:
标签: parsing haskell functional-programming parsec left-recursion