Which of the following suffices to convert an arbitrary CFG to an LL(1 – McqOptions

MCQOPTIONS

1.	Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
A.	Removing left recursion only
B.	Factoring the grammar alone
C.	Factoring & left recursion removal
D.	None of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states?
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
Consider a program P that consists of two source modules M1(contains reference to a function defined in M2) and M2 contained in two different files.
Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.
Which of the following grammar rules violate the requirements of an operator grammar?
The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called
Which of the following derivations does a top-down parser use while parsing an input string?