A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
a. Removing left recursion alone
b. Factoring the grammar alone
c. Removing left recursion and factoring the grammar
d. None of these
Answer:None of these
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: