Show simple item record

The implementation of a generalized table driven back end processor

dc.contributor.advisorMacGregor, Kenen_ZA
dc.contributor.authorBroadbent, Christopher Franken_ZA
dc.date.accessioned2015-12-20T15:43:19Z
dc.date.accessioned2018-11-26T13:53:54Z
dc.date.available2015-12-20T15:43:19Z
dc.date.available2018-11-26T13:53:54Z
dc.date.issued1987en_ZA
dc.identifier.urihttp://hdl.handle.net/11427/15900
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/11427/15900
dc.descriptionIncludes bibliographical references.en_ZA
dc.description.abstractThis thesis discusses the University of Cape Town implementation of a table driven back end processor. The back end processor takes as input an intermediate tree representation of a high level programming language. It produces as output an object text ready for assembly. The specifications of the input tree and the output object are supplied to the back end processor via two tables. The initial motivation for this project was the need to provide a back end processor capable of taking the DIANA tree output of the University of Cape Town front end processor and producing a corresponding P-code object. The University of Cape Town back end processor is implemented using Pascal and C in a Unix V environment.en_ZA
dc.language.isoengen_ZA
dc.subject.otherComputer architectureen_ZA
dc.titleThe implementation of a generalized table driven back end processoren_ZA
dc.typeThesisen_ZA
dc.type.qualificationlevelMastersen_ZA
dc.type.qualificationnameMScen_ZA
dc.publisher.institutionUniversity of Cape Town
dc.publisher.facultyFaculty of Scienceen_ZA
dc.publisher.departmentDepartment of Computer Scienceen_ZA


Files in this item

FilesSizeFormatView
thesis_sci_1987_broadbent_christopher_frank.pdf4.482Mbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record