Are there any LL Parser Generators for Functional Languages such as Haskell or Scala? Are there any LL Parser Generators for Functional Languages

http://stackoverflow.com/question...nal-languages-such-as-haskell-or-s

optChainl1 term addop (toScalar 0) term = factor `chainl1` mulop factor = sexpr `chainr1` powop sexpr = parens aexpr <|> scalar <|> ident powop = sym "^" >>=

http://stackoverflow.com/question...-expression-parser-with-precedence

nextstate(main 3 junk.pl:3) v:{ 5 <0> pushmark s 6 <$> const[IV 0] s 7 <$> const[IV 9] s 8 <{> enteriter(next->j last->m redo->9)[$i:1,10] lKS k <0> iter s l <|>

http://perldoc.perl.org/B/Concise.html