For the given Regular expression, the minimum number of variables incl – McqOptions

MCQOPTIONS

1.	For the given Regular expression, the minimum number of variables including starting variable required to derive its grammar is:
A.	(01)
B.	4
C.	3
D.	5
Answer» D. 5

Discussion

No Comment Found

Related MCQs

L={0i1j2k | j>i+k}Which of the following satisfies the language?
Which among the following is the correct grammar for the given language?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: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:B->aCB->a
For the given Regular expression, the minimum number of terminals required to derive its grammar is:(011+1)*(01)*
For the given Regular expression, the minimum number of variables including starting variable required to derive its grammar is:(011+1)*(01)*
What the does the given CFG defines?S->aSbS|bSaS|e and w denotes terminal
State true or false:Statement: Every right-linear grammar generates a regular language.
WHICH_OF_THE_FOLLOWING_LANGUAGES_ARE_MOST_SUITABLE_FOR_IMPLEMENT_CONTEXT_FREE_LANGUAGES_??$