Test: Eliminating Local Common Sub Expressions


10 Questions MCQ Test Compiler Design | Test: Eliminating Local Common Sub Expressions


Description
This mock test of Test: Eliminating Local Common Sub Expressions 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) Test: Eliminating Local Common Sub Expressions (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Eliminating Local Common Sub Expressions quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: Eliminating Local Common Sub Expressions exercise for a better result in the exam. You can find other Test: Eliminating Local Common Sub Expressions extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

Select a Machine Independent phase of the compiler

Solution:

All of them work independent of a machine.

QUESTION: 2

A system program that combines the separately compiled modules of a program into a form suitable for execution?

Solution:

A loader which combines the functions of a relocating loader with the ability to combine a number of program segments that have been independently compiled.

QUESTION: 3

Which of the following system software resides in the main memory always

Solution:

Loader is used to loading programs.

QUESTION: 4

Output file of Lex is _____ the input file is Myfile.

Solution:

This Produce the filr “myfile.yy.c” which we can then compile with g++.

QUESTION: 5

Type checking is normally done during

Solution:

It is the function of Syntax directed translation.

QUESTION: 6

Suppose One of the Operand is String and other is Integer then it does not throw error as it only checks whether there are two operands associated with ‘+’ or not .

Solution:

Syntax analyser does not check the type of the operand.

QUESTION: 7

In Short Syntax Analysis Generates Parse Tree.

Solution:

Short Syntax Analysis generates a parse tree.

QUESTION: 8

 By whom is the symbol table created?

Solution:

Symbol table is created by the compiler which contains the list of lexemes or tokens.

QUESTION: 9

 What does a Syntactic Analyser do?

Solution:

Syntax analyzer will just create parse tree. Semantic Analyzer checks the meaning of the string parsed.

QUESTION: 10

 Semantic Analyser is used for

Solution:

 Maintaining the Symbol Table for each block.
Source Program for Semantic Errors. Collects Type Information for Code Generation. Reporting compile-time errors in the code generating the object code (e.g., assembler or intermediate code).