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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
|
;; Copyright (C) 1997, 1998, 1999 Free Software Foundation, Inc.
;;
;; This program is free software; you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation; either version 2, or (at your option)
;; any later version.
;;
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
;; GNU General Public License for more details.
;;
;; You should have received a copy of the GNU General Public License
;; along with this software; see the file COPYING. If not, write to
;; the Free Software Foundation, 59 Temple Place, Suite 330, Boston, MA 02111, USA.
;;
;; As a special exception, the Free Software Foundation gives permission
;; for additional uses of the text contained in its release of GUILE.
;;
;; The exception is that, if you link the GUILE library with other files
;; to produce an executable, this does not by itself cause the
;; resulting executable to be covered by the GNU General Public License.
;; Your use of that executable is in no way restricted on account of
;; linking the GUILE library code into it.
;;
;; This exception does not however invalidate any other reasons why
;; the executable file might be covered by the GNU General Public License.
;;
;; This exception applies only to the code released by the
;; Free Software Foundation under the name GUILE. If you copy
;; code from other Free Software Foundation releases into a copy of
;; GUILE, as the General Public License permits, the exception does
;; not apply to the code that you add in this way. To avoid misleading
;; anyone as to the status of such modified files, you must delete
;; this exception notice from them.
;;
;; If you write modifications of your own for GUILE, it is your choice
;; whether to permit this exception to apply to your modifications.
;; If you do not wish that, delete this exception notice.
;;;; "Macro.scm", Support for syntax-rules macros.
;;; Author: Radey Shouman
;;
;; As in SYNTAX-CASE, the identifier ... may be quoted in a
;; SYNTAX-RULES pattern or template as (... ...).
;;
;; THE-MACRO may be used to define macros, eg
;; (define-syntax foo (the-macro and))
;; defines the syntactic keyword FOO to have the same transformer
;; as the macro AND.
(require 'rev2-procedures) ;append!
(require 'record)
(define macro:compile-syntax-rules
;; We keep local copies of these standard special forms, otherwise,
;; redefining them before they are memoized below can lead to
;; infinite recursion.
(@let-syntax ((lambda (the-macro lambda))
(let (the-macro let))
(cond (the-macro cond))
(if (the-macro if))
(and (the-macro and))
(or (the-macro or)))
(let ((var-rtd (make-record-type '? '(name rank)))
(e-pat-rtd (make-record-type '... '(pattern vars)))
(rule-rtd (make-record-type 'rule '(pattern inserted template))))
(define pattern-variable (record-constructor var-rtd '(name rank)))
(define pattern-variable? (record-predicate var-rtd))
(define pattern-variable->name
(let ((acc (record-accessor var-rtd 'name)))
(lambda (x) (identifier->symbol (acc x)))))
(define pattern-variable->rank (record-accessor var-rtd 'rank))
;; An ellipsis-pattern is used both for ellipses in patterns and
;; ellipses in templates. In a pattern, VARS is the list of variables
;; bound by the ellipsis pattern. In a template, VARS is the list of
;; variables opened by the ellipsis template.
(define ellipsis-pattern (record-constructor e-pat-rtd '(pattern vars)))
(define ellipsis-pattern? (record-predicate e-pat-rtd))
(define ellipsis-pattern->pattern (record-accessor e-pat-rtd 'pattern))
(define ellipsis-pattern->vars (record-accessor e-pat-rtd 'vars))
(define rule (record-constructor rule-rtd '(pattern inserted template)))
(define rule->pattern (record-accessor rule-rtd 'pattern))
(define rule->inserted (record-accessor rule-rtd 'inserted))
(define rule->template (record-accessor rule-rtd 'template))
(define (append2 x y)
(if (null? y) x
(append x y)))
(define ellipsis?
(let (($... (renamed-identifier '... #f)))
(lambda (x env)
(and
(identifier? x)
(identifier-equal? x $... env)))))
;; Yeah, it's quadratically slow.
(define (duplicates? vars)
(if (null? vars)
#f
(if (memq (car vars) (cdr vars))
(car vars)
(duplicates? (cdr vars)))))
(define (compile-pattern literals rule-exp env-def)
(let recur ((pat (cdar rule-exp))
(vars '())
(rank 0)
(k (lambda (compiled vars)
(let ((dup (duplicates? (map car vars))))
(if dup
(error
"syntax-rules: duplicate pattern variable:"
dup " in rule " rule-exp)))
(apply rule
compiled
(rewrite-template
(cadr rule-exp) vars env-def)))))
(cond ((null? pat)
(k pat vars))
((identifier? pat)
(let ((lit (memq pat literals)))
(if lit
(k (renamed-identifier pat env-def) vars)
(let ((var (pattern-variable pat rank)))
(k var (cons (cons pat var) vars))))))
((pair? pat)
(if (and (pair? (cdr pat))
(ellipsis? (cadr pat) env-def)
(or (null? (cddr pat))
(error "bad ellipsis:" pat)))
(if (ellipsis? (car pat) env-def)
(recur (car pat) vars rank k)
(recur (car pat) '() (+ rank 1)
(lambda (comp1 vars1)
(k (list
(ellipsis-pattern comp1 (map cdr vars1)))
(append2 vars1 vars)))))
(recur (car pat) '() rank
(lambda (comp1 vars1)
(recur (cdr pat) vars rank
(lambda (comp2 vars2)
(k (cons comp1 comp2)
(append2 vars1 vars2))))))))
((vector? pat)
(recur (vector->list pat) vars rank
(lambda (comp vars)
(k (list->vector comp) vars))))
(else
(k pat vars)))))
(define (rewrite-template template vars env-def)
(let recur ((tmpl template)
(rank 0)
(inserted '())
(k (lambda (compiled inserted opened)
(list inserted compiled))))
(cond ((null? tmpl)
(k tmpl '() '()))
((identifier? tmpl)
(let ((v (assq tmpl vars)))
(if v
(cond ((= rank (pattern-variable->rank (cdr v)))
(k (cdr v) '() (list (cdr v))))
((> rank (pattern-variable->rank (cdr v)))
(k (cdr v) '() '()))
(else
(error "pattern variable rank mismatch:" tmpl
" in " template)))
(k tmpl (list tmpl) '()))))
((pair? tmpl)
(if (and (pair? (cdr tmpl))
(ellipsis? (cadr tmpl) env-def))
(if (and (ellipsis? (car tmpl) env-def)
(or (null? (cddr tmpl))
(error "bad ellipsis:" tmpl)))
;; (... ...) escape
(k (car tmpl) (list (car tmpl)) '())
(recur (car tmpl) (+ rank 1) '()
(lambda (comp1 ins1 op1)
(if (null? op1)
(error "Bad ellipsis:"
tmpl " in template " template))
(recur (cddr tmpl) rank inserted
(lambda (comp2 ins2 op2)
(k (cons
(ellipsis-pattern comp1 op1)
comp2)
(append2 ins1 ins2)
(append2 op1 op2)))))))
(recur (car tmpl) rank '()
(lambda (comp1 ins1 op1)
(recur (cdr tmpl) rank inserted
(lambda (comp2 ins2 op2)
(k (cons comp1 comp2)
(append2 ins1 ins2)
(append2 op1 op2))))))))
((vector? tmpl)
(recur (vector->list tmpl) rank inserted
(lambda (compiled inserted opened)
(k (list->vector compiled) inserted opened))))
(else
(k tmpl '() '())))))
;;; Match EXP to RULE, returning alist of variable bindings or #f.
(define (match rule exp env-use)
(let recur ((r (rule->pattern rule))
(x (cdr exp)))
(cond ((null? r)
(and (null? x) '()))
((pair? r)
(if (ellipsis-pattern? (car r))
(and
(list? x)
(let ((pat (ellipsis-pattern->pattern (car r))))
(let match1 ((x x)
(vals '()))
(if (null? x)
(if (null? vals)
(map list (ellipsis-pattern->vars (car r)))
(let ((vars (map car (car vals))))
(apply map list vars
(map (lambda (al)
(map cdr al))
(reverse vals)))))
(let ((val (recur pat (car x))))
(and val
(match1 (cdr x) (cons val vals))))))))
(and
(pair? x)
(let ((v1 (recur (car r) (car x))))
(and v1
(let ((v2 (recur (cdr r) (cdr x))))
(and v2 (append2 v1 v2))))))))
((identifier? r) ;literal
(and (identifier? x) (identifier-equal? r x env-use) '()))
((pattern-variable? r)
(list (cons r x)))
((vector? r)
(and (vector? x)
(recur (vector->list r) (vector->list x))))
(else
(and (equal? r x) '())))))
(define (substitute-in-template rule vars env-def)
(let ((ins (map (lambda (id)
(cons id (renamed-identifier id env-def)))
(rule->inserted rule))))
(let recur ((tmpl (rule->template rule))
(vars vars))
(cond ((null? tmpl)
tmpl)
((pair? tmpl)
(if (ellipsis-pattern? (car tmpl))
(let* ((enames (ellipsis-pattern->vars (car tmpl)))
(etmpl (ellipsis-pattern->pattern (car tmpl)))
(evals (map (lambda (nam)
(cdr (assq nam vars)))
enames))
(n (length (car evals))))
(let check ((es (cdr evals)))
(if (pair? es)
(if (= n (length (car es)))
(check (cdr es))
(error "syntax-rules: pattern variable length mismatch:"))))
(append!
(map (lambda (eval)
(recur etmpl
(append!
(map cons enames eval)
vars)))
(apply map list evals))
(recur (cdr tmpl) vars)))
(cons (recur (car tmpl) vars)
(recur (cdr tmpl) vars))))
((identifier? tmpl)
(let ((a (assq tmpl ins)))
(if a (cdr a) tmpl)))
((pattern-variable? tmpl)
(@copy-tree (cdr (assq tmpl vars))))
((vector? tmpl)
(list->vector (recur (vector->list tmpl) vars)))
(else
tmpl)))))
;; MACRO:COMPILE-SYNTAX-RULES
(lambda (x-def env-def)
(or (and (list? x-def)
(< 2 (length x-def))
(list? (cadr x-def)))
(error "Malformed syntax-rules:" x-def))
(let ((literals (cadr x-def)))
(for-each (lambda (x)
(or (identifier? x)
(error "Bad literals list:" x-def)))
literals)
(let ((rules (map (lambda (rule-expr)
(or (and (list? rule-expr)
(= 2 (length rule-expr))
(pair? (car rule-expr)))
(error "Bad rule:" rule-expr))
(compile-pattern literals rule-expr env-def))
(cddr x-def))))
(lambda (x-use env-use)
(let loop ((rules rules))
(cond ((null? rules)
(error "macro use does not match definition:"
x-use))
((match (car rules) x-use env-use)
=> (lambda (vars)
(substitute-in-template (car rules) vars env-def)))
(else
(loop (cdr rules))))))))))))
(define syntax-rules
(procedure->syntax
(lambda (expr env-def)
(procedure->memoizing-macro
(macro:compile-syntax-rules expr env-def)))))
;; Explicit renaming macro facility, as in
;; W. Clinger, "Hygienic Macros Through Explicit Renaming"
(define (macro:renaming-transformer-procedure proc env-def)
(procedure->memoizing-macro
(lambda (expr env-use)
(proc (@copy-tree expr)
(let ((al '()))
(lambda (id)
(cond ((not (identifier? id))
(error id "non-identifier passed to rename procedure"
expr))
((assq id al) => cdr)
(else
(let ((r-id (renamed-identifier id env-def)))
(set! al (cons id r-id))
r-id)))))
(lambda (id1 id2)
(or (and (identifier? id1)
(identifier? id2)
(error (if (identifier? id1) id2 id1)
"non-identifier passed to compare procedure"
expr)))
(identifier-equal? id1 id2 env-use))))))
(define renaming-transformer
(let ((?transformer
(renamed-identifier 'macro:renaming-transformer-procedure #f))
(?syntax-quote (renamed-identifier 'syntax-quote #f)))
(procedure->memoizing-macro
(lambda (exp env-def)
`(,?transformer ,(cadr exp) (,?syntax-quote ,env-def))))))
(define define-syntax
(syntax-rules ()
((define-syntax ?name ?val)
(define ?name (the-macro ?val)))))
(define-syntax let-syntax
(syntax-rules () ((let-syntax ((?name ?val) ...) . ?body)
(@let-syntax
((?name (the-macro ?val)) ...) . ?body))))
(define-syntax letrec-syntax
(syntax-rules () ((letrec-syntax ((?name ?val) ...) . ?body)
(@letrec-syntax
((?name (the-macro ?val)) ...) . ?body))))
;; MACRO:EXPAND would require substantial work.
(define macro:load load)
(define macro:eval eval)
(provide 'macro)
|