Operating-Systems
January 26, 2024Compiler-Design
January 26, 2024GATE 2003
| Question 16 |
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
| Removing left recursion alone | |
| Factoring the grammar alone | |
| Removing left recursion and factoring the grammar | |
| None of the above |
Question 16 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.
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 16 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.
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.