当我的解析器明确地寻找它时,为什么我会得到"意外的输入结束"?

Jen*_*off 4 haskell parsec

import Control.Applicative hiding (many)
import Text.Parsec
import Text.Parsec.String

lexeme :: Parser a -> Parser a
lexeme p = many (oneOf " \n\r") *> p

identifier :: Parser String
identifier = lexeme $ many1 $ oneOf (['a'..'z'] ++ ['A'..'Z'])

operator :: String -> Parser String
operator = lexeme . string

field :: Parser (String, String)
field = (,) <$> identifier <* operator ":" <*> identifier <* operator ";"

fields :: Parser [(String, String)]
fields = many (try field) <* eof

testInput :: String
testInput = unlines
    [ "    FCheckErrors         : Boolean            ;"
    , "    FAcl                 : TStrings           ;"
    ]

main :: IO ()
main = parseTest fields testInput
Run Code Online (Sandbox Code Playgroud)

运行时,这会产生:

解析错误(第3行,第1列):意外的输入结束

当我删除显式的eof匹配时,没有这样的解析错误:

fields = many (try field)
Run Code Online (Sandbox Code Playgroud)

我也尝试过try field `manyTill` eof,但这会产生与原始代码相同的行为.

我想确保解析器消耗整个输入,我该怎么做?

Jen*_*off 7

问题是之前有一个换行符eof(插入unlines).

所以eof必须要经历lexeme.

fields = many (try field) <* lexeme eof
Run Code Online (Sandbox Code Playgroud)

否则Parsec正试图fields在换行符上运行解析器.