© 1981 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Data structures and descriptors in the ICL 2900 series and beyond

1 Department of Computing Imperial College, 180 Queen's Gate, London, UK, 2 Nucleo de Computacao Eletronica University of Rio de Janeiro, Brazil
This paper studies descriptors and their use as a technique for the implementation of data structures, especially Pascal data structures. After presenting the basic notions of descriptors and types we examine the case of the descriptor on the ICL 2900 series computers, its use and problems for the mapping of Pascal data types. A solution for the problems posed by the ICL 2900-type of descriptor is then proposed. The solution makes use of a more extensive set of descriptors, basically one for each of the Pascal types, and a set of primitive operations on this set enabling the descriptors to be computed and manipulated at run time. This facility is designed to cope with the recursive character of Pascal data types. The resulting scheme is general and simplifies the work needed by the compiler in the translation of names.
Received March 1980.
* Department of Computing Imperial College, 180 Queen's Gate, London SW7 2BZ, UK.
Nucleo de Computacao Eletronica University of Rio de Janeiro, Brazil.