A grammar G=(V, T, P, S) is __________ if every production taken one o – McqOptions

MCQOPTIONS

1.	A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms: B->aC
A.	nB->a
B.	Ambiguous
C.	Regular
D.	Non Regular
E.	None of the mentioned
Answer» C. Regular

Discussion

No Comment Found

Related MCQs

Which among the following is the correct grammar for the given language?<br>L={x {0,1}*|number of zeroes in x number of one s in x}
Which of the following languages are most suitable for implement context free languages ?
Which among the following is a CFG for the given Language:<br>L={x {0,1}*|number of zeroes in x=number of one s in x}
A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:<br>B->aC
For the given Regular expression, the minimum number of terminals required to derive its grammar is:<br>(011+1)*(01)*
For the given Regular expression, the minimum number of variables including starting variable required to derive its grammar is:<br>(011+1)*(01)*
What the does the given CFG defines?<br>S->aSbS|bSaS|e and w denotes terminal
State true or false:<br>Statement: Every right-linear grammar generates a regular language.