Abstract
The Pascal identifier types that we have met so far are all examples of fixed structures in the sense that, when they are declared at the head of a program segment, they allocate a fixed amount of space into which we can store values. We have met simple types such as REAL and INTEGER, and structured types such as ARRAYs and RECORDs. Each of these has a specific role to play and contributes to the richness and versatility of the Pascal language. However once a program is compiled and running, if we try to access any element outside the declared bounds, an error will be caused. There is nothing we can do but alter the program. Thus the types already discussed cannot easily cope with situations in which we are not sure beforehand how large our structures are likely to be.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1987 E. J. Redfern
About this chapter
Cite this chapter
Redfern, E.J. (1987). Pointers and Polynomials. In: Introduction to Pascal for Computational Mathematics. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-18977-9_17
Download citation
DOI: https://doi.org/10.1007/978-1-349-18977-9_17
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-44431-3
Online ISBN: 978-1-349-18977-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)