Let G=(V, T, P, S) be a CFG such that _____________. Then there exists – McqOptions

MCQOPTIONS

1.	Let G=(V, T, P, S) be a CFG such that _____________. Then there exists an equivalent grammar G‚Äö√Ñ√∂‚àö√ë‚àö¬• having no e productions.$
A.	e ‚Äö√Ñ√∂‚àö‚Ä†‚àö‚Ä† L(G)
B.	w ‚Äö√Ñ√∂‚àö‚Ä†‚àö¬¢ L(G)
C.	e ‚Äö√Ñ√∂‚àö‚Ä†‚àö¬¢ L(G)
D.	w ‚Äö√Ñ√∂‚àö‚Ä†‚àö‚Ä† L(G)
Answer» D. w ‚Äö√Ñ√∂‚àö‚Ä†‚àö‚Ä† L(G)

Discussion

No Comment Found

Related MCQs

Given grammar G:S->aS| ABA-> eB-> eD-> bReduce the grammar, removing all the e productions:
Consider G=({S,A,B,E}, {a,b,c},P,S), where P consists of S →AB, A →a, B →b and E →c.Number of productions in P’ after removal of useless symbols:
For the given grammar G:S->ABaCA->BCB->b| eC->D| eD-> dRemove the e productions and generate the number of productions from S in the modified or simplified grammar.
For each production in P of the form:A-> x1x2x3…xnput into P’ that production as well as all those generated by replacing null variables with e in all possible combinations. If all x(i) are nullable,
Let G=(V, T, P, S) be a CFG such that _____________. Then there exists an equivalent grammar G’ having no e productions.
Consider the following grammar:A->eB->aAbCB->bAbAA->bBThe number of productions added on the removal of the nullable in the given grammar:
Simplify the given grammar:S->aXbX->aXb | e
Statement:For A-> e ,A can be erased. So whenever it appears on the left side of a production, replace with another production without the A.State true or false:
CONSIDER_G=({S,A,B,E},_{A,B,C},P,S),_WHERE_P_CONSISTS_OF_S_‚ÄÖ√Ñ√∂‚ÀÖ√∫‚ÀÖ‚Â†AB,_A_‚ÄÖ√Ñ√∂‚ÀÖ√∫‚ÀÖ‚Â†A,_B_‚ÄÖ√Ñ√∂‚ÀÖ√∫‚ÀÖ‚Â†B_AND_E_‚ÄÖ√Ñ√∂‚ÀÖ√∫‚ÀÖ‚Â†C.?$#
For each production in P of the form: