Peephole Optimization Technique for analysis and review of Compiler Design and Construction

نویسندگان

  • Chirag H. Bhatt
  • Harshad B. Bhadka
چکیده

In term of Compiler optimization, classical compilers implemented with an effective optimization technique called Peephole optimization. In the early stage of the implementation of this technique basically applied using string pattern matching performed on the regular expression and which are known as classical peephole optimizers. In the classical optimizers, the string pattern matching approach is considered as a processing of the input of the syntax of assembly code but its meaning gets lost. This paper explores prior research and current research issues in term of ‘Optimizing’ compilers with the implementation of Peephole optimization using different pattern matching approach that focuses on regular expression. In several research discussed below targets the implementation of pattern matching approach based on rule application strategy to achieve optimization of assembly code syntax for specific machine or retargetable [machine independent] in context of structured programming, procedure oriented programming and Object Oriented Programming.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Compiler Design Handbook: Optimizations and Machine Code Generation

The compiler design handbook: optimizations and machine code generation pdf C# Programming: From Problem Analysis to Program Design, 3rd Edition pdf Check our section of free e-books and guides on Compiler Design now! Parser, scanner, Optimization, Virtual Machines, Code Generation, Peephole Optimization. and the major algorithms used to translate code from highlevel to machine language. Theory...

متن کامل

Precondition Inference for Peephole Optimizations in LLVM

Peephole optimizations are a common source of compiler bugs. Compiler developers typically transform an incorrect peephole optimization into a valid one by strengthening the precondition. This process is challenging and tedious. This paper proposes ALIVE-INFER, a data-driven approach that infers preconditions for peephole optimizations expressed in Alive. ALIVE-INFER generates positive and nega...

متن کامل

A Retargetable Technique for Predicting Execution Time

Predicting the execution times of straight-line code sequences is a fundamental problem in the design and evaluation of hard-real-time systems. The reliability of system-level timings and schedulability analysis rests on the accuracy of execution time predictions for the basic schedulable units of work. Obtaining such predictions for contemporary microprocessors is diicult. First a summary of s...

متن کامل

Fast Peephole Optimization Techniques

SUMMARY Techniques for increasing the throughput of a peephole optimizer for intermediate code are presented. An analysis of the optimations to be performed enables an efficient matching and replacement algorithm to be found which minimizes rescanning after a successful replacement. The optimizer uses procedural interfaces; both for the input from the front end phase of the compiler and for the...

متن کامل

Practical formal techniques and tools for developing LLVM’s peephole optimizations

Peephole optimizations are local transformations which perform algebraic simplification to improve performance, reduce code size, or canonicalize code before it is presented to other stages of a compiler. They are a common source of compiler errors. This dissertation presents Alive, a domain-specific language for specifying peephole optimizations in LLVM, and the Alive-NJ toolkit, which automat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013