Abstract
Array, record and set structures share the common property that they are static. This implies that variables of such a structure maintain the same structure during the whole time of their existence. In many applications, this is an intolerable restriction; they require data which do not only change their value, but also their composition, size, and structure. Typical examples are lists and trees that grow and shrink dynamically. Instead of providing list and tree structures, a collection that for some applications would again not suffice, Modula offers a basic tool to construct arbitrary structures. This is the pointer type.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wirth, N. (1982). Dynamic data structures and pointers. In: Programming in Modula-2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96717-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-96717-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-96719-1
Online ISBN: 978-3-642-96717-7
eBook Packages: Springer Book Archive