Have you tried Googling "How to eliminate left recursion"?
It seems like you'll search the Internet for answers to the exact, specific problem you want an answer to, but you won't search the Internet for how to solve the general kind of problem yourself.
Hi,
Thanks for your reply. I found one but I did find it useful. If I find something useful, I really mention it on the forum to appreciate other's work. Also this is not homework question but I have to post it on this forum as in the past I was asked to do so. I think home work questions have a better response time.
Sorry I can't understand what is meant by ordering here <We order the nonterminals: S < A.>
Maybe just because of this problem I did not mention this post earlier. Even the first step is not clear to me.
<There is no left recursive S-productions.
So the next step is to remove S from the right-hand side of the A-productions of the form A-->S
S-->Aa | b
A-->Ac | Aad | bd | epsilon
Then we remove the left recursive A-productions.>
Both "Ac" and "Aad" are left recursive, how they created A'? Why they can't have:
A-->cA'| adA'|bd |expsilon? Why changed "bd" to "bdA'"?