Abstract
The previous chapters have concentrated on the basic concepts of associative computing and the basic ASC statements and data structures which support them. This chapter describes the recursewhile-stack construct. The basic ASC language does not support general recursion. However, it has a structured construct which supports the stacking of variables and recursive execution.
This is a preview of subscription content, log in via an institution to check access.
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
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Potter, J.L. (1992). ASC Recursion. In: Associative Computing. Frontiers of Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3300-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3300-9_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6452-8
Online ISBN: 978-1-4615-3300-9
eBook Packages: Springer Book Archive