GATE CSE 2024 Set 2 | Parsing Question 1 | Compiler Design

GATE CSE 2024 Set 2

MCQ (More than One Correct Answer)

-0.33

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

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

Theory of Computation

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

Operating Systems

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

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

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

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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