Skip Navigation

The Computer Journal 1968 11(1):22-25; doi:10.1093/comjnl/11.1.22
© 1968 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Finkelstein, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A compiler optimization technique

M. Finkelstein *

University of California, Irvine, California, USA

A technique is presented for effecting more optimal machine code, as the result of compilation of algorithmic language programs. The concept of a ‘deferred store’ is introduced, and it is indicated how this concept may be used in compilation schemes. The technique is particularly effective on computers with multiple accumulators.

First received February 1967. revised form November 1967.

* University of California, Irvine, California.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.