NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
1

### GATE CSE 2013

Consider the following two sets of LR(1) items of an LR(1) grammar.

\eqalign{ & X \to c.X,\,c/d\,\,\,\,\,\,\,\,X \to c.X,\ \cr & X \to .cX,c/d\,\,\,\,\,\,\,\,X \to .cX,\ \cr & X \to .d,c/d\,\,\,\,\,\,\,\,\,\,\,X \to .d,\ \cr}

Which of the following statements related to merging of the two sets in the corresponding LALR parser is/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.

A
1 only
B
2 only
C
1 and 4 only
D
1, 2, 3 and 4
2

### GATE CSE 2010

The grammar $$S \to aSa\,|\,\,bS\,|\,\,c$$ is
A
LL(1) but not LR(1)
B
LR(1) but not LR(1)
C
Both LL(1) and LR(1)
D
Neither LL(1) nor LR(1)
3

### GATE CSE 2008

An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if
A
The SLR(1) parser for G has S - R conflicts
B
The LR(1) parser for G has S - R conflicts
C
The LR(0) parser for G has S - R conflicts
D
The LALR(1) parser for G has reduce-reduce conflicts
4

### GATE CSE 2007

Consider the CFG with { S, A, B } as the non-terminal alphabet, { a, b } as the terminal alphabet, S as the start symbol and the following set of production rules:

\eqalign{ & S \to bA\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,S \to aB \cr & A \to a\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,B \to b \cr & A \to aS\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,B \to bS \cr & S \to bAA\,\,\,\,\,\,\,\,\,\,\,B \to aBB \cr}

For the correct answer strings to the previous question, how many derivation trees are there?

A
1
B
2
C
3
D
4

### Joint Entrance Examination

JEE Main JEE Advanced WB JEE

### Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

NEET

Class 12