Why must left recursion be eliminated in top-down parsers?

Why must left recursion be eliminated in top-down parsers?

  1. A.

    It causes infinite recursion during parsing

  2. B.

    It leads to ambiguity in the grammar

  3. C.

    It slows down the execution of compiled programs

  4. D.

    It cannot be represented using regular expressions

Attempted by 158 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…