Multiple Choice
What is the highest type number which can be applied to the following grammar?
S ->Aa, A -> Ba, B ->abc
A) Type 0
B) Type 1
C) Type 2
D) Type 3
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q18: Which of the following pairs have DIFFERENT
Q19: Any Language generated by an unrestricted grammar
Q20: Context free grammar is not closed under<br>A)Product
Q21: Following syntax-directed translation scheme is used with
Q22: Let the class of language accepted by
Q24: TM is more powerful than FSM because<br>A)The
Q25: Let L<sub>1</sub> be a recursive language. Let
Q26: If L and L¯ are recursively enumerable,
Q27: Which of the following statement is wrong?<br>A)Any
Q28: The language accepted by a Push down