THE MAPPING OF THE REFAL MACHINE ONTO A VON NEUMANN MACHINE.
Item
-
Title
-
THE MAPPING OF THE REFAL MACHINE ONTO A VON NEUMANN MACHINE.
-
Identifier
-
AAI8401950
-
identifier
-
8401950
-
Creator
-
NIRENBERG, ROBERT MICHAEL.
-
Contributor
-
V a le n tin F . Turchin | Michael Anshel
-
Date
-
1983
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Computer Science
-
Abstract
-
A supercompiler system based on the language Refal has been implemented at the City University of New York's University Computer Center. The supercompiler takes as its input a program in Refal, and produces an optimized program as its result. The output is in a representation called a graph of states of the abstract Refal machine. In order to implement a supercompiler system on a real computer, therefore, it is necessary to map the resulting graph of states onto an implemented programming language. To that end, a mapping scheme has been devised, which allows for further optimizations to the program represented by the graph of states. An intermediate language, called LISA, has been developed, in order to facilitate manipulations of data types and structures in the abstract program, before code generation takes place. A code generation scheme, based on a method of template-matching has been implemented. Also, the background environment necessary to execute a mapped program in Pascal has been implemented, so that a complete package now exists for mapping graphs of states onto a sequential programming language. The code generation scheme is retargettable, and optimizations to the mapped graph of states have been identified, and some implemented.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
-
Program
-
Engineering
