Skip to main content
Log in

The unified data structure capability in Madcap VI

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The data structures which form an integral part of the Madcap VI programming language are described. The initialization (declarationand constructor) expressions and selector expressions of these structures are defined and their implementation using “codewords” is discussed. Structures, since they can contain references to other structures (including themselves), have the form of directed trees (graphs). Variables of primitive data type (real, complex, etc.) are naturally considered as degenerate graphs, merely single nodes. The possibility for both multiword and fractional-word representation of structures is evident, but the language itself is implementation-independent. Thus a “field” is simply a substructure. The Madcap VI data structures are compared to data structure concepts in PL/I.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. G. Jodeit, “Storage organization in programming systems,”Commun. ACM 11(11): 741–746 (1968).

    Google Scholar 

  2. D. E. Knuth,The Art of Computer Programming, Vol. 1, Fundamental Algorithms (Addison-Wesley, Reading, Mass., 1969).

    Google Scholar 

  3. C. H. Lindsey and S. G. van der Meulen,Informal Introduction to ALGOL 68 (North-Holland, Amsterdam, 1971).

    Google Scholar 

  4. J. B. Morris and M. B. Wells, “Generalized data structures in Madcap VI,” inProc. of SIGPLAN Symposium on Data Structures in Programming Languages, Gainesville,Florida, February 25–27, 1971, pp. 321–336.

  5. P. Naur (ed.), “Revised report on the algorithmic language ALGOL 60,”Commun. ACM 6(1): 1–17 (1963).

    Google Scholar 

  6. J. E. Sammet,Programming Languages: History and Fundamentals (Prentice-Hall, Englewood Cliffs, New Jersey, 1969).

    Google Scholar 

  7. M. B. Wells, “MADCAP: A scientific compiler for a displayed formula textbook language,”Commun. ACM 4(1): 31–36 (1961).

    Google Scholar 

  8. M. B. Wells, “Aspects of language design for combinatorial computing,”IEEE Trans. Comput. C-13(4): 431–438 (1964).

    Google Scholar 

  9. M. B. Wells,Elements of Combinatorial Computing (Pergamon, Oxford, 1971).

    Google Scholar 

  10. W. Wulf, C. Geschke, D. Wile, and J. Apperson, “Reflections on a systems programming language,” inProc. of SIGPLAN Symposium on Languages for Systems Implementation, Lafayette, Indiana, October 25–26, 1971, pp. 42–49.

  11. W. Wulfet al., Bliss Reference Manual (Computer Science Department Report, Carnegie-Mellon University, Pittsburgh, Pa., 1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work supported by the United States Atomic Energy Commission.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wells, M.B., Morris, J.B. The unified data structure capability in Madcap VI. International Journal of Computer and Information Sciences 1, 193–208 (1972). https://doi.org/10.1007/BF00977409

Download citation

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00977409

Keywords

Navigation