GATE CSE 2025 Set 1 | Parsing Question 3 | Compiler Design

GATE CSE 2025 Set 1

MCQ (Single Correct Answer)

-0.33

Which ONE of the following statements is FALSE regarding the symbol table?

Symbol table is responsible for keeping track of the scope of variables.

Symbol table can be implemented using a binary search tree.

Symbol table is not required after the parsing phase.

Symbol table is created during the lexical analysis phase.

GATE CSE 2024 Set 2

MCQ (More than One Correct Answer)

-0

Which of the following statements is/are FALSE?

An attribute grammar is a syntax-directed definition (SDD) in which the functions in the semantic rules have no side effects

The attributes in a L-attributed definition cannot always be evaluated in a depth-first order

Synthesized attributes can be evaluated by a bottom-up parser as the input is parsed

All L-attributed definitions based on LR(1) grammar can be evaluated using a bottom-up parsing strategy

GATE CSE 2024 Set 1

MCQ (More than One Correct Answer)

-0

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

Shift-reduce Parser

Predictive Parser

LL(1) Parser

LR Parser

GATE CSE 2023

MCQ (Single Correct Answer)

-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.

Only S1 is TRUE.

Only S1 and S2 is TRUE.

S1, S2 and S3 are all TRUE.

Only S1 and S3 are TRUE.

GATE CSE Subjects

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Logical Reasoning Numerical Ability

Discrete Mathematics

Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory