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
Q33: Given A = {0,1} and L =
Q34: If L1 and L2 are context free
Q35: The logic of pumping lemma is a
Q36: For two regular languages L1 = (a
Q37: Pumping lemma is generally used for proving
Q39: Following syntax-directed translation scheme is used with
Q40: FSM can recognize
A)Any grammar
B)Only CG
C)Both (a) and
Q41: Basic limitation of FSM is that it
A)Cannot
Q42: Which of the following are decidable?
1) Whether
Q43: If L and L¯ are recursively enumerable,
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents