Why must left recursion be eliminated in top-down parsers?
Why must left recursion be eliminated in top-down parsers?
- A.
It causes infinite recursion during parsing
- B.
It leads to ambiguity in the grammar
- C.
It slows down the execution of compiled programs
- D.
It cannot be represented using regular expressions
Attempted by 158 students.
Sign up free to check your answer
Sign up freeLoading lesson…

