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. Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is:
a. n1 is necessarily less than n2
b. n1 is necessarily equal to n2
c. n1 is necessarily greater than n2
d. none of these
Answer:n1 is necessarily equal to n2
Manoj mishra :(September 20, 2019) How ?explain it plz
Click to Add Comment

Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: