Explain dead code elimination, Computer Engineering

Assignment Help:

Explain briefly Dead code Elimination of the commonly used code optimization techniques

Dead code Elimination:

Code which is unreachable or which does not influence the program (for example dead stores) can be removed. In the illustration below, the value assigned to i is never utilized, and the dead store can be removed. The first assignment to global is dead, and the third assignment to global is not reachable; both can be removed.

int global; void f (){ int i;

i = 1;          /* dead store */

global = 1;     /* dead store */

global = 2;

return;

global = 3;     /* unreachable */}

Below is the code fragment after dead code elimination.

int global;

void f (){ global = 2; return;}


Related Discussions:- Explain dead code elimination

Define colour depth in graphic display system, Q. Define Colour Depth in gr...

Q. Define Colour Depth in graphic display system? It is clear that an image contains an array of pixels.  If we tell which pixels are 'off' and which are 'on' to the monitor, i

Web designing, how to start a web designing would you please guide me

how to start a web designing would you please guide me

Characteristics of large register file, Characteristics of large-register-f...

Characteristics of large-register-file and cache organizations Large Register File Cache Hold local variables for almost all functio

How is a valid user identifier accomplished, How is a valid user identifier...

How is a valid user identifier accomplished? A valid user identifier is accomplished within one or more of given ways: • Provide some password, which only user knows. • P

Differences between internal and external fragmentation, Explain the differ...

Explain the differences between Internal and external fragmentation. Internal and external fragmentation (1) While memory allocated to a process is a little larger than th

What is the basic workflow order for color match, Question: (a) What is...

Question: (a) What is the difference between the Color Pass and the Color Replace effects? (b) What is the basic workflow order for Color Match? (c) Explain clearly the

Illustrate working of asynchronous counters, Q. Illustrate working of Async...

Q. Illustrate working of Asynchronous Counters? This is more frequently referred as ripple counter as the change that takes place in order to increment counter ripples through

Types of addressing modes in assembly language, Types of Addressing Modes: ...

Types of Addressing Modes: Each instruction of a computer mentions an operation on certain data. There are many ways of specifying address of the data to be operated on. These

Data structure, explain different type of sparse matrix

explain different type of sparse matrix

State the optimal route of node, State the optimal route of node Consid...

State the optimal route of node Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd