Which of the following suffices to convert an arbitrary CFG to an LL(1)…

PYQ UGC NET 2014

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?

  1. A.

    Removing left recursion alone

  2. B.

    Removing the grammar alone

  3. C.

    Removing left recursion and factoring the grammar

  4. D.

    None of the above

Attempted by 321 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…