942 views
0 votes
0 votes
S --> 0S1

S -->0S

S-->S1

S-->0

THE LANGUAGE GENERATED BY THIS GRAMMAR IS_____?

A. regular language

B. Context free language

C. Context sensitive language

D. Recursively enumerable language

1 Answer

0 votes
0 votes
The grammar generates ..

(0^+ ) + (0^+ 1^+ ) ..

Which is regular ..so language generated by given grammar is all of the given options...

But strongly speaking it is regular...

Related questions

6 votes
6 votes
4 answers
2
pC asked Nov 20, 2015
3,783 views
The Grammar E$\rightarrow$ EE | a isLR(1)SLR(1)LR(0)None
2 votes
2 votes
1 answer
3
ram121 asked Feb 2, 2015
1,101 views
$S \rightarrow C C \\ C \rightarrow c C | d$
1 votes
1 votes
1 answer
4
Sahil1994 asked Dec 7, 2017
567 views
Hi mates,Please Identify Class of grammr with suitable Explanation,1) L={WXW,/ W,X{a,b}*}2) L={WXW,/ W,X{a,b}+}3) L={WXWY,/ W,X,Y{a,b}+}4)L={WXYW,/ W,X,Y{a,b}+}Thanks,