GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2013 · session-1
Compiler DesignParsing TechniquesmediumMCQ2 marks
Consider these two sets of LR(1) items of an LR(1) grammar:
Set 1Set 2
X → c·X, c/dX → c·X, $
X → ·cX, c/dX → ·cX, $
X → ·d, c/dX → ·d, $
Which statements related to merging the two sets in the corresponding LALR parser are FALSE? 1. Cannot be merged since look aheads are different. 2. Can be merged but will result in S-R conflict. 3. Can be merged but will result in R-R conflict. 4. Cannot be merged since goto on c will lead to two different sets.
Save your progress

Related Compiler Design PYQs

GATE 2013

Which of the following grammar classes is the MOST powerful parser in terms of language recognition capability?

GATE 2013 · session-1

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-product…

GATE 2013 · session-1

The following code is executed on a processor allowing only register operands. Each instruction can have at most two source operan…

GATE 2013 · session-1

The following code is executed on a processor allowing only register operands. Each instruction can have at most two source operan…

GATE 2026 · CS1 - Forenoon

Consider the following C statements: char *str1 = "Hello; /* Statement S1 */ char *str2 = "Hello;"; /* Statement S2 …

GATE 2026 · CS1 - Forenoon

Which of the following statements is/are true?