Multiple Choice
The production Grammar is {S->aSbb,S->abb} is
A) type-3 grammar
B) type-2 grammar
C) type-1 grammar
D) type-0 grammar
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q4: Give a production grammar for the language
Q5: A PC not connected to a network
Q6: A FSM can be considered, having finite
Q7: The following CFG is in<br>S ? Abb<br>B
Q8: The part of an FA, where the
Q10: Regular expression (x/y)(x/y) denotes the set<br>A){xy,xy}<br>B){xx,xy,yx,yy}<br>C){x,y}<br>D){x,y,xy}
Q11: Let SHAM3 be the problem of finding
Q12: Which of the following statement is true?<br>A)All
Q13: Let L be any infinite regular language,
Q14: Recursively enumerable languages are not closed under<br>A)Complementation<br>B)Union<br>C)Intersection<br>D)None