blob: c88123e31d039534592ff59050d6d7c35bf87cc3 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
(define-library (csc ir1)
(export
%call
%call-builtin
%constant
%define-syntax
%if
%lambda
%letrec
%lexical-ref
%lexical-set
%library-define
%library-ref
%sequence
call-arguments
call-builtin-arguments
call-builtin-operation
call-builtin?
call-procedure
call?
constant-expression
constant?
define-syntax-name
define-syntax-transformer
define-syntax?
if-alternate
if-consequent
if-test
if?
lambda-arguments
lambda-body
lambda?
letrec-expression
letrec-gensyms
letrec-in-order?
letrec-names
letrec-values
letrec?
lexical-ref-gensym
lexical-ref-name
lexical-ref?
lexical-set-expression
lexical-set-ref
lexical-set?
library-define-expression
library-define-ref
library-define?
library-ref-library
library-ref-name
library-ref?
make-call
make-call-builtin
make-constant
make-define-syntax
make-if
make-lambda
make-letrec
make-lexical-ref
make-lexical-set
make-library-define
make-library-ref
make-sequence
sequence-head
sequence-tail
sequence?)
(import (scheme base)
(only (csc list)
all)
(only (csc loop) loop return)
(only (csc match)
define-match-record-type))
(begin
; This library defines the intermediate representation IR1. An expression
; in IR1 has one of the following forms (plagiarized from Guile's
; Tree-IL).
; <constant> expression
; Constant is used to include literal constants in scheme code.
(define-match-record-type <constant>
(make-constant expression)
constant?
%constant
(expression constant-expression))
; <lexical-ref> name gensym
; A reference to a lexically-bound variable. The name is the original name
; of the variable in the source program. gensym is a unique identifier for
; this variable.
(define-match-record-type <lexical-ref>
(make-lexical-ref name gensym)
lexical-ref?
%lexical-ref
(name lexical-ref-name)
(gensym lexical-ref-gensym))
; <library-ref> name
; A free reference to a variable in a library. If the library is 'main,
; then it is a top-level global variable.
(define-match-record-type <library-ref>
(make-library-ref name library)
library-ref?
%library-ref
(name library-ref-name)
(library library-ref-library))
; <lexical-set> name gensym expression
; Sets a lexically-bound variable.
(define-match-record-type <lexical-set>
(make-lexical-set ref expression)
lexical-set?
%lexical-set
(ref lexical-set-ref)
(expression lexical-set-expression))
; <library-define> name expression
; Defines a new variable in the current library.
(define-match-record-type <library-define>
(make-library-define ref expression)
library-define?
%library-define
(ref library-define-ref)
(expression library-define-expression))
; <define-syntax> name transformer
; Defines a new macro in the current environment. name is the name of the
; macro. transformer is a macro transformer.
(define-match-record-type <define-syntax>
(make-define-syntax name transformer)
define-syntax?
%define-syntax
(name define-syntax-name)
(transformer define-syntax-transformer))
; <if> test consequent alternate
; A conditional.
(define-match-record-type <if>
(make-if test consequent alternate)
if?
%if
(test if-test)
(consequent if-consequent)
(alternate if-alternate))
; <call> procedure arguments
; A procedure call. The procedure and arguments are evaluated in an
; unspecified order, and the resulting procedure is passed the
; resulting arguments.
(define-match-record-type <call>
(make-call procedure arguments)
call?
%call
(procedure call-procedure)
(arguments call-arguments))
; <call-builtin> operation arguments
; Executes the given builtin operation on the arguments. The known builtin
; operations are listed below. Each operation can return a value, or not.
; - alloc: size -> result
; - peek: pointer * offset -> result
; - poke: word * pointer * offset -> ()
; - lt: int * int -> bool
; - eq: obj * obj -> bool
; - call-with-current-continuation: proc -> result
; - call-with-values: producer * consumer -> result
; - apply: proc * args -> result
(define-match-record-type <call-builtin>
(make-call-builtin operation arguments)
call-builtin?
%call-builtin
(operation call-builtin-operation)
(arguments call-builtin-arguments))
; <sequence> head tail
; Evaluate head, ignoring any result. Then tail is evaluated.
(define-match-record-type <sequence>
(make-sequence head tail)
sequence?
%sequence
(head sequence-head)
(tail sequence-tail))
; <lambda> body
; A closure. Arguments is a lexical-ref.
(define-match-record-type <lambda>
(make-lambda arguments body)
lambda?
%lambda
(arguments lambda-arguments)
(body lambda-body))
; <letrec> in-order? names gensyms values expression
; Lexical binding, like Scheme's letrec, or letrec* if in-order? is true.
; names are the original binding names, gensyms are gensyms corresponding
; to the names, and values are IR1 expressions for the values. expression
; is a single IR1 expression.
(define-match-record-type <letrec>
(make-letrec in-order? names gensyms values expression)
letrec?
%letrec
(in-order? letrec-in-order?)
(names letrec-names)
(gensyms letrec-gensyms)
(values letrec-values)
(expression letrec-expression))))
|
