1
GATE CSE 2021 Set 2
Numerical
+2
-0

Consider the following augmented grammar with {#, @, <, >, a, b, c} as the set of terminals.

S' → S

S → S # cS

S → SS

S → S @

S → < S >

S → a

S → b

S → c

Let I0 = CLOSURE({S' → ∙ S}). The number of items in the set GOTO(GOTO(I0, <), <) is _______

Your input ____
2
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+2
-0.67

Consider the following context-free grammar where the set of terminals is {a, b, c, d, f}.

S → d a T | R f

T → a S | b a T | ϵ

R → c a T R | ϵ

The following is a partially-filled LL(1) parsing table.

GATE CSE 2021 Set 1 Compiler Design - Parsing Question 14 English

Which one of the following choices represents the correct combination for the numbered cells in the parsing table ("blank" denotes that the corresponding cell is empty)?

A
(1) S → R f (2) S → R f (3) T → ϵ (4) T → ϵ
B
(1) blank (2) S → R f (3) blank (4) blank
C
(1) S → R f (2) blank (3) blank (4) T → ϵ
D
(1) blank (2) S → R f (3) T → ϵ (4) T → ϵ
3
GATE CSE 2020
MCQ (Single Correct Answer)
+2
-0.67
Consider the productions A $$ \to $$ PQ and A $$ \to $$ XY. Each of the five non-terminals A, P, Q, X, and Y has two attributes: s is a synthesized attribute, and i is an inherited attribute. Consider the following rules.

Rule 1 : P.i = A.i + 2, Q.i = P.i + A.i, and A.s = P.s + Q.s
Rule 2 : X.i = A.i + Y.s and Y.i = X.s + A.i

Which one of the following is TRUE?
A
Only Rule 2 is L-attributed.
B
Neither Rule 1 nor Rule 2 is L-attributed.
C
Both Rule 1 and Rule 2 are L-attributed.
D
Only Rule 1 is L-attributed.
4
GATE CSE 2019
Numerical
+2
-0
Consider the augmented grammar given below :

S' → S
S → 〈L〉 | id
L → L,S | S

Let I0 = CLOSURE ({[S' → ●S]}). The number of items in the set GOTO (I0 , 〈 ) is: _____.
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP