Lecture # 11
Lecture # 11. Grammar Problems . Left Recursion. A grammar is left recursive if for a non-terminal A, there is a derivation A + A There are three types of left recursion: direct (A A x) indirect (A B C, B A ) hidden (A B A, B ). How to eliminate Left recursion?.
657 views • 17 slides