A parser generator system to handle complete syntax

Simple item page
dc.contributor.advisorWilliams, M H
dc.contributor.authorOssher, Harold Leon
dc.date.accessioned2026-03-04T08:21:58Z
dc.date.issued1982
dc.description.abstractTo define a language completely, it is necessary to define both its syntax and semantics. If these definitions are in a suitable form, the parser and code-generator of a compiler, respectively, can be generated from them. This thesis addresses the problem of syntax definition and automatic parser generation.
dc.description.degreeMaster's thesis
dc.description.degreeMSc
dc.format.extent181 pages
dc.format.mimetypeapplication/pdf
dc.identifier.otherhttp://hdl.handle.net/10962/d1002036
dc.identifier.urihttps://researchrepository.ru.ac.za/handle/123456789/5792
dc.languageEnglish
dc.publisherRhodes University, Faculty of Science, Department of Computer Science
dc.rightsOssher, Harold Leon
dc.subjectGrammar, Comparative and general -- Syntax
dc.subjectParsing (Computer grammar)
dc.subjectProgramming languages (Electronic computers)
dc.subjectCompilers (Computer programs)
dc.titleA parser generator system to handle complete syntax
dc.typeAcademic thesis

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_parser_generator_system_to_handle_complete_synta_vital_4571.pdf
Size:
12.95 MB
Format:
Adobe Portable Document Format
Download

Collections

Masters Degrees (Computer Science)