CS Theses & Dissertations 1981

For 1981 graduation dates (in alphabetical order by last name):

An Approach to the Organization of taxonomies
Bishop, Craig David
URI : http://hdl.handle.net/2429/22854
Degree : Master of Science – MSc
Graduation Date : 1981-05

Dynamic Problems in Comutational Geometry
Gowda, Ihor George
URI : http://hdl.handle.net/2429/22442
Degree : Master of Science – MSc
Graduation Date : 1981-05

Improving Performance by Strategy-Independent Program Restructuring Using Bounded Locality Intervals
Law, Bernard Ming-Ki
URI : http://hdl.handle.net/2429/22581
Degree : Master of Science – MSc
Graduation Date : 1981-11

PASCAL-F:  A portable FORTRAN-based PASCAL compiler
Manning, Joseph
URI : http://hdl.handle.net/2429/22571
Degree : Master of Science – MSc
Graduation Date :1981-11

A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
Seidel, Raimund
URI : http://hdl.handle.net/2429/22652
Degree : Master of Science – MSc
Graduation Date : 1981-11

Interactive Polygon filling on a Raster Graphic Display
Stoch, Stephen Leonard
URI : http://hdl.handle.net/2429/22650
Degree : Master of Science – MSc
Graduation Date : 1981-05
Supervisor : Dr. Woodham

Covering Relaxation Methods for Solving the Zero- One Positive Polynomial Programming Problem
Vaessen, Willem
URI : http://hdl.handle.net/2429/22700
Degree : Master of Science – MSc
Graduation Date : 1981-05

The translation of Programming Languages through the use of a graph transformation language
Van Den Bosch, Peter Nico
URI : http://hdl.handle.net/2429/22862
Degree : Doctor of Philosophy – PhD
Graduation Date : 1981-05

It is shown that the automated translation of programming languages suffers from its traditional domination by context free parsing techniques, specifically in failing to deal uniformly with such translation-related concerns as language extension, optimization, error handling and reporting, and multi-stage translation, as well as in generally ad hoc treatment of the context sensitive aspects of translation, particularly those concerned with the identification of symbols. A descriptive technique for discussing translation that takes into account not only the immense and continued success of the syntactic basis for programming language translation but also the need to deal uniformly with the above concerns is presented, and demonstrated to be implementable as a programming tool. This demonstration is effected both by means of a detailed discussion of the technique's application to the expression of translation algorithms, and by a consideration of the practical aspects of its implementation as a programming language. The technique involves a representation of the complete syntactic structure of programs as a directed graph, and the expression of translations as local transformations of the graph representation. A wide range of translation concerns is discussed with reference to graph transformation. Practical experience with an experimental version of a graph transformation language is presented, and used as the basis for a further development in the design. An evaluation of the completed research, and an assessment of its position within concurrent developments in the discipline of programming language translation, conclude this dissertation.

Find us on Twitter

a place of mind, The University of British Columbia


ICICS/CS Building 201-2366 Main Mall
Vancouver, B.C. V6T 1Z4 Canada
Tel: 604-822-3061 | Fax: 604-822-5485
General: help@cs.ubc.ca
Undergrad program: undergrad-info@cs.ubc.ca
Graduate program: grad-info@cs.ubc.ca

Emergency Procedures | Accessibility | Contact UBC | © Copyright The University of British Columbia