Abstract
In this paper it is shown how the topic of BASED storage in PL/I can be used to illustrate a wide variety of concepts in intermediate level courses in data structures and programming languages. Because most instructors introduce the topic only from the point of view of a linked list, the true meaning of BASED storage and POINTERs is lost in the maze of practical problems which these features can be used to solve. Because BASED storage allows the programmer close access to physical storage, an understanding of these features goes a long way toward clarifying the behind the scenes actions involved in implementing and using data structures in high level languages.
- 1 Bates and Douglas, Programming Language/'One, Prentice-Hall Inc.Google Scholar
- 2 Hughs, PL/I Programming, John Wiley & Sons, (1973).Google Scholar
- 3 IBM, "Introduction to the LIst Processing Facilities of PL/I", GF20-0015, IBM.Google Scholar
- 4 IBM, "Techniques for Processing Lists in PL/I", GF20-0018, IBMGoogle Scholar
Index Terms
Approaches to based storage in PL/I
Recommendations
LSM-tree managed storage for large-scale key-value store
SoCC '17: Proceedings of the 2017 Symposium on Cloud ComputingKey-value stores are increasingly adopting LSM-trees as their enabling data structure in the backend storage, and persisting their clustered data through a file system. A file system is expected to not only provide file/directory abstraction to organize ...
Approaches to based storage in PL/I
SIGCSE '77: Proceedings of the seventh SIGCSE technical symposium on Computer science educationIn this paper it is shown how the topic of BASED storage in PL/I can be used to illustrate a wide variety of concepts in intermediate level courses in data structures and programming languages. Because most instructors introduce the topic only from the ...






Comments