ISSN:
1572-9125
Keywords:
D.2.7
;
D.3.3
;
E.1
;
Algorithms
;
Languages
;
Data types
;
Data structures
;
Arrays
;
Graphs
;
Restructuring
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract In older languages lists, trees and graphs are represented with sets of arrays where indices of elements correspond to pointers to the nodes of the data structure. We present an algorithm that replaces such arrays with objects allocated dynamically from the heap, and indices with true pointers. Generated pointers are strongly typed and elements of logically related arrays are combined into records. The algorithm is potentially useful, especially in automatic translation between high-level programming languages.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01952678
Permalink