A brief survey of list-processing languages and list-processors is made, pointing out the shortcomings of each. The need for a practical, applications-oriented list-processor, along with a list of features that would be required, is then presented. A list-processor that is designed to fulfil these requirements is proposed. The presentation includes a detailed description of the storage structure and management algorithms, the primitive routines that have been defined, plus the routines and features available for dynamic storage allocation and list-processing. Finally, a comparison between the proposed list-processor and two available list-processors, SLIP and DYSTAL, is carried out. / Science, Faculty of / Computer Science, Department of / Graduate
| Identifer | oai:union.ndltd.org:UBC/oai:circle.library.ubc.ca:2429/35171 |
| Date | January 1968 |
| Creators | Horvath, Leonard James |
| Publisher | University of British Columbia |
| Source Sets | University of British Columbia |
| Language | English |
| Detected Language | English |
| Type | Text, Thesis/Dissertation |
| Rights | For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
Page generated in 0.0017 seconds