GATE CSE 2021 Set 2 | Syntax Directed Translation Question 4 | Compiler Design

GATE CSE 2021 Set 2

MCQ (Single Correct Answer)

-0.33

Consider the following ANSI C program:

int main() {

Integer x;

return 0;

}

Which one of the following phases in a seven-phase C compiler will throw an error?

Syntax analyzer

Semantic analyzer

Machine dependent optimizer

Lexical analyzer

GATE CSE 2016 Set 1

Numerical

-0

Consider the following code segment.

x = u - t;
y = x * v;
x = y + w;
y = t - z;
y = x * y;

The minimum number of total variables required to convert the above code segment to static single assignment form is .

Your input ____

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

-0.3

In the context of abstract-syntax-tree $$(AST)$$ and control-flow-graph $$(CFG),$$ which one of the following is TRUE?

In both $$AST$$ and $$CFG,$$ let node $${N_2}$$ be the successor of node $${N_1}.$$ In the input program, the code corresponding to $${N_2}$$ is present after the code corresponding to $${N_1}$$

For any input program, neither $$AST$$ nor $$CFG$$ will contain a cycle

The maximum number of successors of a node in an $$AST$$ and a $$CFG$$ depends on the input program

Each node in $$AST$$ and $$CFG$$ corresponds to at most one statement in the input program

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

-0.3

One of the purposes of using intermediate code in compilers is to

make parsing and semantic analysis simpler.

improve error recovery and error reporting.

increase the chances of reusing the machine-independent code optimizer in other compilers.

improve the register allocation.

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 Dynamic Programming P and NP Concepts

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

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

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

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

Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory 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