Abstract
The stack machine requires a protocol stack and a value stack in order to store “pending” operations and their operands. This is not necessary for repetitive routines and systems. The stack machine can then degenerate into a Babbage-Zuse machine. In this chapter we discuss methods and approaches for the transformation of certain recursive routines and hierarchically structured systems of routines into repetitive form.
“… the transformation from recursion to iteration is one of the most fundamental concepts of computer science.”
D. E. Knuth 1974
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bauer, F.L., Wössner, H., Partsch, H., Pepper, P. (1982). Transformation into Repetitive Form. In: Algorithmic Language and Program Development. Texts and Monographs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61807-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-61807-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-61809-3
Online ISBN: 978-3-642-61807-9
eBook Packages: Springer Book Archive