Premium
Implementing data abstraction features in a stack‐based language
Author(s) -
Gan J. D.,
Rosenberg J.
Publication year - 1979
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380090705
Subject(s) - computer science , initialization , parameterized complexity , abstraction , programming language , stack (abstract data type) , data type , object (grammar) , template , theoretical computer science , artificial intelligence , algorithm , philosophy , epistemology
This paper describes SIMPL‐D, a stack‐based language with data abstraction features, and some of the details of its implementation. The language allows users to define new types that are parameterized by size and to perform system‐defined operations (e.g. assignment) on objects with user‐defined types. The use of object‐describing templates in the implementation of storage allocation, assignment and returning values from functions is discussed. Finally, the conflicts between automatic initialization and separate compilation are explained.