Test: Loop Optimization - Computer Science Engineering (CSE) MCQ

On the number of strings/life reacts

Code segment to be defined after data segment

On unconditional rump

None of the mentioned

Loop rolling

Loop jamming

Constant folding

None of the mentioned

Code is converted into assembly

Table of rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure

None of the mentioned

Both of the mentioned

Status of each program

Information to a programmer using the system

Both of the mentioned

None of the mentioned

Recognize the language and to cal the appropriate action routines that will generate the intermediate form or matrix for these constructs

Build a literal table and an identifier table

Build a uniform symbol table

Parse the source program into the basic elements or tokens of the language

E (αf+β g) =α E(f) +β E (g)

E (αf +β g )=. ( α+ β )+ E (f + g)

E (αf +β g )=α E (f+gβ)

E (αf +β g )=αβ E (f + g)

Assign address to all statements

Save the values assigned to all labels for use in pass 2

Perform some processing

All of the mentioned

Terminal Table

Literal Table

Identifier Table

None of the mentioned

Allocate memory for the programs and resolve symbolic references between objects decks

Address dependent locations, such as address constants, to correspond to the allocated space

Physically place the machine instructions and data into memory

All of the mentioned

At a fixed address in main memory

At a fixed location on the disk

Anywhere on the disk

None of the mentioned