GATEverse
← GATE CSE 2005

Q60

MCQ2 marks, −0.5

Consider the grammar:

S→(S)∣aS \rightarrow (S) \mid a

Let the number of states in SLR (1), LR(1) and LALR(1) parsers for the grammar be n1,n2n_1, n_2 and n3n_3 respectively. The following relationship holds good:

Sign in to save attempts.

Loading…