Abstract
Various approaches to the problem of programming recursively defined functions infortran are discussed. The only acceptable method in ASAfortran is shown to be most easily programmed using a stack containing not addresses, but function arguments. The stack is built up and, when full, the function is constructed from the stack elements. A sequence of examples of increasing complexity is given to demonstrate the technique, including one in which a queue is found to be more appropriate than a stack. The emphasis throughout is on the simplicity of the technique.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. A. Ayres,Commun. ACM,6 667–668 (1963).
A. C. Day,Fortran Techniques with Special Reference to Non-numerical Applications (Cambridge University Press, Cambridge, 1972).
H. A. Maurer and M. R. Williams,A Collection of Programming Problems and Techniques (Prentice Hall, Englewood Cliffs, N.J., 1972).
J. Morris,Software Age 38–42 (January 1969).
H. G. Rice,Commun. ACM 8, 114–115 (1965).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Guttmann, A.J. Programming recursively defined functions infortran . International Journal of Computer and Information Sciences 5, 111–122 (1976). https://doi.org/10.1007/BF00975628
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00975628