Boley, Harold
[Author];
Elsbernd, Klaus
[Author];
Hein, Hans-Günther
[Author];
Krause, Thomas
[Author];
Perling, Markus
[Author];
Sintek, Michael
[Author];
Stein, Werner
[Author]
RFM manual : compiling RELFUN into the relational/functional machine
You can manage bookmarks using lists, please log in to your user account for this.
Media type:
Report;
E-Book
Title:
RFM manual : compiling RELFUN into the relational/functional machine
Contributor:
Boley, Harold
[Author];
Elsbernd, Klaus
[Author];
Hein, Hans-Günther
[Author];
Krause, Thomas
[Author];
Perling, Markus
[Author];
Sintek, Michael
[Author];
Stein, Werner
[Author]
Published:
Scientific publications of the Saarland University (UdS), 1996
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
The compilation of RELFUN programs consists of two main stages, horizontal transformations and vertical translations. The horizontal transformer performs both source-to-source steps into a subset of RELFUN and source-to-intermediate steps into a RELFUN-like language. The vertical translator is also divided into two phases, the classifier and the code generator. The classifier produces a declarative clause language; the code generator optimizes target code for underlying WAM emulators. These parts can be used incrementally-individually, as a relational/functional compilation laboratory, or batch-composed, as a complete RELFUN compiler. All intermediate steps employ explicit declarative representations, which can be displayed via RELFUN´s user interface. The compiler is implemented in a subset of COMMON LISP; one emulator runs in COMMON LISP, the other in ANSI C.