The report will demonstrate how to implement a basic linked-list data structure in RAM for C. STRING. The result of this implementation is Memory Allocation or Data Management which obtains or releases memory space as required in C. STRING. The basic concepts of data structures such as strings, lists and stacks are discussed and the algorithm for allocation of space is developed. The C. STRING user language TOSCL, and the TOSCL parse algorithm with Data Management is described. Finally, the INTEL's Schottky Bipolar LSI microprocessor is microcoded to implement Data Management.
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Petrasko, Brian E.
Master of Science (M.S.)
College of Engineering
Length of Campus-only Access
Masters Thesis (Open Access)
Firestone, John H., "Implementing Multiple-Linked Lists in the Minicomputer-Microcomputer String Processor, C. String" (1976). Retrospective Theses and Dissertations. 216.