GATE CSE 2016 Set 1 | Syntax Directed Translation Question 10 | Compiler Design

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 2003

MCQ (Single Correct Answer)

-0.3

Which of the following statements is FALSE?

In statically typed languages, each variable in a program has a fixed type

In un-typed languages, values do not have any types

In dynamically typed languages, variables have no types

In all statically typed languages, each variable in a program is associated with values of only a single type during the execution of the program

PREVIOUS NEXT

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

Number Systems Boolean Algebra K Maps Combinational Circuits 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