-
Notifications
You must be signed in to change notification settings - Fork 0
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
Convert Input grammar To LL(1) grammar automatically #36
Conversation
MuhammadKotb
commented
Dec 24, 2023
- Added LeftRecursionRemover class that has removeLR method that takes a grammar and returns a new grammar that is left recursion free.
- Added LeftFactorer class that has leftFactor method that takes a grammar and returns a new left factored grammar.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You used if { }
convention and used const auto&
which is faster for looping.
The functions can be broken into multiple parts.
Requested changes don't include changing variable names.
Nevertheless, Well done.
…into ANYCC-28-Convert-to-LL1
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Well done