3

I'm really interested in parser combinators, especially those who can deal with left-recursive and ambiguous grammars. I know the fabulous Superpower by Nicholas Blumhardt but it's unable to deal with this kind of grammars.

I've found some GLL parser combinators libraries like this https://github.com/djspiewak/gll-combinators, but it uses Scala and, that is a big inconvenience for me (I don't know that language).

I would like to know if there is any of these in C# (or Java)

halfer
  • 19,824
  • 17
  • 99
  • 186
SuperJMN
  • 13,110
  • 16
  • 86
  • 185
  • Did you see ANTLR 4?? https://www.antlr.org/ – Ali Ali Apr 25 '21 at 09:16
  • ANTLR 4 has the ability to deal with left-recursive and ambiguous grammars, as I remember, I read the book, and you can implement the parser with c# and Java, I did work with java. Also, they offer starter grammars on their GitHub. – Ali Ali Apr 25 '21 at 09:21

0 Answers0