Abstract
In this paper we examine alternative approaches towards the traditional optimisation technique of peepholing. Three simple methods of generating quality code are given. The first method improves poor juxtapositions while generating code, the second is an alternative usage of a solution to the knapsack problem. A third hybrid algorithm combines the strong points of both these solutions, and is presented as an alternative to conventional peepholing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
Alfred V. Aho, Ravi Sethi and Jeffrey D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Westley, 1986.
Andrew W. Appel and David B. MacQueen. A Standard ML compiler. In Functional Programming Languages and Computer Architecture, pages 301–324. Springer-Verlag, 1987.
Luca Cardelli. The Functional Abstract Machine. Polymorphism, 1 (1), 1983.
Andrew J. Gill. A Sun 3 Native Code Generator for Edinburgh ML. Honours thesis, Edinburgh University, May 1991.
T. Johnsson. Target Code Generation from G-Machine code. In Workshop on Graph Reduction, pages 119–159. Springer-Verlag, 1986.
David Matthews. Papers on Poly ML. Technical report, Computer Laboratory, University of Cambridge, February 1989.
Simon Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.
Robert Sedgewick. Algorithms. Addison Wesley, 2nd edition, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 British Computer Society
About this paper
Cite this paper
Gill, A. (1992). A Novel Approach Towards Peephole Optimisations. In: Heldal, R., Holst, C.K., Wadler, P. (eds) Functional Programming, Glasgow 1991. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3196-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3196-0_8
Publisher Name: Springer, London
Print ISBN: 978-3-540-19760-7
Online ISBN: 978-1-4471-3196-0
eBook Packages: Springer Book Archive