Files in this item
An implementation of Reeve's syntax directed translator
Item metadata
dc.contributor.advisor | Davie, A. J. T. (Antony J. T.), 1939- | en |
dc.contributor.author | Vashishta, Ambrish | en |
dc.coverage.spatial | 1 vol. | en |
dc.date.accessioned | 2021-04-08T08:57:14Z | |
dc.date.available | 2021-04-08T08:57:14Z | |
dc.date.issued | 1978 | |
dc.identifier.uri | https://hdl.handle.net/10023/21855 | |
dc.description.abstract | This thesis describes an implementation of a syntax-directed translator originally due to C.M. Reeves. The translator program simulates a special-purpose stored-program digital computer. A program for this machine represents the syntax and semantics of some language the source language. The translator is program-driven, backtracking and performs the parsing of the source text in a top-down manner. It does not allow left-recursive grammars. The program is written in ALGOL W on the IBM 360/44 computer. The translator accepts language specifications (syntax and semantics) in extended BNF - a meta language described in the thesis - and eventually produces a recogniser for statements in the source language. The translator is composed of two machines - a parsing machine and an editor machine. The parsing machine has 17 machine instructions, some these instructions are of single address type while others have no operand. Details of these are described. Briefly they are used by the parser machine to make decisions about whether or not a source text is grammatical. The output produced by the parser machine is determined by the semantics embodied in the program. This output is then carried to the editor machine and is treated as its input. The input to the editor machine is an ordered sequence of symbols which contains some edit instructions. With the help of these edit codes, this input is interpreted on the editor machine. The editor machine has 6 machine instructions which normally operate on the top one or two elements of the editor stack. The output produced by the editor machine is then assembled. The program thus obtained can be run on the hypothetic, computer as a compiler. A summary of related work is given. | en |
dc.language.iso | en | en |
dc.publisher | University of St Andrews | en |
dc.subject.lcc | QA76.1V2 | |
dc.subject.lcsh | Programming languages (Electronic computers)—Syntax | en |
dc.title | An implementation of Reeve's syntax directed translator | en |
dc.type | Thesis | en |
dc.type.qualificationlevel | Doctoral | en |
dc.type.qualificationname | MSc Master of Science | en |
dc.publisher.institution | The University of St Andrews | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.