How would I go about removing left recursion from this line from a grammar?
A -> D | R | r B A n ; | AA | epsilon
r, n and ; are terminal symbols. D,R,B and A are all non-terminals.
Thanks in advance
1 Answers
0
votes
You can find your answer in wikipedia.
Also, this is a possible duplicate of removing left recursion in a context free grammar.
