A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Consider the grammar

S → (S) | a

Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2 and n3 respectively. The following relationship holds good
a. n1 < n2 < n3
b. n1 = n3 < n2
c. n1 = n2 = n3
d. n1 ≥ n3 ≥ n2
Answer:n1 = n3 < n2
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: