Next:
1 Introduction
Up:
RFM Manual: Compiling RELFUN
Previous:
RFM Manual: Compiling RELFUN
Contents
1 Introduction
2 The user interface
2.1 The user interface for layered compilation
2.2 The user interface and the
GWAM
3 The transformers
3.1 The
extron
transformers
3.1.1
undeclare
Transforming
sg
definitions
Evaluating
declare
facts
3.1.2
untype
3.1.3
unmacro
3.1.4
unor
3.1.5
unlambda
3.1.6
hitrans
3.1.7
uncomma
3.2 The
bastron
transformers
3.2.1 Untupling
3.2.2 Flattening
3.2.3 Flattering
3.2.4 Tuple- and cons-passivating
3.2.5 Deanonymization
3.2.6 Normalizing
3.2.7 Footening
4 The classifier
4.1 Procedure level
4.2 Indexing
4.3 Clause level
4.4 Chunk level
4.5 Literal level and argument level
4.6 An example with structures
4.7 EBNF syntax for Classified clauses
5 The code generator
5.1 Software interface
5.2 classified_procedure
5.3 indexing
5.4 clause_classification
5.5 head_chunk_fact, head_chunk_rule, body_chunk
5.6 chunk_descr
5.7 literal_classification
5.8 variable_classification, local_var_descr
5.9 Global variables
5.10 perm_var_list, temp_var_list
5.11 perm_descr, temp_descr
5.12 literal_descr
5.13 lispcall_type, lispcall_classification
5.14 arglist_classification, term_classification, constant_classification
5.15 Getting global information on variables
5.16 Obtaining the procedure arity
5.17 The builtins, is_primitive
5.18 Y-variable scoreboarding
6 The
GAMA
6.1 Memory organization
6.2 Hash tables, jump tables, and the module system
6.3 Defining assembler instructions
6.4 The assembler and loader
7 The
GWAM
7.1 Terminology
7.2 The data structures
7.2.1 The local stack
7.2.2 The heap
7.2.3 The trail
7.3 The registers
7.4 The instructions
7.4.1 PUT-instructions
7.4.2 GET-instructions
7.4.3 UNIFY-instructions
7.4.4 Indexing instructions
7.4.5 Procedural instructions
7.4.6 Special instructions
7.4.7 Special builtins - cuts and metacall
7.4.8 LISP interface
7.5 User interface of the
GWAM
7.5.1 The debugger control commands
7.5.2 The debugger display commands
8 A sample session
References
About this document ...
Harold Boley
(
boley@informatik.uni-kl.de
)