Peephole Optimization - Compiler Design


10 Questions MCQ Test Compiler Design | Peephole Optimization - Compiler Design


Description
This mock test of Peephole Optimization - Compiler Design for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 10 Multiple Choice Questions for Computer Science Engineering (CSE) Peephole Optimization - Compiler Design (mcq) to study with solutions a complete question bank. The solved questions answers in this Peephole Optimization - Compiler Design quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Peephole Optimization - Compiler Design exercise for a better result in the exam. You can find other Peephole Optimization - Compiler Design extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

Relocating bits used by relocating loader are specified by

Solution:

Takes an object files and combines them into a single executable file, library file, or another object file.

QUESTION: 2

What is the binary equivalent of the decimal number 368

Solution:

368 binary equivalents is
8=1000
6=0110
3=0011
So 1101101000.

QUESTION: 3

 AB+(A+B)’ is equivalent to

Solution:

 It is equivalent to A? B.

QUESTION: 4

A top down parser generates

Solution:

Top-down parsing is a parsing strategy where one first looks at the highest level of the parse tree and works down the parse tree by using the rewriting rules of a formal grammar.

QUESTION: 5

 Running time of a program depends on

Solution:

Run time, runtime or execution time is the time during which a program is running (executing).

QUESTION: 6

Which of the following is the fastest logic

Solution:

In electronics, emitter-coupled logic (ECL) is a high-speed integrated circuit.

QUESTION: 7

A bottom up parser generates

Solution:

This corresponds to starting at the leaves of the parse tree also known as shift-reduce parsing.

QUESTION: 8

A grammar that produces more than one parse tree for some sentence is called

Solution:

 Ambiguous grammar has more than one parse tree.

QUESTION: 9

 An optimizer Compiler

Solution:

In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program.

QUESTION: 10

The linker

Solution:

It is a program that takes one or more object files generated by a compiler and combines them into a single executable file, library file, or another object file.

Related tests