Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
(a) Removing left Recursive alone
(b) Factoring the grammar alone
(c) Along with removing left recursion we also perform the factoring of the grammar
(d) None of the mentioned
I have been asked this question in examination.
Query is from Top-Down Parsing topic in chapter Topdown Parsing of Compiler