🎴 Flashcard Mode
Test 1 Compiler Design | Computer Science
Card1 / 29
Mastered0
Review0
QuestionClick to flip
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
AnswerClick to flip back
A
Removing left recursion and factoring the grammar
💡 Explanation:
If a grammar has left recursion & left factoring then it is ambiguous. So to convert a CFG to LL(1) grammar both removal of left recursion & left factoring need to be done.