Compiler Design
Lexical Analysis
Marks 1Marks 2
Syntax Directed Translation
Marks 1Marks 2
Code Generation and Optimization
Marks 1Marks 2
1
GATE CSE 2024 Set 1
MCQ (More than One Correct Answer)
+1
-0

Which of the following is/are Bottom-Up Parser(s)?

A

Shift-reduce Parser

B

Predictive Parser

C

LL(1) Parser

D

LR Parser

2
GATE CSE 2023
MCQ (Single Correct Answer)
+1
-0.33

Consider the following statements regarding the front-end and back-end of a compiler.

S1: The front-end includes phases that are independent of the target hardware.

S2: The back-end includes phases that are specific to the target hardware.

S3: The back-end includes phases that are specific to the programming language used in the source code.

Identify the CORRECT option.

A
Only S1 is TRUE.
B
Only S1 and S2 is TRUE.
C
S1, S2 and S3 are all TRUE.
D
Only S1 and S3 are TRUE.
3
GATE CSE 2022
MCQ (Single Correct Answer)
+1
-0.33

Which one of the following statements is TRUE?

A
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.
B
Symbol table is accessed only during the lexical analysis phase.
C
Data flow analysis is necessary for run-time memory management.
D
LR(1) parsing is sufficient for deterministic context-free languages.
4
GATE CSE 2022
Numerical
+1
-0

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 I0 is the set of two LR(0) items {[S' $$\to$$ S.], [S $$\to$$ S. + R]}, then goto(closure(I0), +) contains exactly _________ items.

Your input ____
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization