On a uniform formal description of data structures
The paper gives a semantic for data structures defining a model in which both types and objects are based on certain right-linear grammars. The advantage of the proposed semantic is the uniformity with which the selecting and accessing operations are explained respectively. The distinction between accessing variables or constants is consistently based on a property of the corresponding selectors. Usual difficulties in distinguishing between constant and variable objects in programming languages can thus be avoided. Another advantage is that selective assignments to components of structures are contained in the model in a very natural way.
KeywordsTerminal Node Terminal Vertex Binary Search Tree Type List Elementary Object
Unable to display preview. Download preview PDF.
- 1.van Wijngaarden, A. (ed.); Mailloux, B.J.; Peck, J.E.L.; Koster, C.H.A.: Report on the Algorithmic Language ALGOL 68. Num. Math. 14, 79–218 (1969)Google Scholar
- 2.Bekić, H.; Walk, K.: Formalization of Storage Properties. In: Symposium on semantics of algorithmic languages (E. Engeler, ed.), Lecture Notes in Mathematics, Vol. 188, p. 28–61. Berlin-Heidelberg-New York: Springer 1971Google Scholar
- 3.Jensen, K.; Wirth, N.: PASCAL. User Manual and Report, 2nd ed.. Berlin-Heidelberg-New York: Springer 1975Google Scholar
- 4.Dijkstra, E.W.: A Discipline of Programming. Englewood Cliffs: Prentice Hall 1976Google Scholar
- 5.Bauer, F.L.: Algorithmische Sprachen. Kap. 4–7, Vorlesungsskriptum Techische Universität München, Institut für Informatik, Februar 1978Google Scholar