Affiliation:
1. University of California
Abstract
The data structures proposed for the Madcap VI programming language are described. The declaration, value specification, and referencing of these structures are defined formally and their implementation using "codewords" is discussed. A structure declaration has the form of a directed tree, and a structure itself, since it can contain references to other structures, including itself, has the form of a directed graph. Levels of the tree may be ordered or unordered. Variables of primitive data-type (real, complex, etc.) are naturally considered as empty structures. The possibility for both multi-and fractional-word representation of structures is evident, but, of course the language itself is implementation independent. Thus a <u>field</u> is equivalent to a sub-structure. The Madcap VI generalized data structures are compared to data structure concepts in PL/1.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A facility for defining and manipulating generalized data structures;ACM Transactions on Database Systems;1977-12
2. Fen—an axiomatic basis for program semantics;Communications of the ACM;1973-08
3. An implementation base for efficient data structuring;International Journal of Computer & Information Sciences;1972-09
4. The unified data structure capability in Madcap VI;International Journal of Computer & Information Sciences;1972-09