Parsing left-recursive/ambiguous grammars about superpower HOT 3 CLOSED

Thanks for the note, @SuperJMN!

The goals of Superpower are a little different from what I think you have in the case of building a C compiler. You could parse C with Superpower (to the best of my knowledge), but if you want to easily translate an existing grammar, you'll be better served by a library that's aligned with the kind of grammar you have on hand, as you pointed out.

While translating from existing left-recursive grammars with Superpower isn't much fun, the straightforward recursive descent combinator approach has other distinct advantages that make it a good fit for lots of tasks - being able to treat parsers as simple executable programs removes a whole lot of mystery from the development process, and it's very easy to extend the library to suit different grammatical constructs.

GLL looks extremely interesting. I imagine there would be some simplicity trade-off. A GLL combinator library in C# would, however, be really interesting to see :-)

from superpower.

Thanks! it seems that I will have to wait some years before I attempt to create my compiler. It's a huge task. I'll take a look to LLVM an other options. Anyways, I encourage you to investigate, since this project has a lot of future, even more because there's NOTHING in the .NET space that does this kind of work. Superpower does it, and it does it elegantly (LINQ-style definitions are a killer feature).

I'm also providing more like about the topic http://ceur-ws.org/Vol-2241/
http://hackage.haskell.org/package/XSaiga
(By Richard Frost)

BTW, do you know any academic/developer that could be interested in providing support for more complex grammars?

Thank you!

from superpower.

So much interesting stuff out there! :-) I can't think of anyone who would be likely to pick this up right now, but good luck all the same.

from superpower.