Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
Posted: Thu Jul 14, 2022 9:07 am
a) Removing left recursion only
b) Factoring the grammar alone
c) Factoring & left recursion removal
d) None of the mentioned
b) Factoring the grammar alone
c) Factoring & left recursion removal
d) None of the mentioned