CS362 2011F Compilers

Class 38: Translating For Loops

Back to Translating Loops. On to The Run-Time Stack.

This outline is also available in PDF.

Held: Wednesday, 30 November 2011

Summary: We look at details of the translation of Pascal-style for loops, considering some of the main complexities, such as potential overflow of the loop variable.

Related Pages:

Notes:

Overview:

A Left-over Question: For Loops

Looking Ahead: Translating Procedure Calls

Back to Translating Loops. On to The Run-Time Stack.

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Wed Dec 7 10:26:36 2011.
The source to the document was last modified on Fri Aug 26 13:03:12 2011.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS362/2011F/Outlines/outline.38.html.

Samuel A. Rebelsky, rebelsky@grinnell.edu