0

I want to know which is the best way to build a non-recursive predictive table-driven LL(1) parser in functional programming: Hand-coding in Haskell or OCaML or does it exist a tool that can help me with this?

Academia
  • 3,984
  • 6
  • 32
  • 49
  • You can also check [LL(1) parser generator in OCaml](http://stackoverflow.com/questions/8070511/ll1-parser-generator-in-ocaml). – Çağdaş Bozman Feb 03 '12 at 08:50
  • possible duplicate of [Are there any LL Parser Generators for Functional Languages such as Haskell or Scala?](http://stackoverflow.com/questions/5507665/are-there-any-ll-parser-generators-for-functional-languages-such-as-haskell-or-s) – David Z Feb 06 '12 at 10:45

1 Answers1

0

There are Haskell bindings for ANTLR, a LL(*) parser generator.

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

Community
  • 1
  • 1
gioele
  • 9,748
  • 5
  • 55
  • 80