The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+15 votes
2.5k views

Assume that the SLR parser for a grammar G has $n_1$ states and the LALR parser for G has $n_2$ states. The relationship between $n_1$ and $n_2$ is

  1. $n_1$ is necessarily less than $n_2$
  2. $n_1$ is necessarily equal to $n_2$
  3. $n_1$ is necessarily greater than $n_2$
  4. None of the above
asked in Compiler Design by Veteran (52.1k points) | 2.5k views
0
please explain me why n1 is necessarily equal to n2 and why not n1 is necessarily less than n2.

3 Answers

+19 votes
Best answer
no of states in SLR and LALR are equal

and no of states in SLR and LALR are less than or equal to LR(1)

Correct Answer: $B$
answered by Boss (30.9k points)
edited by
0

Answer should be D. Right?

Because no of states in SLR and LALR are less than or equal to LR(1)

0
@Rishabh HEre comparision is asked for SLR(1) and LALR(1) in questions and no. in states in both these are equal.
+11 votes
no of states

CLR(1)>=LR(0)=SLR(1)=LALR(1)
answered by Active (2.8k points)
+5 votes
ans b)
answered by Loyal (5.2k points)
+1
I think it should be less than equal to?
0
So pls explain whether it is less than equals to or only equal?
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,814 questions
54,518 answers
188,351 comments
75,294 users