GATE CSE 2022 | Parsing Question 1 | Compiler Design

GATE CSE 2022

MCQ (Single Correct Answer)

-0.33

Which one of the following statements is TRUE?

The LALR(1) parser for a grammar G cannot have reduce-reduce conflict if the LR(1) parser for G does not have reduce-reduce conflict.

Symbol table is accessed only during the lexical analysis phase.

Data flow analysis is necessary for run-time memory management.

LR(1) parsing is sufficient for deterministic context-free languages.

GATE CSE 2022

Numerical

-0.33

Consider the augmented grammar with {+, *, (, ), id} as the set of terminals.

S' $$\to$$ S

S $$\to$$ S + R | R

R $$\to$$ R * P | P

P $$\to$$ (S) | id

If I₀ is the set of two LR(0) items {[S' $$\to$$ S.], [S $$\to$$ S. + R]}, then goto(closure(I₀), +) contains exactly _________ items.

Your input ____

GATE CSE 2020

Numerical

-0.33

Consider the following grammar.

S $$ \to $$ aSB| d
B $$ \to $$ b

The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is _______.

Your input ____

GATE CSE 2019

Numerical

-0.33

Consider the grammar given below:

S → Aa

A → BD

B → b | ε

D → d | ε

Let a, b, d, and $ be indexed as follows: GATE CSE 2019 Compiler Design - Parsing Question 8 English

Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in the descending order. (For example, if the FOLLOW set is {a, b, d, $}, then the answer should be 3210)

Your input ____