Return to search

Implementing Multiple-Linked Lists in the Minicomputer-Microcomputer String Processor, C. String

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.

Identiferoai:union.ndltd.org:ucf.edu/oai:stars.library.ucf.edu:rtd-1215
Date01 January 1976
CreatorsFirestone, John H.
PublisherFlorida Technological University
Source SetsUniversity of Central Florida
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceRetrospective Theses and Dissertations
RightsPublic Domain

Page generated in 0.0023 seconds