Semantics and implementation of prefixing at many levels
A generalization of Simula's prefixing of classes is presented. The notion of one-level prefixing is first introduced by means of the example of Simula 67; the semantics of a programming language with prefixing at many levels is then discussed and analyzed.
The principles for efficiently implementing programming languages with prefixing of classes at many levels are described. A generalized display mechanism is introduced and the correctness of a display update algorithm is proved. A new data structure for efficient identification of dynamic objects is also presented.
Keywordsblock structured programming languages classes prefixing methods of implementation Simula 67
Unable to display preview. Download preview PDF.
- Bartol W.M. "The definition of the semantics of some instructions of a block structured language with type prefixing.", manuscript, 1980.Google Scholar
- Berry D.M., Chirica L., Johnston J.B., Martin D.F. and Sorkin A. "Time required for reference count management in retention block-structured languages." Part 1, Int. J. Comp. and Inf. Sciences, Vol.7, No.1 (March 1978), pp.11–64.Google Scholar
- Bobrow D.G., Wegbreit B. "A model and stack implementation of multiple environments", Comm.A.C.M., Vol.16, No.10 (Oct.1973), pp.591–603.Google Scholar
- Dahl O-J., Myrhaug B., Nygaard K., "Simula 67 Common Base Language", Norwegian Computing Center 1970.Google Scholar
- Dahl O-J., Wang A., "Coroutine sequencing in a block structured environment", B.I.T. Vol.11 (1971), pp.425–449.Google Scholar
- Dijkstra E.W., "Recursive programming", Numerische Mathematik 2, Vol.2 (1960), pp.312–318.Google Scholar
- Gries D., "Compiler construction for digital computers." New York, Wiley 1971.Google Scholar