-
Notifications
You must be signed in to change notification settings - Fork 3.3k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Left recursion still not working #60
Comments
That doesn't fit the pattern. why do you have extra parens? |
oh, the parens are the problem? They are superfluous, agree. A relic of the non-left recursive (name .)* name form. However, should the parser rely on simple pattern matching for detecting mutual left recursion? I dont think that extra parens should ever change the semantics of a grammar file. |
Hi. No doubt the computation is undecidable or close for arbitrary grammars. I am doing a pattern match for only those grammars that will work with the generated code pattern. It is a fairly complicated precedence parsing mechanism. I must be able to determine the operators, which would be quite difficult for arbitrary grammars. |
Hi,
the latest early access (built from latest commit d378469) is still not able to handle a (non-mutually) left recursive grammar. The following simple grammar yields the error:
the resulting error is error(119): ... ::: The following sets of rules are mutually left-recursive [qualifiedName]
The text was updated successfully, but these errors were encountered: