A compiler language for data structures

  • Authors:
  • Neal Laurance

  • Affiliations:
  • -

  • Venue:
  • ACM '68 Proceedings of the 1968 23rd ACM national conference
  • Year:
  • 1968

Quantified Score

Hi-index 0.02

Visualization

Abstract

The subject of data structures has received a great deal of attention in the past few years, especially in relation to computer-aided design. Programming systems used for creating data structures (sometimes dignified by the name “graphical languages”)vary greatly in the rigidity of their representation and the types of facilities offered to the programmer. As an example of a high-level system, we can mention the formal language LEAP,1 in which the programmer can easily manipulate the logical elements of his model, and the structuring of the information (in the form of hash-coded tables) is performed automatically by the language system. At the other extreme we have a language like L62 which is a macro language useful in creating arbitrary list structures. The difference between these two “graphical languages” is so great that one could easily conceive of implementing the LEAP language using the L6 language. An excellent review of this subject is given by Gray.3 The present work is a language in the latter mold, to be used in the implementation of data-structure systems, rather than being a data-structure system itself. In many respects L6 has served as a model of the type of facilities desired, although the final product owes its parentage to several languages.