Hi everybody, > One of most tough problem in the migration for me was to resolve the > left factoring.
I am surprised by this discussion. I thought that there are algorithms that automatically removes left recursions and left factorizations. Did I learn those algorithms at school but they are never used in real problem? Why ANTLR does not use them? Regards Denis Gokulakannan Somasundaram a écrit : > Hi Jean, > I faced up with a similar issue, when i tried the migration of a > LR parser. But it's definitely because of recursion stuffs. The way i > removed is sort of layman stuff, but thought of just informing you. > Try to split the grammar into multiple sections(group of rules) and > try to add them one-by-one. You don't need to wait till the errors are > emitted. As soon as the parser generation takes more than 3-4 mins, just > stop the generation. The last section, which resulted in the increase most > probably contains the problematic code. Bear with me, if this approach looks > very awkward. > > Thanks, > Gokul. > List: http://www.antlr.org/mailman/listinfo/antlr-interest Unsubscribe: http://www.antlr.org/mailman/options/antlr-interest/your-email-address
-- You received this message because you are subscribed to the Google Groups "il-antlr-interest" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/il-antlr-interest?hl=en.
