Integrating code generation and peephole optimization
Peephole optimization when integrated with automatic code generation into a uniform framework has significant advantages in the specification and implementation of efficient compiler back-ends. Attribute grammars provide a framework for expression of machine-specific code optimizations. We present a grammar-driven peephole optimization algorithm that is particularly well suited to attributed-parsing code generators. Integration via semantic attributes corrects interrelated phase-ordering problems and produces a faster and smaller compiler back- end.
- A Formal Framework for the Derivation of Machine-Specific Optimizers
- An efficient context-free parsing algorithm
- Deterministic parsing of ambiguous grammars
- Efficient string matching
- scientific article; zbMATH DE number 3926277 (Why is no real title available?)
- scientific article; zbMATH DE number 3497311 (Why is no real title available?)
- Optimal Code Generation for Expression Trees
- Postpass Code Optimization of Pipeline Constraints
- Programming with Equations
- Recognition and selection of idioms for code optimization
- Using Peephole Optimization on Intermediate Code
This page was built for publication: Integrating code generation and peephole optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822527)