Premium
Higher level programming and data abstractions—a case study using enhanced C
Author(s) -
Katzenelson Jacob
Publication year - 1983
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.4380130703
Subject(s) - computer science , readability , sort , programming language , code (set theory) , set (abstract data type) , macro , data structure , process (computing) , source code , theoretical computer science , parallel computing , database
In this work the topological sort algorithm is programmed in EC, taking advantage of EC's set‐oriented features and its macro‐like data abstractions. The main issue was whether efficient run‐time code could be achieved while maintaining program structure and readability. The main conclusion is that in this particular example such code was achieved. Program structure and readability were maintained despite changes in both the higher level program and the data abstractions. Other conclusions are the following: (1) The program design process requires dependent data abstractions; (2) it is iterative rather than strictly top down; choosing data abstractions for run‐time efficiency requires insight into the properties of the algorithm. It is believed that global analysis can be used to enhance such insight.