GATE CS 2005 — Question 58

Multiple choice 2 marks Question 58 2005

Question 58

MCQ 2 marks · −0.66 Compiler Design

Consider the grammar

S → ( S ) | a

Let the number of states in the SLR(1), LR(1) and LALR(1) parsers for the grammar be \(n_1\), \(n_2\) and \(n_3\) respectively. Which one of the following relationships holds good?

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2005 Compiler Design

Source: GATE 2005 Computer Science and Engineering, Q58 (question number approximate)

All Compiler Design questions