Design And Implementation Of Code Optimization: Implementation Of Scalar Optimization

ABSTRACT
Optimization is the process of transforming a piece of code to make more efficient (either in terms of time or space) without changing its output or side-effects. The only difference visible to the code’s user should be that it runs faster and/or consumes less memory. It is really a misnomer that the name implies you are finding an "optimal" solution— in truth, optimization aims to improve, not perfect, the result. Optimization is the field where most compiler research is done today. The tasks of the front-end (scanning, parsing, semantic analysis) are well understood and unoptimized code generation is relatively straightforward. Optimization, on the other hand, still retains a sizable measure of mysticism. High-quality optimization is more of an art than a science. Compilers for mature languages aren’t judged by how well they parse or analyze the code—you just expect it to do it right with a minimum of hassle—but instead by the quality of the object code they produce.


 TABLE OF CONTENT
TITLE PAGE                                                                        
ABSTRACT                                   
ORGANIZATION OF WORK                           
TABLE OF CONTENT                               

CHAPTER ONE
1.0    INTRODUCTION                               
1.1    STATEMENT OF PROBLEM                       
1.2    AIMS AND OBJECTIVES                
1.3    PURPOSE OF STUDY                       
1.4    SIGNIFICANT OF STUDY                       
1.5    SCOPE/DELIMITATIONS                       
1.6    LIMITATIONS/CONSTRAINTS                   
1.7    ASSUMPTION OF STUDY                   
1.8    DEFINITION OF TERMS