The programming language ALGOL 68 offers great flexibility in the use of modes and operators. The convenience for the programmer results in problems for the implementor in coercion, balancing, and identification of operators. This thesis presents a solution to these problems that is being successfully used in an ALGOL 68 compiler. / Science, Faculty of / Computer Science, Department of / Graduate

The special feature that modes and operators can be defined by the user of ALGOL 68 has induced the problems of coercion, balancing and operator identification. This work deals with the mode manipulation and operator identification in ALGOL 68. The algorithms are based on those of [Z]. Some of the revisions to the ALGOL 68 Report concerning modes, such as no proceduring, the void symbol, the definition of NONPROC, the definition of a vacuum, and the hipping of a vacuum are included. The program in ALGOL W is based on that of [P]. The program described in this thesis does four main jobs: mode eguivalencing, mode coercion, mode balancing and operator identification. In mode eguivalencing, it checks the context conditions concerning "showing" [R.4.4.4] and the multiple occurrence of the same field selector in a structure [R.4.4.3e], and checks related modes in unions [ B.4.4.3b,d]. In mode coercion, it determines the coercion steps. This is also a basic part of mode balancing and operator identification. In balancing, it also considers collateral displays. This is a model for the operator identification part of an ALGOL 68 compiler. I am deeply indebted to Professor J. E. L. Peck for initiating my study of ALGOL 68 and ALGOL W, for suggesting the topic of this thesis and for rendering invaluable assistance, encouragement and patience throughout the course of my work. I would like to thank the group which is working under Dr. Peck for the ALGOL 68 implementation, Dr. W. J. Hansen and especially Dr. M. Zosel for many helpful suggestions and discussions. I gratefully acknowledge the financial support of NRC. / Science, Faculty of / Computer Science, Department of / Graduate

The purpose of this thesis is to report on the study, implementation arad use of the LR (k) parsing technique with error recovery as applied to the computer programming language ALGOL 68. The LR (k) parsing technique is a powerful method of automatic construction of parsers for context free grammars. The methodology provided by De Remer is implemented for all classes of LR (k) grammars. The practical implementation of the translator limits k to 15. The necessity of having error recovery for any parsing technique cannot be overstated. An error recovery technique is provided and demonstrated for ALGOL 68. This technique uses the parsing translator to aid in the decision process to determine the transformation from a string of symbols not in the language, to a string of symbols in the language. The LR (k) parsing technique and the error recovery technique are applied to ALGOL 68 and prove to be practical techniques in the construction of compilers for computer programming languages. / Science, Faculty of / Computer Science, Department of / Graduate

No description available.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1963. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 58-60).

Based on the author's Thesis (Ph. D.)--Queen's University (Kingston, Ontario), 2002. / Includes bibliographical references (p. 161-69). Available on-line.

No description available.

The idea of obtaining a best approximation in some sense of a function gained considerable importance with the introduction of electronic computers. The Remez algorithm, which is known as the exchange method, is used in this paper to find the best approximating polynomial of a given degree for a real continuous function f(x) on a real finite interval (a,b). The comparison of such an algorithm written in the FORTRAN and the PL/I languages is the main purpose of this paper. A review of the approximation theory is made as well as a discussion of the steps in the programming process. The outstanding features used in the programs of the languages are pointed out and illustrated with examples taken from the programs. The accuracy of the results, the speed, and the storage requirements are analyzed. Also ideas of program organization are discussed.Ball State UniversityMuncie, IN 47306