...
Parsers
October 9, 2023
Compiler-Design
October 10, 2023
Parsers
October 9, 2023
Compiler-Design
October 10, 2023

UGC NET CS 2014 June-paper-2

Question 7
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?
A
Removing left recursion alone
B
Removing the grammar alone
C
Removing left recursion and factoring the grammar
D
None of the above
Question 7 Explanation: 
→ Left recursion removing (or) factoring the given grammar are not sufficient to convert an arbitrary CFG to an LL(1) grammar.
→ To convert an arbitrary CFG to an LL(1) grammar we need to remove the left recursion and as well as left factoring without that we cannot convert.
Correct Answer: D
Question 7 Explanation: 
→ Left recursion removing (or) factoring the given grammar are not sufficient to convert an arbitrary CFG to an LL(1) grammar.
→ To convert an arbitrary CFG to an LL(1) grammar we need to remove the left recursion and as well as left factoring without that we cannot convert.

Leave a Reply

Your email address will not be published. Required fields are marked *