Abstract
Suppose we wish to read a word and then write it backwards, from right to left. This problem can be solved in a trivial way if the length of the word is known in advance. For example, if the length of the word is known to be six, the program in Fig. 9.1 will suffice. For example, if the word MODULA is read, the program will write ALUDOM.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Thalmann, D. (1985). Array Types. In: Modula-2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69668-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-69668-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13297-4
Online ISBN: 978-3-642-69668-8
eBook Packages: Springer Book Archive