How do Scala parser combinators compare to Haskell's Parsec?

Posted by artif on Stack Overflow See other posts from Stack Overflow or by artif
Published on 2010-03-13T07:15:42Z Indexed on 2010/03/13 7:25 UTC
Read the original article Hit count: 333

I have read that Haskell parser combinators (in Parsec) can parse context sensitive grammars. Is this also true for Scala parser combinators? If so, is this what the "into" (aka ">>") function is for?

What are some strengths/weaknesses of Scala's implementation of parser combinators, vs Haskell's? Do they accept the same class of grammars? Is it easier to generate error messages or do other miscellaneous useful things with one or the other?

How does packrat parsing (introduced in Scala 2.8) fit into this picture?

Is there a webpage or some other resource that shows how different operators/functions/DSL-sugar from one language's implementation maps onto the other's?

© Stack Overflow or respective owner

Related posts about parser-combinators

Related posts about scala