Posted by Henrique Rocha on May 31, 2017; 9:45pm
URL: https://forum.world.st/ANTLR4-to-SmaCC-tp4948738p4948771.html

Thierry Goubier wrote

LL(*) brings itself to entirely different hacks to play with the tokens
and lexical analysis that LR() grammars, and most of the hard work on
parsers is in that area.

I haven't looked if the reversed recursion in ANTLR is hard to convert.

I agree. But I have seem some tricks and tips to convert one kind to the other. It seems like a lot of the work can be automated.

Thierry Goubier wrote

Write a ANTLRv4 grammar syntax grammar in SmaCC would do the trick.

Unfortunately, I dont have the skills or the knowledge in SmaCC to write this in SmaCC. I tried and failed (so many times) to convert a specific language to SmaCC and I got nowhere (I cant even imagine to do a more generic syntax grammar such as ANTLR).

That is why I am asking for help if anyone else has done something like that.

Thanks and best regards,

- Henrique