Add loadable modules.
* module/mes/base-0.mes (mes-use-module): Implement. * module/mes: Update users. * HACKING: Update. * NEWS: Update. * configure (main): Use shell expansion for prefix. * make/install.make (install): Substitute prefix.
This commit is contained in:
Jan Nieuwenhuizen
parent
b74d048b95
commit
2b577eaee0
2
.gitignore
vendored
2
.gitignore
vendored
|
|
@ -13,7 +13,7 @@
|
||||||
/ChangeLog
|
/ChangeLog
|
||||||
/a.out
|
/a.out
|
||||||
/mes
|
/mes
|
||||||
/read-0.mo
|
/module/mes/read-0.mo
|
||||||
/out
|
/out
|
||||||
?
|
?
|
||||||
?.mes
|
?.mes
|
||||||
|
|
|
||||||
8
AUTHORS
8
AUTHORS
|
|
@ -4,8 +4,8 @@ All files except the files listed below
|
||||||
|
|
||||||
Based on Scheme48's scheme/alt
|
Based on Scheme48's scheme/alt
|
||||||
module/mes/record.mes
|
module/mes/record.mes
|
||||||
module/srfi/srfi-9.mes
|
module/mes/syntax.upstream.mes
|
||||||
module/mes/syntax.mes
|
module/srfi/srfi-9.upstream.mes
|
||||||
|
|
||||||
Based on Guile ECMAScript
|
Based on Guile ECMAScript
|
||||||
module/language/c/lexer.mes
|
module/language/c/lexer.mes
|
||||||
|
|
@ -14,10 +14,10 @@ Included verbatim from gnulib
|
||||||
build-aux/gitlog-to-changelog
|
build-aux/gitlog-to-changelog
|
||||||
|
|
||||||
Portable hygienic pattern matcher
|
Portable hygienic pattern matcher
|
||||||
module/mes/match.mes
|
module/mes/match.upstream.mes
|
||||||
|
|
||||||
Portable LALR(1) parser generator
|
Portable LALR(1) parser generator
|
||||||
module/mes/lalr.mes
|
module/mes/lalr.upstream.mes
|
||||||
|
|
||||||
Portable syntax-case from Chez Scheme
|
Portable syntax-case from Chez Scheme
|
||||||
module/mes/psyntax.ss
|
module/mes/psyntax.ss
|
||||||
|
|
|
||||||
26
GNUmakefile
26
GNUmakefile
|
|
@ -10,18 +10,21 @@ CFLAGS:=-std=c99 -O3 -finline-functions
|
||||||
#CFLAGS:=-pg -std=c99 -O0
|
#CFLAGS:=-pg -std=c99 -O0
|
||||||
#CFLAGS:=-std=c99 -O0 -g
|
#CFLAGS:=-std=c99 -O0 -g
|
||||||
|
|
||||||
export BOOT
|
|
||||||
ifneq ($(BOOT),)
|
|
||||||
CFLAGS+=-DBOOT=1
|
|
||||||
endif
|
|
||||||
|
|
||||||
include .config.make
|
include .config.make
|
||||||
-include .local.make
|
|
||||||
include make/install.make
|
include make/install.make
|
||||||
|
|
||||||
|
CPPFLAGS+=-DPREFIX='"$(PREFIX)"'
|
||||||
|
|
||||||
all: mes
|
export BOOT
|
||||||
|
ifneq ($(BOOT),)
|
||||||
|
CPPFLAGS+=-DBOOT=1
|
||||||
|
endif
|
||||||
|
|
||||||
|
-include .local.make
|
||||||
|
|
||||||
|
all: mes module/mes/read-0.mo
|
||||||
|
|
||||||
|
mes.o: GNUmakefile
|
||||||
mes.o: mes.c
|
mes.o: mes.c
|
||||||
mes.o: mes.c mes.h mes.i mes.environment.i mes.symbols.i
|
mes.o: mes.c mes.h mes.i mes.environment.i mes.symbols.i
|
||||||
mes.o: define.c define.h define.i define.environment.i
|
mes.o: define.c define.h define.i define.environment.i
|
||||||
|
|
@ -72,16 +75,15 @@ export MES_DEBUG
|
||||||
mes-check: all
|
mes-check: all
|
||||||
set -e; for i in $(TESTS); do ./$$i; done
|
set -e; for i in $(TESTS); do ./$$i; done
|
||||||
|
|
||||||
dump: all
|
module/mes/read-0.mo: module/mes/read-0.mes mes
|
||||||
./mes --dump < module/mes/read-0.mes > read-0.mo
|
./mes --dump < $< > $@
|
||||||
|
|
||||||
|
dump: module/mes/read-0.mo
|
||||||
|
|
||||||
guile-check:
|
guile-check:
|
||||||
set -e; for i in $(TESTS); do\
|
set -e; for i in $(TESTS); do\
|
||||||
guile -s <(cat $(MES-0) module/mes/test.mes $$i);\
|
guile -s <(cat $(MES-0) module/mes/test.mes $$i);\
|
||||||
done
|
done
|
||||||
set -e; for i in $(TESTS); do\
|
|
||||||
guile -s <(cat $(MES-0) $$(scripts/include.mes $$i | grep -Ev 'let.mes|quasiquote.mes|match.mes|base-0|loop-0|psyntax-|srfi-0') $$i);\
|
|
||||||
done
|
|
||||||
|
|
||||||
MAIN_C:=doc/examples/main.c
|
MAIN_C:=doc/examples/main.c
|
||||||
mescc: all
|
mescc: all
|
||||||
|
|
|
||||||
7
HACKING
7
HACKING
|
|
@ -37,13 +37,6 @@ bootstrap binary.
|
||||||
mes.c is ~1500 lines (~10,000LOC Assembly) which seems much too big to
|
mes.c is ~1500 lines (~10,000LOC Assembly) which seems much too big to
|
||||||
start translating it to assembly/hex.
|
start translating it to assembly/hex.
|
||||||
|
|
||||||
** (mes-use-module ...) is a fake, see module/mes/base.mes.
|
|
||||||
All top level scripts and test files (scripts/*.mes tests/*.test)
|
|
||||||
now include appropriate (mes-use-module ...) stanzas.
|
|
||||||
|
|
||||||
This hack allows for scripts/includes.mes to generate the list of
|
|
||||||
files to be prepended. Previously, this information was put in
|
|
||||||
GNUmakefile.
|
|
||||||
** Actually do something useful, build: [[https://en.wikipedia.org/wiki/Tiny_C_Compiler][Tiny C Compiler]]
|
** Actually do something useful, build: [[https://en.wikipedia.org/wiki/Tiny_C_Compiler][Tiny C Compiler]]
|
||||||
* OLD: Booting from LISP-1.5 into Mes
|
* OLD: Booting from LISP-1.5 into Mes
|
||||||
|
|
||||||
|
|
|
||||||
6
NEWS
6
NEWS
|
|
@ -17,6 +17,12 @@ Please send Mes bug reports to janneke@gnu.org.
|
||||||
A variant on SICP's stop and copy Garbage Colletor (Jam Scraper?)
|
A variant on SICP's stop and copy Garbage Colletor (Jam Scraper?)
|
||||||
algorithm has been implemented.
|
algorithm has been implemented.
|
||||||
*** The reader has been moved to Scheme.
|
*** The reader has been moved to Scheme.
|
||||||
|
** Language
|
||||||
|
*** Simple loadable modules.
|
||||||
|
*** Srfi-9 and match use handwritten syntax-rules (mes-use-module (mes syntax)).
|
||||||
|
*** Optional syntax-case using psyntax (mes-use-module (mes psyntax)).
|
||||||
|
** Noteworthy bug fixes
|
||||||
|
*** Srfi-0 has been fixed.
|
||||||
* Changes in 0.2 since 0.1
|
* Changes in 0.2 since 0.1
|
||||||
** Core
|
** Core
|
||||||
*** Names of symbols and strings are list of characters [WAS: c-string].
|
*** Names of symbols and strings are list of characters [WAS: c-string].
|
||||||
|
|
|
||||||
2
configure
vendored
2
configure
vendored
|
|
@ -199,7 +199,7 @@ Usage: ./configure [OPTION]...
|
||||||
(stdout "GUILE_EV:=~a\n" GUILE_EV)
|
(stdout "GUILE_EV:=~a\n" GUILE_EV)
|
||||||
(stdout "PACKAGE:=~a\n" PACKAGE)
|
(stdout "PACKAGE:=~a\n" PACKAGE)
|
||||||
(stdout "VERSION:=~a\n" VERSION)
|
(stdout "VERSION:=~a\n" VERSION)
|
||||||
(stdout "PREFIX:=~a\n" prefix)
|
(stdout "PREFIX:=~a\n" (gulp-pipe (string-append "echo " prefix)))
|
||||||
(stdout "SYSCONFDIR:=~a\n" sysconfdir)))
|
(stdout "SYSCONFDIR:=~a\n" sysconfdir)))
|
||||||
(stdout "\nRun:
|
(stdout "\nRun:
|
||||||
make to build mes
|
make to build mes
|
||||||
|
|
|
||||||
|
|
@ -53,6 +53,13 @@ install: all ChangeLog
|
||||||
mkdir -p $(DESTDIR)$(PREFIX)/share/mes
|
mkdir -p $(DESTDIR)$(PREFIX)/share/mes
|
||||||
$(GIT_ARCHIVE_HEAD) module\
|
$(GIT_ARCHIVE_HEAD) module\
|
||||||
| tar -C $(DESTDIR)$(PREFIX)/share/mes -xf-
|
| tar -C $(DESTDIR)$(PREFIX)/share/mes -xf-
|
||||||
|
cp module/mes/read-0.mo $(DESTDIR)$(PREFIX)/share/mes/module/mes
|
||||||
|
sed -i -e 's@module/@$(PREFIX)/share/mes/module/@' \
|
||||||
|
$(DESTDIR)$(PREFIX)/share/mes/module/mes/base-0.mes \
|
||||||
|
$(DESTDIR)$(PREFIX)/bin/elf.mes \
|
||||||
|
$(DESTDIR)$(PREFIX)/bin/mescc.mes \
|
||||||
|
$(DESTDIR)$(PREFIX)/bin/repl.mes \
|
||||||
|
$(DESTDIR)$(PREFIX)/bin/paren.mes
|
||||||
mkdir -p $(DESTDIR)$(PREFIX)/share/doc/mes
|
mkdir -p $(DESTDIR)$(PREFIX)/share/doc/mes
|
||||||
$(GIT_ARCHIVE_HEAD) $(READMES) \
|
$(GIT_ARCHIVE_HEAD) $(READMES) \
|
||||||
| tar -C $(DESTDIR)$(PREFIX)/share/doc/mes -xf-
|
| tar -C $(DESTDIR)$(PREFIX)/share/doc/mes -xf-
|
||||||
|
|
|
||||||
12
mes.c
12
mes.c
|
|
@ -522,8 +522,13 @@ vm_begin_env ()
|
||||||
{
|
{
|
||||||
SCM r = cell_unspecified;
|
SCM r = cell_unspecified;
|
||||||
while (r1 != cell_nil) {
|
while (r1 != cell_nil) {
|
||||||
if (TYPE (r1) == PAIR && TYPE (CAR (r1)) == PAIR && caar (r1) == cell_symbol_begin)
|
if (TYPE (r1) == PAIR && TYPE (CAR (r1)) == PAIR)
|
||||||
r1 = append2 (cdar (r1), cdr (r1));
|
{
|
||||||
|
if (caar (r1) == cell_symbol_begin)
|
||||||
|
r1 = append2 (cdar (r1), cdr (r1));
|
||||||
|
else if (caar (r1) == cell_symbol_primitive_load)
|
||||||
|
r1 = append2 (read_input_file_env (r0), cdr (r1));
|
||||||
|
}
|
||||||
r = eval_env (car (r1), r0);
|
r = eval_env (car (r1), r0);
|
||||||
r1 = CDR (r1);
|
r1 = CDR (r1);
|
||||||
}
|
}
|
||||||
|
|
@ -1211,7 +1216,8 @@ load_env (SCM a)
|
||||||
SCM
|
SCM
|
||||||
bload_env (SCM a)
|
bload_env (SCM a)
|
||||||
{
|
{
|
||||||
g_stdin = fopen ("read-0.mo", "r");
|
g_stdin = fopen ("module/mes/read-0.mo", "r");
|
||||||
|
g_stdin = g_stdin ? g_stdin : fopen (PREFIX "module/mes/read-0.mo", "r");
|
||||||
char *p = (char*)g_cells;
|
char *p = (char*)g_cells;
|
||||||
assert (getchar () == 'M');
|
assert (getchar () == 'M');
|
||||||
assert (getchar () == 'E');
|
assert (getchar () == 'E');
|
||||||
|
|
|
||||||
|
|
@ -25,6 +25,13 @@
|
||||||
|
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
|
||||||
|
(mes-use-module (mes elf))
|
||||||
|
(mes-use-module (mes libc-i386))
|
||||||
|
(mes-use-module (mes match))
|
||||||
|
(mes-use-module (srfi srfi-1))
|
||||||
|
(mes-use-module (language c lexer))
|
||||||
|
(mes-use-module (language c parser))
|
||||||
|
|
||||||
(define mescc
|
(define mescc
|
||||||
(let ((errorp
|
(let ((errorp
|
||||||
(lambda args
|
(lambda args
|
||||||
|
|
|
||||||
|
|
@ -1,3 +1,5 @@
|
||||||
|
;;; -*-scheme-*-
|
||||||
|
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright (C) 2009, 2010, 2011 Free Software Foundation, Inc.
|
;;; Copyright (C) 2009, 2010, 2011 Free Software Foundation, Inc.
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
|
|
@ -63,10 +65,7 @@
|
||||||
|
|
||||||
)
|
)
|
||||||
(mes
|
(mes
|
||||||
|
(mes-use-module (mes lalr))))
|
||||||
|
|
||||||
)
|
|
||||||
)
|
|
||||||
|
|
||||||
(define (read-delimited delims port handle-delim)
|
(define (read-delimited delims port handle-delim)
|
||||||
(let ((stop (string->list delims)))
|
(let ((stop (string->list delims)))
|
||||||
|
|
|
||||||
|
|
@ -27,31 +27,12 @@
|
||||||
|
|
||||||
(cond-expand
|
(cond-expand
|
||||||
(guile
|
(guile
|
||||||
(use-modules (srfi srfi-1))
|
;;(use-modules (srfi srfi-1))
|
||||||
;;(use-modules (system base lalr))
|
(use-modules (system base lalr))
|
||||||
(use-modules (ice-9 match)))
|
;;(use-modules (ice-9 match))
|
||||||
|
)
|
||||||
(mes
|
(mes
|
||||||
(mes-use-module (mes base-0))
|
(mes-use-module (mes lalr))))
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (mes scm))
|
|
||||||
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
|
|
||||||
(mes-use-module (mes syntax))
|
|
||||||
|
|
||||||
(mes-use-module (mes record-0))
|
|
||||||
(mes-use-module (mes record))
|
|
||||||
(mes-use-module (srfi srfi-9))
|
|
||||||
(mes-use-module (mes lalr-0))
|
|
||||||
(mes-use-module (mes lalr))
|
|
||||||
(mes-use-module (srfi srfi-1))
|
|
||||||
(mes-use-module (mes match))
|
|
||||||
|
|
||||||
(mes-use-module (rnrs bytevectors))
|
|
||||||
(mes-use-module (mes elf))
|
|
||||||
(mes-use-module (mes libc-i386))))
|
|
||||||
|
|
||||||
(gc)
|
(gc)
|
||||||
(define c-parser
|
(define c-parser
|
||||||
|
|
|
||||||
|
|
@ -4,7 +4,7 @@
|
||||||
;;; Copyright © 2008 Derek Peschel
|
;;; Copyright © 2008 Derek Peschel
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; paren.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -31,22 +31,10 @@
|
||||||
|
|
||||||
(cond-expand
|
(cond-expand
|
||||||
(guile
|
(guile
|
||||||
(use-modules (system base lalr))
|
(use-modules (system base lalr)))
|
||||||
)
|
|
||||||
(mes
|
(mes
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (mes scm))
|
|
||||||
(mes-use-module (mes syntax))
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes record-0))
|
|
||||||
(mes-use-module (mes record))
|
|
||||||
(mes-use-module (srfi srfi-9))
|
(mes-use-module (srfi srfi-9))
|
||||||
(mes-use-module (mes lalr-0))
|
(mes-use-module (mes lalr))))
|
||||||
(mes-use-module (mes lalr))
|
|
||||||
))
|
|
||||||
|
|
||||||
;;; Taken from http://gambitscheme.org/wiki/index.php/Lalr_example
|
;;; Taken from http://gambitscheme.org/wiki/index.php/Lalr_example
|
||||||
;;; LGPL 2.1 / Apache 2.0
|
;;; LGPL 2.1 / Apache 2.0
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; base-0.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -27,6 +27,7 @@
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
|
||||||
#f ;; FIXME -- needed for --dump, then --load
|
#f ;; FIXME -- needed for --dump, then --load
|
||||||
|
|
||||||
(define (primitive-eval e) (eval-env e (current-module)))
|
(define (primitive-eval e) (eval-env e (current-module)))
|
||||||
(define eval eval-env)
|
(define eval eval-env)
|
||||||
(define (expand-macro e) (expand-macro-env e (current-module)))
|
(define (expand-macro e) (expand-macro-env e (current-module)))
|
||||||
|
|
@ -97,9 +98,47 @@
|
||||||
(set! ,stack (cdr ,stack))
|
(set! ,stack (cdr ,stack))
|
||||||
o))
|
o))
|
||||||
(define-macro (load file)
|
(define-macro (load file)
|
||||||
`(primitive-eval
|
`(begin
|
||||||
(begin
|
(push! *input-ports* (current-input-port))
|
||||||
(push! *input-ports* (current-input-port))
|
(set-current-input-port (open-input-file ,file))
|
||||||
(set-current-input-port (open-input-file ,file))
|
(primitive-load)
|
||||||
(primitive-load)
|
(set-current-input-port (pop! *input-ports*))))
|
||||||
(set-current-input-port (pop! *input-ports*)))))
|
|
||||||
|
(define (memq x lst)
|
||||||
|
(if (null? lst) #f
|
||||||
|
(if (eq? x (car lst)) lst
|
||||||
|
(memq x (cdr lst)))))
|
||||||
|
|
||||||
|
(define (string-join lst infix)
|
||||||
|
(if (null? (cdr lst)) (car lst)
|
||||||
|
(string-append (car lst) infix (string-join (cdr lst) infix))))
|
||||||
|
|
||||||
|
(define *mes-prefix* "module/")
|
||||||
|
(define (module->file o)
|
||||||
|
(string-append (string-join (map symbol->string o) "/") ".mes"))
|
||||||
|
|
||||||
|
(define *modules* '(mes/base-0.mes))
|
||||||
|
(define (mes-load-module-env module a)
|
||||||
|
(push! *input-ports* (current-input-port))
|
||||||
|
(set-current-input-port (open-input-file (string-append *mes-prefix* (module->file module))))
|
||||||
|
(let ((x (eval-env (append (cons 'begin (read-input-file-env #f a))
|
||||||
|
'((current-module)))
|
||||||
|
a)))
|
||||||
|
(set-current-input-port (pop! *input-ports*))
|
||||||
|
x))
|
||||||
|
(define-macro (mes-use-module module)
|
||||||
|
`(begin
|
||||||
|
(if (not (memq (string->symbol ,(module->file module)) *modules*))
|
||||||
|
(begin
|
||||||
|
(set! *modules* (cons (string->symbol ,(module->file module)) *modules*))
|
||||||
|
;; (display "loading file=" (current-error-port))
|
||||||
|
;; (display ,(module->file module) (current-error-port))
|
||||||
|
;; (newline (current-error-port))
|
||||||
|
(load ,(string-append *mes-prefix* (module->file module)))))))
|
||||||
|
|
||||||
|
(define (not x)
|
||||||
|
(if x #f #t))
|
||||||
|
|
||||||
|
(mes-use-module (srfi srfi-0))
|
||||||
|
(mes-use-module (mes base))
|
||||||
|
(mes-use-module (mes scm))
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; base.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -21,14 +21,12 @@
|
||||||
|
|
||||||
;;; Commentary:
|
;;; Commentary:
|
||||||
|
|
||||||
;;; base.mes is being loaded after base0.mes. It provides the minimal
|
;;; base.mes is being loaded after base-0.mes. It provides the minimal
|
||||||
;;; set of scheme primitives to run lib/test.mes. It is safe to be
|
;;; set of scheme primitives to run lib/test.mes. It is safe to be
|
||||||
;;; run by Guile.
|
;;; run by Guile.
|
||||||
|
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
|
||||||
(define-macro (mes-use-module . rest) #t)
|
|
||||||
|
|
||||||
(define (identity x) x)
|
(define (identity x) x)
|
||||||
|
|
||||||
(define-macro (or . x)
|
(define-macro (or . x)
|
||||||
|
|
@ -43,9 +41,6 @@
|
||||||
(list 'if (car x) (cons 'and (cdr x))
|
(list 'if (car x) (cons 'and (cdr x))
|
||||||
#f))))
|
#f))))
|
||||||
|
|
||||||
(define (not x)
|
|
||||||
(if x #f #t))
|
|
||||||
|
|
||||||
(define (equal? a b) ;; FIXME: only 2 arg
|
(define (equal? a b) ;; FIXME: only 2 arg
|
||||||
(if (and (null? a) (null? b)) #t
|
(if (and (null? a) (null? b)) #t
|
||||||
(if (and (pair? a) (pair? b))
|
(if (and (pair? a) (pair? b))
|
||||||
|
|
@ -57,19 +52,8 @@
|
||||||
(equal? (vector->list a) (vector->list b))
|
(equal? (vector->list a) (vector->list b))
|
||||||
(eq? a b))))))
|
(eq? a b))))))
|
||||||
|
|
||||||
(define (memq x lst)
|
|
||||||
(if (null? lst) #f
|
|
||||||
(if (eq? x (car lst)) lst
|
|
||||||
(memq x (cdr lst)))))
|
|
||||||
|
|
||||||
(define guile? (not (pair? (current-module))))
|
(define guile? (not (pair? (current-module))))
|
||||||
|
|
||||||
(define (map f l . r)
|
|
||||||
(if (null? l) '()
|
|
||||||
(if (null? r) (cons (f (car l)) (map f (cdr l)))
|
|
||||||
(if (null? (cdr r))
|
|
||||||
(cons (f (car l) (caar r)) (map f (cdr l) (cdar r)))))))
|
|
||||||
|
|
||||||
(define (list? x)
|
(define (list? x)
|
||||||
(or (null? x)
|
(or (null? x)
|
||||||
(and (pair? x) (list? (cdr x)))))
|
(and (pair? x) (list? (cdr x)))))
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; elf.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -24,6 +24,8 @@
|
||||||
|
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
|
||||||
|
(mes-use-module (rnrs bytevectors))
|
||||||
|
|
||||||
(define (int->bv32 value)
|
(define (int->bv32 value)
|
||||||
(let ((bv (make-bytevector 4)))
|
(let ((bv (make-bytevector 4)))
|
||||||
(bytevector-u32-native-set! bv 0 value)
|
(bytevector-u32-native-set! bv 0 value)
|
||||||
|
|
|
||||||
2134
module/mes/lalr.mes
2134
module/mes/lalr.mes
File diff suppressed because it is too large
Load diff
2120
module/mes/lalr.upstream.mes
Normal file
2120
module/mes/lalr.upstream.mes
Normal file
File diff suppressed because it is too large
Load diff
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; let.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -18,6 +18,16 @@
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
;;; Commentary:
|
||||||
|
|
||||||
|
;;; let.mes is loaded after base and quasiquote. It provides
|
||||||
|
;;; let, let* and named let.
|
||||||
|
|
||||||
|
;;; Code:
|
||||||
|
|
||||||
|
(mes-use-module (mes base))
|
||||||
|
(mes-use-module (mes quasiquote))
|
||||||
|
|
||||||
(define-macro (xsimple-let bindings rest)
|
(define-macro (xsimple-let bindings rest)
|
||||||
`(,`(lambda ,(map car bindings) ,@rest)
|
`(,`(lambda ,(map car bindings) ,@rest)
|
||||||
,@(map cadr bindings)))
|
,@(map cadr bindings)))
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; libc-i386.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; loop-0.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
|
||||||
|
|
@ -1,934 +1,26 @@
|
||||||
;;; match.scm -- portable hygienic pattern matcher -*- coding: utf-8; mode: scheme -*-
|
;;; -*-scheme-*-
|
||||||
;;
|
|
||||||
;; This code is written by Alex Shinn and placed in the
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;; Public Domain. All warranties are disclaimed.
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
|
;;;
|
||||||
;;> @example-import[(srfi 9)]
|
;;; This file is part of Mes.
|
||||||
|
;;;
|
||||||
;;> This is a full superset of the popular @hyperlink[
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;> "http://www.cs.indiana.edu/scheme-repository/code.match.html"]{match}
|
;;; under the terms of the GNU General Public License as published by
|
||||||
;;> package by Andrew Wright, written in fully portable @scheme{syntax-rules}
|
;;; the Free Software Foundation; either version 3 of the License, or (at
|
||||||
;;> and thus preserving hygiene.
|
;;; your option) any later version.
|
||||||
|
;;;
|
||||||
;;> The most notable extensions are the ability to use @emph{non-linear}
|
;;; Mes is distributed in the hope that it will be useful, but
|
||||||
;;> patterns - patterns in which the same identifier occurs multiple
|
;;; WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
;;> times, tail patterns after ellipsis, and the experimental tree patterns.
|
;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
;;; GNU General Public License for more details.
|
||||||
;;> @subsubsection{Patterns}
|
;;;
|
||||||
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;> Patterns are written to look like the printed representation of
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
;;> the objects they match. The basic usage is
|
|
||||||
|
;;; Commentary:
|
||||||
;;> @scheme{(match expr (pat body ...) ...)}
|
|
||||||
|
;;; portable matcher
|
||||||
;;> where the result of @var{expr} is matched against each pattern in
|
|
||||||
;;> turn, and the corresponding body is evaluated for the first to
|
(mes-use-module (mes syntax))
|
||||||
;;> succeed. Thus, a list of three elements matches a list of three
|
(mes-use-module (mes match.upstream))
|
||||||
;;> elements.
|
|
||||||
|
|
||||||
;;> @example{(let ((ls (list 1 2 3))) (match ls ((1 2 3) #t)))}
|
|
||||||
|
|
||||||
;;> If no patterns match an error is signalled.
|
|
||||||
|
|
||||||
;;> Identifiers will match anything, and make the corresponding
|
|
||||||
;;> binding available in the body.
|
|
||||||
|
|
||||||
;;> @example{(match (list 1 2 3) ((a b c) b))}
|
|
||||||
|
|
||||||
;;> If the same identifier occurs multiple times, the first instance
|
|
||||||
;;> will match anything, but subsequent instances must match a value
|
|
||||||
;;> which is @scheme{equal?} to the first.
|
|
||||||
|
|
||||||
;;> @example{(match (list 1 2 1) ((a a b) 1) ((a b a) 2))}
|
|
||||||
|
|
||||||
;;> The special identifier @scheme{_} matches anything, no matter how
|
|
||||||
;;> many times it is used, and does not bind the result in the body.
|
|
||||||
|
|
||||||
;;> @example{(match (list 1 2 1) ((_ _ b) 1) ((a b a) 2))}
|
|
||||||
|
|
||||||
;;> To match a literal identifier (or list or any other literal), use
|
|
||||||
;;> @scheme{quote}.
|
|
||||||
|
|
||||||
;;> @example{(match 'a ('b 1) ('a 2))}
|
|
||||||
|
|
||||||
;;> Analogous to its normal usage in scheme, @scheme{quasiquote} can
|
|
||||||
;;> be used to quote a mostly literally matching object with selected
|
|
||||||
;;> parts unquoted.
|
|
||||||
|
|
||||||
;;> @example|{(match (list 1 2 3) (`(1 ,b ,c) (list b c)))}|
|
|
||||||
|
|
||||||
;;> Often you want to match any number of a repeated pattern. Inside
|
|
||||||
;;> a list pattern you can append @scheme{...} after an element to
|
|
||||||
;;> match zero or more of that pattern (like a regexp Kleene star).
|
|
||||||
|
|
||||||
;;> @example{(match (list 1 2) ((1 2 3 ...) #t))}
|
|
||||||
;;> @example{(match (list 1 2 3) ((1 2 3 ...) #t))}
|
|
||||||
;;> @example{(match (list 1 2 3 3 3) ((1 2 3 ...) #t))}
|
|
||||||
|
|
||||||
;;> Pattern variables matched inside the repeated pattern are bound to
|
|
||||||
;;> a list of each matching instance in the body.
|
|
||||||
|
|
||||||
;;> @example{(match (list 1 2) ((a b c ...) c))}
|
|
||||||
;;> @example{(match (list 1 2 3) ((a b c ...) c))}
|
|
||||||
;;> @example{(match (list 1 2 3 4 5) ((a b c ...) c))}
|
|
||||||
|
|
||||||
;;> More than one @scheme{...} may not be used in the same list, since
|
|
||||||
;;> this would require exponential backtracking in the general case.
|
|
||||||
;;> However, @scheme{...} need not be the final element in the list,
|
|
||||||
;;> and may be succeeded by a fixed number of patterns.
|
|
||||||
|
|
||||||
;;> @example{(match (list 1 2 3 4) ((a b c ... d e) c))}
|
|
||||||
;;> @example{(match (list 1 2 3 4 5) ((a b c ... d e) c))}
|
|
||||||
;;> @example{(match (list 1 2 3 4 5 6 7) ((a b c ... d e) c))}
|
|
||||||
|
|
||||||
;;> @scheme{___} is provided as an alias for @scheme{...} when it is
|
|
||||||
;;> inconvenient to use the ellipsis (as in a syntax-rules template).
|
|
||||||
|
|
||||||
;;> The @scheme{..1} syntax is exactly like the @scheme{...} except
|
|
||||||
;;> that it matches one or more repetitions (like a regexp "+").
|
|
||||||
|
|
||||||
;;> @example{(match (list 1 2) ((a b c ..1) c))}
|
|
||||||
;;> @example{(match (list 1 2 3) ((a b c ..1) c))}
|
|
||||||
|
|
||||||
;;> The boolean operators @scheme{and}, @scheme{or} and @scheme{not}
|
|
||||||
;;> can be used to group and negate patterns analogously to their
|
|
||||||
;;> Scheme counterparts.
|
|
||||||
|
|
||||||
;;> The @scheme{and} operator ensures that all subpatterns match.
|
|
||||||
;;> This operator is often used with the idiom @scheme{(and x pat)} to
|
|
||||||
;;> bind @var{x} to the entire value that matches @var{pat}
|
|
||||||
;;> (c.f. "as-patterns" in ML or Haskell). Another common use is in
|
|
||||||
;;> conjunction with @scheme{not} patterns to match a general case
|
|
||||||
;;> with certain exceptions.
|
|
||||||
|
|
||||||
;;> @example{(match 1 ((and) #t))}
|
|
||||||
;;> @example{(match 1 ((and x) x))}
|
|
||||||
;;> @example{(match 1 ((and x 1) x))}
|
|
||||||
|
|
||||||
;;> The @scheme{or} operator ensures that at least one subpattern
|
|
||||||
;;> matches. If the same identifier occurs in different subpatterns,
|
|
||||||
;;> it is matched independently. All identifiers from all subpatterns
|
|
||||||
;;> are bound if the @scheme{or} operator matches, but the binding is
|
|
||||||
;;> only defined for identifiers from the subpattern which matched.
|
|
||||||
|
|
||||||
;;> @example{(match 1 ((or) #t) (else #f))}
|
|
||||||
;;> @example{(match 1 ((or x) x))}
|
|
||||||
;;> @example{(match 1 ((or x 2) x))}
|
|
||||||
|
|
||||||
;;> The @scheme{not} operator succeeds if the given pattern doesn't
|
|
||||||
;;> match. None of the identifiers used are available in the body.
|
|
||||||
|
|
||||||
;;> @example{(match 1 ((not 2) #t))}
|
|
||||||
|
|
||||||
;;> The more general operator @scheme{?} can be used to provide a
|
|
||||||
;;> predicate. The usage is @scheme{(? predicate pat ...)} where
|
|
||||||
;;> @var{predicate} is a Scheme expression evaluating to a predicate
|
|
||||||
;;> called on the value to match, and any optional patterns after the
|
|
||||||
;;> predicate are then matched as in an @scheme{and} pattern.
|
|
||||||
|
|
||||||
;;> @example{(match 1 ((? odd? x) x))}
|
|
||||||
|
|
||||||
;;> The field operator @scheme{=} is used to extract an arbitrary
|
|
||||||
;;> field and match against it. It is useful for more complex or
|
|
||||||
;;> conditional destructuring that can't be more directly expressed in
|
|
||||||
;;> the pattern syntax. The usage is @scheme{(= field pat)}, where
|
|
||||||
;;> @var{field} can be any expression, and should result in a
|
|
||||||
;;> procedure of one argument, which is applied to the value to match
|
|
||||||
;;> to generate a new value to match against @var{pat}.
|
|
||||||
|
|
||||||
;;> Thus the pattern @scheme{(and (= car x) (= cdr y))} is equivalent
|
|
||||||
;;> to @scheme{(x . y)}, except it will result in an immediate error
|
|
||||||
;;> if the value isn't a pair.
|
|
||||||
|
|
||||||
;;> @example{(match '(1 . 2) ((= car x) x))}
|
|
||||||
;;> @example{(match 4 ((= sqrt x) x))}
|
|
||||||
|
|
||||||
;;> The record operator @scheme{$} is used as a concise way to match
|
|
||||||
;;> records defined by SRFI-9 (or SRFI-99). The usage is
|
|
||||||
;;> @scheme{($ rtd field ...)}, where @var{rtd} should be the record
|
|
||||||
;;> type descriptor specified as the first argument to
|
|
||||||
;;> @scheme{define-record-type}, and each @var{field} is a subpattern
|
|
||||||
;;> matched against the fields of the record in order. Not all fields
|
|
||||||
;;> must be present.
|
|
||||||
|
|
||||||
;;> @example{
|
|
||||||
;;> (let ()
|
|
||||||
;;> (define-record-type employee
|
|
||||||
;;> (make-employee name title)
|
|
||||||
;;> employee?
|
|
||||||
;;> (name get-name)
|
|
||||||
;;> (title get-title))
|
|
||||||
;;> (match (make-employee "Bob" "Doctor")
|
|
||||||
;;> (($ employee n t) (list t n))))
|
|
||||||
;;> }
|
|
||||||
|
|
||||||
;;> The @scheme{set!} and @scheme{get!} operators are used to bind an
|
|
||||||
;;> identifier to the setter and getter of a field, respectively. The
|
|
||||||
;;> setter is a procedure of one argument, which mutates the field to
|
|
||||||
;;> that argument. The getter is a procedure of no arguments which
|
|
||||||
;;> returns the current value of the field.
|
|
||||||
|
|
||||||
;;> @example{(let ((x (cons 1 2))) (match x ((1 . (set! s)) (s 3) x)))}
|
|
||||||
;;> @example{(match '(1 . 2) ((1 . (get! g)) (g)))}
|
|
||||||
|
|
||||||
;;> The new operator @scheme{***} can be used to search a tree for
|
|
||||||
;;> subpatterns. A pattern of the form @scheme{(x *** y)} represents
|
|
||||||
;;> the subpattern @var{y} located somewhere in a tree where the path
|
|
||||||
;;> from the current object to @var{y} can be seen as a list of the
|
|
||||||
;;> form @scheme{(x ...)}. @var{y} can immediately match the current
|
|
||||||
;;> object in which case the path is the empty list. In a sense it's
|
|
||||||
;;> a 2-dimensional version of the @scheme{...} pattern.
|
|
||||||
|
|
||||||
;;> As a common case the pattern @scheme{(_ *** y)} can be used to
|
|
||||||
;;> search for @var{y} anywhere in a tree, regardless of the path
|
|
||||||
;;> used.
|
|
||||||
|
|
||||||
;;> @example{(match '(a (a (a b))) ((x *** 'b) x))}
|
|
||||||
;;> @example{(match '(a (b) (c (d e) (f g))) ((x *** 'g) x))}
|
|
||||||
|
|
||||||
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
||||||
;; Notes
|
|
||||||
|
|
||||||
;; The implementation is a simple generative pattern matcher - each
|
|
||||||
;; pattern is expanded into the required tests, calling a failure
|
|
||||||
;; continuation if the tests fail. This makes the logic easy to
|
|
||||||
;; follow and extend, but produces sub-optimal code in cases where you
|
|
||||||
;; have many similar clauses due to repeating the same tests.
|
|
||||||
;; Nonetheless a smart compiler should be able to remove the redundant
|
|
||||||
;; tests. For MATCH-LET and DESTRUCTURING-BIND type uses there is no
|
|
||||||
;; performance hit.
|
|
||||||
|
|
||||||
;; The original version was written on 2006/11/29 and described in the
|
|
||||||
;; following Usenet post:
|
|
||||||
;; http://groups.google.com/group/comp.lang.scheme/msg/0941234de7112ffd
|
|
||||||
;; and is still available at
|
|
||||||
;; http://synthcode.com/scheme/match-simple.scm
|
|
||||||
;; It's just 80 lines for the core MATCH, and an extra 40 lines for
|
|
||||||
;; MATCH-LET, MATCH-LAMBDA and other syntactic sugar.
|
|
||||||
;;
|
|
||||||
;; A variant of this file which uses COND-EXPAND in a few places for
|
|
||||||
;; performance can be found at
|
|
||||||
;; http://synthcode.com/scheme/match-cond-expand.scm
|
|
||||||
;;
|
|
||||||
;; 2012/05/23 - fixing combinatorial explosion of code in certain or patterns
|
|
||||||
;; 2011/09/25 - fixing bug when directly matching an identifier repeated in
|
|
||||||
;; the pattern (thanks to Stefan Israelsson Tampe)
|
|
||||||
;; 2011/01/27 - fixing bug when matching tail patterns against improper lists
|
|
||||||
;; 2010/09/26 - adding `..1' patterns (thanks to Ludovic Courtès)
|
|
||||||
;; 2010/09/07 - fixing identifier extraction in some `...' and `***' patterns
|
|
||||||
;; 2009/11/25 - adding `***' tree search patterns
|
|
||||||
;; 2008/03/20 - fixing bug where (a ...) matched non-lists
|
|
||||||
;; 2008/03/15 - removing redundant check in vector patterns
|
|
||||||
;; 2008/03/06 - you can use `...' portably now (thanks to Taylor Campbell)
|
|
||||||
;; 2007/09/04 - fixing quasiquote patterns
|
|
||||||
;; 2007/07/21 - allowing ellipse patterns in non-final list positions
|
|
||||||
;; 2007/04/10 - fixing potential hygiene issue in match-check-ellipse
|
|
||||||
;; (thanks to Taylor Campbell)
|
|
||||||
;; 2007/04/08 - clean up, commenting
|
|
||||||
;; 2006/12/24 - bugfixes
|
|
||||||
;; 2006/12/01 - non-linear patterns, shared variables in OR, get!/set!
|
|
||||||
|
|
||||||
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
||||||
;; force compile-time syntax errors with useful messages
|
|
||||||
|
|
||||||
(define-syntax match-syntax-error
|
|
||||||
(syntax-rules ()
|
|
||||||
((_) (match-syntax-error "invalid match-syntax-error usage"))))
|
|
||||||
|
|
||||||
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
||||||
|
|
||||||
;;> @subsubsection{Syntax}
|
|
||||||
|
|
||||||
;;> @subsubsubsection{@rawcode{(match expr (pattern . body) ...)@br{}
|
|
||||||
;;> (match expr (pattern (=> failure) . body) ...)}}
|
|
||||||
|
|
||||||
;;> The result of @var{expr} is matched against each @var{pattern} in
|
|
||||||
;;> turn, according to the pattern rules described in the previous
|
|
||||||
;;> section, until the the first @var{pattern} matches. When a match is
|
|
||||||
;;> found, the corresponding @var{body}s are evaluated in order,
|
|
||||||
;;> and the result of the last expression is returned as the result
|
|
||||||
;;> of the entire @scheme{match}. If a @var{failure} is provided,
|
|
||||||
;;> then it is bound to a procedure of no arguments which continues,
|
|
||||||
;;> processing at the next @var{pattern}. If no @var{pattern} matches,
|
|
||||||
;;> an error is signalled.
|
|
||||||
|
|
||||||
;; The basic interface. MATCH just performs some basic syntax
|
|
||||||
;; validation, binds the match expression to a temporary variable `v',
|
|
||||||
;; and passes it on to MATCH-NEXT. It's a constant throughout the
|
|
||||||
;; code below that the binding `v' is a direct variable reference, not
|
|
||||||
;; an expression.
|
|
||||||
|
|
||||||
(define-syntax match
|
|
||||||
(syntax-rules ()
|
|
||||||
((match)
|
|
||||||
(match-syntax-error "missing match expression"))
|
|
||||||
((match atom)
|
|
||||||
(match-syntax-error "no match clauses"))
|
|
||||||
((match (app ...) (pat . body) ...)
|
|
||||||
(let ((v (app ...)))
|
|
||||||
(match-next v ((app ...) (set! (app ...))) (pat . body) ...)))
|
|
||||||
((match #(vec ...) (pat . body) ...)
|
|
||||||
(let ((v #(vec ...)))
|
|
||||||
(match-next v (v (set! v)) (pat . body) ...)))
|
|
||||||
((match atom (pat . body) ...)
|
|
||||||
(let ((v atom))
|
|
||||||
(match-next v (atom (set! atom)) (pat . body) ...)))
|
|
||||||
))
|
|
||||||
|
|
||||||
;; MATCH-NEXT passes each clause to MATCH-ONE in turn with its failure
|
|
||||||
;; thunk, which is expanded by recursing MATCH-NEXT on the remaining
|
|
||||||
;; clauses. `g+s' is a list of two elements, the get! and set!
|
|
||||||
;; expressions respectively.
|
|
||||||
|
|
||||||
(define-syntax match-next
|
|
||||||
(syntax-rules (=>)
|
|
||||||
;; no more clauses, the match failed
|
|
||||||
((match-next v g+s)
|
|
||||||
;; Here we call error in non-tail context, so that the backtrace
|
|
||||||
;; can show the source location of the failing match form.
|
|
||||||
(begin
|
|
||||||
(error 'match "no matching pattern" v)
|
|
||||||
#f))
|
|
||||||
;; named failure continuation
|
|
||||||
((match-next v g+s (pat (=> failure) . body) . rest)
|
|
||||||
(let ((failure (lambda () (match-next v g+s . rest))))
|
|
||||||
;; match-one analyzes the pattern for us
|
|
||||||
(match-one v pat g+s (match-drop-ids (begin . body)) (failure) ())))
|
|
||||||
;; anonymous failure continuation, give it a dummy name
|
|
||||||
((match-next v g+s (pat . body) . rest)
|
|
||||||
(match-next v g+s (pat (=> failure) . body) . rest))))
|
|
||||||
|
|
||||||
;; MATCH-ONE first checks for ellipse patterns, otherwise passes on to
|
|
||||||
;; MATCH-TWO.
|
|
||||||
|
|
||||||
(define-syntax match-one
|
|
||||||
(syntax-rules ()
|
|
||||||
;; If it's a list of two or more values, check to see if the
|
|
||||||
;; second one is an ellipse and handle accordingly, otherwise go
|
|
||||||
;; to MATCH-TWO.
|
|
||||||
((match-one v (p q . r) g+s sk fk i)
|
|
||||||
(match-check-ellipse
|
|
||||||
q
|
|
||||||
(match-extract-vars p (match-gen-ellipses v p r g+s sk fk i) i ())
|
|
||||||
(match-two v (p q . r) g+s sk fk i)))
|
|
||||||
;; Go directly to MATCH-TWO.
|
|
||||||
((match-one . x)
|
|
||||||
(match-two . x))))
|
|
||||||
|
|
||||||
;; This is the guts of the pattern matcher. We are passed a lot of
|
|
||||||
;; information in the form:
|
|
||||||
;;
|
|
||||||
;; (match-two var pattern getter setter success-k fail-k (ids ...))
|
|
||||||
;;
|
|
||||||
;; usually abbreviated
|
|
||||||
;;
|
|
||||||
;; (match-two v p g+s sk fk i)
|
|
||||||
;;
|
|
||||||
;; where VAR is the symbol name of the current variable we are
|
|
||||||
;; matching, PATTERN is the current pattern, getter and setter are the
|
|
||||||
;; corresponding accessors (e.g. CAR and SET-CAR! of the pair holding
|
|
||||||
;; VAR), SUCCESS-K is the success continuation, FAIL-K is the failure
|
|
||||||
;; continuation (which is just a thunk call and is thus safe to expand
|
|
||||||
;; multiple times) and IDS are the list of identifiers bound in the
|
|
||||||
;; pattern so far.
|
|
||||||
|
|
||||||
(define-syntax match-two
|
|
||||||
(syntax-rules (_ ___ ..1 *** quote quasiquote ? $ = and or not set! get!)
|
|
||||||
((match-two v () g+s (sk ...) fk i)
|
|
||||||
(if (null? v) (sk ... i) fk))
|
|
||||||
((match-two v (quote p) g+s (sk ...) fk i)
|
|
||||||
(if (equal? v 'p) (sk ... i) fk))
|
|
||||||
((match-two v (quasiquote p) . x)
|
|
||||||
(match-quasiquote v p . x))
|
|
||||||
((match-two v (and) g+s (sk ...) fk i) (sk ... i))
|
|
||||||
((match-two v (and p q ...) g+s sk fk i)
|
|
||||||
(match-one v p g+s (match-one v (and q ...) g+s sk fk) fk i))
|
|
||||||
((match-two v (or) g+s sk fk i) fk)
|
|
||||||
((match-two v (or p) . x)
|
|
||||||
(match-one v p . x))
|
|
||||||
((match-two v (or p ...) g+s sk fk i)
|
|
||||||
(match-extract-vars (or p ...) (match-gen-or v (p ...) g+s sk fk i) i ()))
|
|
||||||
((match-two v (not p) g+s (sk ...) fk i)
|
|
||||||
(match-one v p g+s (match-drop-ids fk) (sk ... i) i))
|
|
||||||
((match-two v (get! getter) (g s) (sk ...) fk i)
|
|
||||||
(let ((getter (lambda () g))) (sk ... i)))
|
|
||||||
((match-two v (set! setter) (g (s ...)) (sk ...) fk i)
|
|
||||||
(let ((setter (lambda (x) (s ... x)))) (sk ... i)))
|
|
||||||
((match-two v (? pred . p) g+s sk fk i)
|
|
||||||
(if (pred v) (match-one v (and . p) g+s sk fk i) fk))
|
|
||||||
((match-two v (= proc p) . x)
|
|
||||||
(let ((w (proc v))) (match-one w p . x))
|
|
||||||
;;(let ((W (proc v))) (match-one W p . x))
|
|
||||||
)
|
|
||||||
((match-two v (p ___ . r) g+s sk fk i)
|
|
||||||
(match-extract-vars p (match-gen-ellipses v p r g+s sk fk i) i ()))
|
|
||||||
((match-two v (p) g+s sk fk i)
|
|
||||||
(if (and (pair? v) (null? (cdr v)))
|
|
||||||
(let ;;((w (car v)))
|
|
||||||
((W (car v)))
|
|
||||||
;;(match-one w p ((car v) (set-car! v)) sk fk i)
|
|
||||||
(match-one W p ((car v) (set-car! v)) sk fk i)
|
|
||||||
)
|
|
||||||
fk))
|
|
||||||
((match-two v (p *** q) g+s sk fk i)
|
|
||||||
(match-extract-vars p (match-gen-search v p q g+s sk fk i) i ()))
|
|
||||||
((match-two v (p *** . q) g+s sk fk i)
|
|
||||||
(match-syntax-error "invalid use of ***" (p *** . q)))
|
|
||||||
((match-two v (p ..1) g+s sk fk i)
|
|
||||||
(if (pair? v)
|
|
||||||
(match-one v (p ___) g+s sk fk i)
|
|
||||||
fk))
|
|
||||||
((match-two v ($ rec p ...) g+s sk fk i)
|
|
||||||
(if (is-a? v rec)
|
|
||||||
(match-record-refs v rec 0 (p ...) g+s sk fk i)
|
|
||||||
fk))
|
|
||||||
((match-two v (p . q) g+s sk fk i)
|
|
||||||
(if (pair? v)
|
|
||||||
(let ;;((w (car v)) (x (cdr v)))
|
|
||||||
((W (car v)) (X (cdr v)))
|
|
||||||
(match-one ;;w p ((car v) (set-car! v))
|
|
||||||
W p ((car v) (set-car! v))
|
|
||||||
;;(match-one x q ((cdr v) (set-cdr! v)) sk fk)
|
|
||||||
(match-one X q ((cdr v) (set-cdr! v)) sk fk)
|
|
||||||
fk
|
|
||||||
i))
|
|
||||||
fk))
|
|
||||||
((match-two v #(p ...) g+s . x)
|
|
||||||
(match-vector v 0 () (p ...) . x))
|
|
||||||
((match-two v _ g+s (sk ...) fk i) (sk ... i))
|
|
||||||
;; Not a pair or vector or special literal, test to see if it's a
|
|
||||||
;; new symbol, in which case we just bind it, or if it's an
|
|
||||||
;; already bound symbol or some other literal, in which case we
|
|
||||||
;; compare it with EQUAL?.
|
|
||||||
(;;(match-two v x g+s (sk ...) fk (id ...))
|
|
||||||
(match-two V X g+s (sk ...) fk (id ...))
|
|
||||||
(let-syntax
|
|
||||||
((new-sym?
|
|
||||||
(syntax-rules (id ...)
|
|
||||||
;;((new-sym? x sk2 fk2) sk2)
|
|
||||||
((new-sym? X sk2 fk2) sk2)
|
|
||||||
((new-sym? y sk2 fk2) fk2))))
|
|
||||||
(new-sym? random-sym-to-match
|
|
||||||
;;(let ((x v)) (sk ... (id ... x)))
|
|
||||||
(let ((X V)) (sk ... (id ... X)))
|
|
||||||
;;(if (equal? v x) (sk ... (id ...)) fk)
|
|
||||||
(if (equal? V X) (sk ... (id ...)) fk)
|
|
||||||
)))
|
|
||||||
))
|
|
||||||
|
|
||||||
;; QUASIQUOTE patterns
|
|
||||||
|
|
||||||
(define-syntax match-quasiquote
|
|
||||||
(syntax-rules (unquote unquote-splicing quasiquote)
|
|
||||||
((_ v (unquote p) g+s sk fk i)
|
|
||||||
(match-one v p g+s sk fk i))
|
|
||||||
((_ v ((unquote-splicing p) . rest) g+s sk fk i)
|
|
||||||
(if (pair? v)
|
|
||||||
(match-one v
|
|
||||||
(p . tmp)
|
|
||||||
(match-quasiquote tmp rest g+s sk fk)
|
|
||||||
fk
|
|
||||||
i)
|
|
||||||
fk))
|
|
||||||
((_ v (quasiquote p) g+s sk fk i . depth)
|
|
||||||
(match-quasiquote v p g+s sk fk i #f . depth))
|
|
||||||
((_ v (unquote p) g+s sk fk i x . depth)
|
|
||||||
(match-quasiquote v p g+s sk fk i . depth))
|
|
||||||
((_ v (unquote-splicing p) g+s sk fk i x . depth)
|
|
||||||
(match-quasiquote v p g+s sk fk i . depth))
|
|
||||||
((_ v (p . q) g+s sk fk i . depth)
|
|
||||||
(if (pair? v)
|
|
||||||
(let ;;((w (car v)) (x (cdr v)))
|
|
||||||
((W (car v)) (X (cdr v)))
|
|
||||||
(match-quasiquote
|
|
||||||
;;w p g+s
|
|
||||||
W p g+s
|
|
||||||
;;(match-quasiquote-step x q g+s sk fk depth)
|
|
||||||
(match-quasiquote-step X q g+s sk fk depth)
|
|
||||||
fk i . depth))
|
|
||||||
fk))
|
|
||||||
((_ v #(elt ...) g+s sk fk i . depth)
|
|
||||||
(if (vector? v)
|
|
||||||
(let ((ls (vector->list v)))
|
|
||||||
(match-quasiquote ls (elt ...) g+s sk fk i . depth))
|
|
||||||
fk))
|
|
||||||
((_ v x g+s sk fk i . depth)
|
|
||||||
(match-one v 'x g+s sk fk i))))
|
|
||||||
|
|
||||||
(define-syntax match-quasiquote-step
|
|
||||||
(syntax-rules ()
|
|
||||||
((match-quasiquote-step x q g+s sk fk depth i)
|
|
||||||
(match-quasiquote x q g+s sk fk i . depth))))
|
|
||||||
|
|
||||||
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
||||||
;; Utilities
|
|
||||||
|
|
||||||
;; Takes two values and just expands into the first.
|
|
||||||
(define-syntax match-drop-ids
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ expr ids ...) expr)))
|
|
||||||
|
|
||||||
(define-syntax match-tuck-ids
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ (letish args (expr ...)) ids ...)
|
|
||||||
(letish args (expr ... ids ...)))))
|
|
||||||
|
|
||||||
(define-syntax match-drop-first-arg
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ arg expr) expr)))
|
|
||||||
|
|
||||||
;; To expand an OR group we try each clause in succession, passing the
|
|
||||||
;; first that succeeds to the success continuation. On failure for
|
|
||||||
;; any clause, we just try the next clause, finally resorting to the
|
|
||||||
;; failure continuation fk if all clauses fail. The only trick is
|
|
||||||
;; that we want to unify the identifiers, so that the success
|
|
||||||
;; continuation can refer to a variable from any of the OR clauses.
|
|
||||||
|
|
||||||
(define-syntax match-gen-or
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ v p g+s (sk ...) fk (i ...) ((id id-ls) ...))
|
|
||||||
(let ((sk2 (lambda (id ...) (sk ... (i ... id ...)))))
|
|
||||||
(match-gen-or-step v p g+s (match-drop-ids (sk2 id ...)) fk (i ...))))))
|
|
||||||
|
|
||||||
(define-syntax match-gen-or-step
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ v () g+s sk fk . x)
|
|
||||||
;; no OR clauses, call the failure continuation
|
|
||||||
fk)
|
|
||||||
((_ v (p) . x)
|
|
||||||
;; last (or only) OR clause, just expand normally
|
|
||||||
(match-one v p . x))
|
|
||||||
((_ v (p . q) g+s sk fk i)
|
|
||||||
;; match one and try the remaining on failure
|
|
||||||
(let ((fk2 (lambda () (match-gen-or-step v q g+s sk fk i))))
|
|
||||||
(match-one v p g+s sk (fk2) i)))
|
|
||||||
))
|
|
||||||
|
|
||||||
;; We match a pattern (p ...) by matching the pattern p in a loop on
|
|
||||||
;; each element of the variable, accumulating the bound ids into lists.
|
|
||||||
|
|
||||||
;; Look at the body of the simple case - it's just a named let loop,
|
|
||||||
;; matching each element in turn to the same pattern. The only trick
|
|
||||||
;; is that we want to keep track of the lists of each extracted id, so
|
|
||||||
;; when the loop recurses we cons the ids onto their respective list
|
|
||||||
;; variables, and on success we bind the ids (what the user input and
|
|
||||||
;; expects to see in the success body) to the reversed accumulated
|
|
||||||
;; list IDs.
|
|
||||||
|
|
||||||
(define-syntax match-gen-ellipses
|
|
||||||
(syntax-rules ()
|
|
||||||
(;;(_ v p () g+s (sk ...) fk i ((id id-ls) ...))
|
|
||||||
(_ v P () g+s (sk ...) fk i ((id id-ls) ...))
|
|
||||||
(match-check-identifier
|
|
||||||
;;p
|
|
||||||
P
|
|
||||||
;; simplest case equivalent to (p ...), just bind the list
|
|
||||||
(let ;;((p v))
|
|
||||||
((P v))
|
|
||||||
(if ;;(list? p)
|
|
||||||
(list? P)
|
|
||||||
(sk ... i)
|
|
||||||
fk))
|
|
||||||
;; simple case, match all elements of the list
|
|
||||||
(let loop ((ls v) (id-ls '()) ...)
|
|
||||||
(cond
|
|
||||||
((null? ls)
|
|
||||||
(let ((id (reverse id-ls)) ...) (sk ... i)))
|
|
||||||
((pair? ls)
|
|
||||||
(let ;;((w (car ls)))
|
|
||||||
((W (car ls)))
|
|
||||||
(match-one ;;w p ((car ls) (set-car! ls))
|
|
||||||
W p ((car ls) (set-car! ls))
|
|
||||||
(match-drop-ids (loop (cdr ls) (cons id id-ls) ...))
|
|
||||||
fk i)))
|
|
||||||
(else
|
|
||||||
fk)))))
|
|
||||||
((_ v p r g+s (sk ...) fk i ((id id-ls) ...))
|
|
||||||
;; general case, trailing patterns to match, keep track of the
|
|
||||||
;; remaining list length so we don't need any backtracking
|
|
||||||
(match-verify-no-ellipses
|
|
||||||
r
|
|
||||||
(let* ((tail-len (length 'r))
|
|
||||||
(ls v)
|
|
||||||
(len (and (list? ls) (length ls))))
|
|
||||||
(if (or (not len) (< len tail-len))
|
|
||||||
fk
|
|
||||||
(let loop ((ls ls) (n len) (id-ls '()) ...)
|
|
||||||
(cond
|
|
||||||
((= n tail-len)
|
|
||||||
(let ((id (reverse id-ls)) ...)
|
|
||||||
(match-one ls r (#f #f) (sk ...) fk i)))
|
|
||||||
((pair? ls)
|
|
||||||
(let ((w (car ls)))
|
|
||||||
(match-one w p ((car ls) (set-car! ls))
|
|
||||||
(match-drop-ids
|
|
||||||
(loop (cdr ls) (- n 1) (cons id id-ls) ...))
|
|
||||||
fk
|
|
||||||
i)))
|
|
||||||
(else
|
|
||||||
fk)))))))))
|
|
||||||
|
|
||||||
;; This is just a safety check. Although unlike syntax-rules we allow
|
|
||||||
;; trailing patterns after an ellipses, we explicitly disable multiple
|
|
||||||
;; ellipses at the same level. This is because in the general case
|
|
||||||
;; such patterns are exponential in the number of ellipses, and we
|
|
||||||
;; don't want to make it easy to construct very expensive operations
|
|
||||||
;; with simple looking patterns. For example, it would be O(n^2) for
|
|
||||||
;; patterns like (a ... b ...) because we must consider every trailing
|
|
||||||
;; element for every possible break for the leading "a ...".
|
|
||||||
|
|
||||||
(define-syntax match-verify-no-ellipses
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ (x . y) sk)
|
|
||||||
(match-check-ellipse
|
|
||||||
x
|
|
||||||
(match-syntax-error
|
|
||||||
"multiple ellipse patterns not allowed at same level")
|
|
||||||
(match-verify-no-ellipses y sk)))
|
|
||||||
((_ () sk)
|
|
||||||
sk)
|
|
||||||
((_ x sk)
|
|
||||||
(match-syntax-error "dotted tail not allowed after ellipse" x))))
|
|
||||||
|
|
||||||
;; To implement the tree search, we use two recursive procedures. TRY
|
|
||||||
;; attempts to match Y once, and on success it calls the normal SK on
|
|
||||||
;; the accumulated list ids as in MATCH-GEN-ELLIPSES. On failure, we
|
|
||||||
;; call NEXT which first checks if the current value is a list
|
|
||||||
;; beginning with X, then calls TRY on each remaining element of the
|
|
||||||
;; list. Since TRY will recursively call NEXT again on failure, this
|
|
||||||
;; effects a full depth-first search.
|
|
||||||
;;
|
|
||||||
;; The failure continuation throughout is a jump to the next step in
|
|
||||||
;; the tree search, initialized with the original failure continuation
|
|
||||||
;; FK.
|
|
||||||
|
|
||||||
(define-syntax match-gen-search
|
|
||||||
(syntax-rules ()
|
|
||||||
((match-gen-search v p q g+s sk fk i ((id id-ls) ...))
|
|
||||||
(letrec ((try (lambda (w fail id-ls ...)
|
|
||||||
(match-one w q g+s
|
|
||||||
(match-tuck-ids
|
|
||||||
(let ((id (reverse id-ls)) ...)
|
|
||||||
sk))
|
|
||||||
(next w fail id-ls ...) i)))
|
|
||||||
(next (lambda (w fail id-ls ...)
|
|
||||||
(if (not (pair? w))
|
|
||||||
(fail)
|
|
||||||
(let ((u (car w)))
|
|
||||||
(match-one
|
|
||||||
u p ((car w) (set-car! w))
|
|
||||||
(match-drop-ids
|
|
||||||
;; accumulate the head variables from
|
|
||||||
;; the p pattern, and loop over the tail
|
|
||||||
(let ((id-ls (cons id id-ls)) ...)
|
|
||||||
(let lp ((ls (cdr w)))
|
|
||||||
(if (pair? ls)
|
|
||||||
(try (car ls)
|
|
||||||
(lambda () (lp (cdr ls)))
|
|
||||||
id-ls ...)
|
|
||||||
(fail)))))
|
|
||||||
(fail) i))))))
|
|
||||||
;; the initial id-ls binding here is a dummy to get the right
|
|
||||||
;; number of '()s
|
|
||||||
(let ((id-ls '()) ...)
|
|
||||||
(try v (lambda () fk) id-ls ...))))))
|
|
||||||
|
|
||||||
;; Vector patterns are just more of the same, with the slight
|
|
||||||
;; exception that we pass around the current vector index being
|
|
||||||
;; matched.
|
|
||||||
|
|
||||||
(define-syntax match-vector
|
|
||||||
(syntax-rules (___)
|
|
||||||
((_ v n pats (p q) . x)
|
|
||||||
(match-check-ellipse q
|
|
||||||
(match-gen-vector-ellipses v n pats p . x)
|
|
||||||
(match-vector-two v n pats (p q) . x)))
|
|
||||||
((_ v n pats (p ___) sk fk i)
|
|
||||||
(match-gen-vector-ellipses v n pats p sk fk i))
|
|
||||||
((_ . x)
|
|
||||||
(match-vector-two . x))))
|
|
||||||
|
|
||||||
;; Check the exact vector length, then check each element in turn.
|
|
||||||
|
|
||||||
(define-syntax match-vector-two
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ v n ((pat index) ...) () sk fk i)
|
|
||||||
(if (vector? v)
|
|
||||||
(let ((len (vector-length v)))
|
|
||||||
(if (= len n)
|
|
||||||
(match-vector-step v ((pat index) ...) sk fk i)
|
|
||||||
fk))
|
|
||||||
fk))
|
|
||||||
((_ v n (pats ...) (p . q) . x)
|
|
||||||
(match-vector v (+ n 1) (pats ... (p n)) q . x))))
|
|
||||||
|
|
||||||
(define-syntax match-vector-step
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ v () (sk ...) fk i) (sk ... i))
|
|
||||||
((_ v ((pat index) . rest) sk fk i)
|
|
||||||
(let ((w (vector-ref v index)))
|
|
||||||
(match-one w pat ((vector-ref v index) (vector-set! v index))
|
|
||||||
(match-vector-step v rest sk fk)
|
|
||||||
fk i)))))
|
|
||||||
|
|
||||||
;; With a vector ellipse pattern we first check to see if the vector
|
|
||||||
;; length is at least the required length.
|
|
||||||
|
|
||||||
(define-syntax match-gen-vector-ellipses
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ v n ((pat index) ...) p sk fk i)
|
|
||||||
(if (vector? v)
|
|
||||||
(let ((len (vector-length v)))
|
|
||||||
(if (>= len n)
|
|
||||||
(match-vector-step v ((pat index) ...)
|
|
||||||
(match-vector-tail v p n len sk fk)
|
|
||||||
fk i)
|
|
||||||
fk))
|
|
||||||
fk))))
|
|
||||||
|
|
||||||
(define-syntax match-vector-tail
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ v p n len sk fk i)
|
|
||||||
(match-extract-vars p (match-vector-tail-two v p n len sk fk i) i ()))))
|
|
||||||
|
|
||||||
(define-syntax match-vector-tail-two
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ v p n len (sk ...) fk i ((id id-ls) ...))
|
|
||||||
(let loop ((j n) (id-ls '()) ...)
|
|
||||||
(if (>= j len)
|
|
||||||
(let ((id (reverse id-ls)) ...) (sk ... i))
|
|
||||||
(let ((w (vector-ref v j)))
|
|
||||||
(match-one w p ((vector-ref v j) (vetor-set! v j))
|
|
||||||
(match-drop-ids (loop (+ j 1) (cons id id-ls) ...))
|
|
||||||
fk i)))))))
|
|
||||||
|
|
||||||
(define-syntax match-record-refs
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ v rec n (p . q) g+s sk fk i)
|
|
||||||
(let ((w (slot-ref rec v n)))
|
|
||||||
(match-one w p ((slot-ref rec v n) (slot-set! rec v n))
|
|
||||||
(match-record-refs v rec (+ n 1) q g+s sk fk) fk i)))
|
|
||||||
((_ v rec n () g+s (sk ...) fk i)
|
|
||||||
(sk ... i))))
|
|
||||||
|
|
||||||
;; Extract all identifiers in a pattern. A little more complicated
|
|
||||||
;; than just looking for symbols, we need to ignore special keywords
|
|
||||||
;; and non-pattern forms (such as the predicate expression in ?
|
|
||||||
;; patterns), and also ignore previously bound identifiers.
|
|
||||||
;;
|
|
||||||
;; Calls the continuation with all new vars as a list of the form
|
|
||||||
;; ((orig-var tmp-name) ...), where tmp-name can be used to uniquely
|
|
||||||
;; pair with the original variable (e.g. it's used in the ellipse
|
|
||||||
;; generation for list variables).
|
|
||||||
;;
|
|
||||||
;; (match-extract-vars pattern continuation (ids ...) (new-vars ...))
|
|
||||||
|
|
||||||
(define-syntax match-extract-vars
|
|
||||||
(syntax-rules (_ ___ ..1 *** ? $ = quote quasiquote and or not get! set!)
|
|
||||||
((match-extract-vars (? pred . p) . x)
|
|
||||||
(match-extract-vars p . x))
|
|
||||||
((match-extract-vars ($ rec . p) . x)
|
|
||||||
(match-extract-vars p . x))
|
|
||||||
((match-extract-vars (= proc p) . x)
|
|
||||||
(match-extract-vars p . x))
|
|
||||||
((match-extract-vars (quote x) (k ...) i v)
|
|
||||||
(k ... v))
|
|
||||||
((match-extract-vars (quasiquote x) k i v)
|
|
||||||
(match-extract-quasiquote-vars x k i v (#t)))
|
|
||||||
((match-extract-vars (and . p) . x)
|
|
||||||
(match-extract-vars p . x))
|
|
||||||
((match-extract-vars (or . p) . x)
|
|
||||||
(match-extract-vars p . x))
|
|
||||||
((match-extract-vars (not . p) . x)
|
|
||||||
(match-extract-vars p . x))
|
|
||||||
;; A non-keyword pair, expand the CAR with a continuation to
|
|
||||||
;; expand the CDR.
|
|
||||||
((match-extract-vars (p q . r) k i v)
|
|
||||||
(match-check-ellipse
|
|
||||||
q
|
|
||||||
(match-extract-vars (p . r) k i v)
|
|
||||||
(match-extract-vars p (match-extract-vars-step (q . r) k i v) i ())))
|
|
||||||
((match-extract-vars (p . q) k i v)
|
|
||||||
(match-extract-vars p (match-extract-vars-step q k i v) i ()))
|
|
||||||
((match-extract-vars #(p ...) . x)
|
|
||||||
(match-extract-vars (p ...) . x))
|
|
||||||
((match-extract-vars _ (k ...) i v) (k ... v))
|
|
||||||
((match-extract-vars ___ (k ...) i v) (k ... v))
|
|
||||||
((match-extract-vars *** (k ...) i v) (k ... v))
|
|
||||||
((match-extract-vars ..1 (k ...) i v) (k ... v))
|
|
||||||
;; This is the main part, the only place where we might add a new
|
|
||||||
;; var if it's an unbound symbol.
|
|
||||||
((match-extract-vars p (k ...) (i ...) v)
|
|
||||||
(let-syntax
|
|
||||||
((new-sym?
|
|
||||||
(syntax-rules (i ...)
|
|
||||||
((new-sym? p sk fk) sk)
|
|
||||||
((new-sym? any sk fk) fk))))
|
|
||||||
(new-sym? random-sym-to-match
|
|
||||||
(k ... ((p p-ls) . v))
|
|
||||||
(k ... v))))
|
|
||||||
))
|
|
||||||
|
|
||||||
;; Stepper used in the above so it can expand the CAR and CDR
|
|
||||||
;; separately.
|
|
||||||
|
|
||||||
(define-syntax match-extract-vars-step
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ p k i v ((v2 v2-ls) ...))
|
|
||||||
(match-extract-vars p k (v2 ... . i) ((v2 v2-ls) ... . v)))
|
|
||||||
))
|
|
||||||
|
|
||||||
(define-syntax match-extract-quasiquote-vars
|
|
||||||
(syntax-rules (quasiquote unquote unquote-splicing)
|
|
||||||
((match-extract-quasiquote-vars (quasiquote x) k i v d)
|
|
||||||
(match-extract-quasiquote-vars x k i v (#t . d)))
|
|
||||||
((match-extract-quasiquote-vars (unquote-splicing x) k i v d)
|
|
||||||
(match-extract-quasiquote-vars (unquote x) k i v d))
|
|
||||||
((match-extract-quasiquote-vars (unquote x) k i v (#t))
|
|
||||||
(match-extract-vars x k i v))
|
|
||||||
((match-extract-quasiquote-vars (unquote x) k i v (#t . d))
|
|
||||||
(match-extract-quasiquote-vars x k i v d))
|
|
||||||
((match-extract-quasiquote-vars (x . y) k i v (#t . d))
|
|
||||||
(match-extract-quasiquote-vars
|
|
||||||
x
|
|
||||||
(match-extract-quasiquote-vars-step y k i v d) i ()))
|
|
||||||
((match-extract-quasiquote-vars #(x ...) k i v (#t . d))
|
|
||||||
(match-extract-quasiquote-vars (x ...) k i v d))
|
|
||||||
((match-extract-quasiquote-vars x (k ...) i v (#t . d))
|
|
||||||
(k ... v))
|
|
||||||
))
|
|
||||||
|
|
||||||
(define-syntax match-extract-quasiquote-vars-step
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ x k i v d ((v2 v2-ls) ...))
|
|
||||||
(match-extract-quasiquote-vars x k (v2 ... . i) ((v2 v2-ls) ... . v) d))
|
|
||||||
))
|
|
||||||
|
|
||||||
|
|
||||||
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
||||||
;; Gimme some sugar baby.
|
|
||||||
|
|
||||||
;;> Shortcut for @scheme{lambda} + @scheme{match}. Creates a
|
|
||||||
;;> procedure of one argument, and matches that argument against each
|
|
||||||
;;> clause.
|
|
||||||
|
|
||||||
(define-syntax match-lambda
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ (pattern . body) ...) (lambda (expr) (match expr (pattern . body) ...)))))
|
|
||||||
|
|
||||||
;;> Similar to @scheme{match-lambda}. Creates a procedure of any
|
|
||||||
;;> number of arguments, and matches the argument list against each
|
|
||||||
;;> clause.
|
|
||||||
|
|
||||||
(define-syntax match-lambda*
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ (pattern . body) ...) (lambda expr (match expr (pattern . body) ...)))))
|
|
||||||
|
|
||||||
;;> Matches each var to the corresponding expression, and evaluates
|
|
||||||
;;> the body with all match variables in scope. Raises an error if
|
|
||||||
;;> any of the expressions fail to match. Syntax analogous to named
|
|
||||||
;;> let can also be used for recursive functions which match on their
|
|
||||||
;;> arguments as in @scheme{match-lambda*}.
|
|
||||||
|
|
||||||
(define-syntax match-let
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ ((var value) ...) . body)
|
|
||||||
(match-let/helper let () () ((var value) ...) . body))
|
|
||||||
((_ loop ((var init) ...) . body)
|
|
||||||
(match-named-let loop ((var init) ...) . body))))
|
|
||||||
|
|
||||||
;;> Similar to @scheme{match-let}, but analogously to @scheme{letrec}
|
|
||||||
;;> matches and binds the variables with all match variables in scope.
|
|
||||||
|
|
||||||
(define-syntax match-letrec
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ ((var value) ...) . body)
|
|
||||||
(match-let/helper letrec () () ((var value) ...) . body))))
|
|
||||||
|
|
||||||
(define-syntax match-let/helper
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ let ((var expr) ...) () () . body)
|
|
||||||
(let ((var expr) ...) . body))
|
|
||||||
((_ let ((var expr) ...) ((pat tmp) ...) () . body)
|
|
||||||
(let ((var expr) ...)
|
|
||||||
(match-let* ((pat tmp) ...)
|
|
||||||
. body)))
|
|
||||||
((_ let (v ...) (p ...) (((a . b) expr) . rest) . body)
|
|
||||||
(match-let/helper
|
|
||||||
let (v ... (tmp expr)) (p ... ((a . b) tmp)) rest . body))
|
|
||||||
((_ let (v ...) (p ...) ((#(a ...) expr) . rest) . body)
|
|
||||||
(match-let/helper
|
|
||||||
let (v ... (tmp expr)) (p ... (#(a ...) tmp)) rest . body))
|
|
||||||
((_ let (v ...) (p ...) ((a expr) . rest) . body)
|
|
||||||
(match-let/helper let (v ... (a expr)) (p ...) rest . body))))
|
|
||||||
|
|
||||||
(define-syntax match-named-let
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ loop ((pat expr var) ...) () . body)
|
|
||||||
(let loop ((var expr) ...)
|
|
||||||
(match-let ((pat var) ...)
|
|
||||||
. body)))
|
|
||||||
((_ loop (v ...) ((pat expr) . rest) . body)
|
|
||||||
(match-named-let loop (v ... (pat expr tmp)) rest . body))))
|
|
||||||
|
|
||||||
;;> @subsubsubsection{@rawcode{(match-let* ((var value) ...) body ...)}}
|
|
||||||
|
|
||||||
;;> Similar to @scheme{match-let}, but analogously to @scheme{let*}
|
|
||||||
;;> matches and binds the variables in sequence, with preceding match
|
|
||||||
;;> variables in scope.
|
|
||||||
|
|
||||||
(define-syntax match-let*
|
|
||||||
(syntax-rules ()
|
|
||||||
((_ () . body)
|
|
||||||
(begin . body))
|
|
||||||
((_ ((pat expr) . rest) . body)
|
|
||||||
(match expr (pat (match-let* rest . body))))))
|
|
||||||
|
|
||||||
|
|
||||||
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
|
||||||
;; Otherwise COND-EXPANDed bits.
|
|
||||||
|
|
||||||
;; This *should* work, but doesn't :(
|
|
||||||
;; (define-syntax match-check-ellipse
|
|
||||||
;; (syntax-rules (...)
|
|
||||||
;; ((_ ... sk fk) sk)
|
|
||||||
;; ((_ x sk fk) fk)))
|
|
||||||
|
|
||||||
;; This is a little more complicated, and introduces a new let-syntax,
|
|
||||||
;; but should work portably in any R[56]RS Scheme. Taylor Campbell
|
|
||||||
;; originally came up with the idea.
|
|
||||||
(define-syntax match-check-ellipse
|
|
||||||
(syntax-rules ()
|
|
||||||
;; these two aren't necessary but provide fast-case failures
|
|
||||||
((match-check-ellipse (a . b) success-k failure-k) failure-k)
|
|
||||||
((match-check-ellipse #(a ...) success-k failure-k) failure-k)
|
|
||||||
;; matching an atom
|
|
||||||
((match-check-ellipse id success-k failure-k)
|
|
||||||
(let-syntax ((ellipse? (syntax-rules ()
|
|
||||||
;; iff `id' is `...' here then this will
|
|
||||||
;; match a list of any length
|
|
||||||
((ellipse? (foo id) sk fk) sk)
|
|
||||||
((ellipse? other sk fk) fk))))
|
|
||||||
;; this list of three elements will only many the (foo id) list
|
|
||||||
;; above if `id' is `...'
|
|
||||||
(ellipse? (a b c) success-k failure-k)))))
|
|
||||||
|
|
||||||
;; This is portable but can be more efficient with non-portable
|
|
||||||
;; extensions. This trick was originally discovered by Oleg Kiselyov.
|
|
||||||
|
|
||||||
(define-syntax match-check-identifier
|
|
||||||
(syntax-rules ()
|
|
||||||
;; fast-case failures, lists and vectors are not identifiers
|
|
||||||
((_ (x . y) success-k failure-k) failure-k)
|
|
||||||
((_ #(x ...) success-k failure-k) failure-k)
|
|
||||||
;; x is an atom
|
|
||||||
((_ x success-k failure-k)
|
|
||||||
(let-syntax
|
|
||||||
((sym?
|
|
||||||
(syntax-rules ()
|
|
||||||
;; if the symbol `abracadabra' matches x, then x is a
|
|
||||||
;; symbol
|
|
||||||
((sym? x sk fk) sk)
|
|
||||||
;; otherwise x is a non-symbol datum
|
|
||||||
((sym? y sk fk) fk))))
|
|
||||||
(sym? abracadabra success-k failure-k)))))
|
|
||||||
|
|
|
||||||
934
module/mes/match.upstream.mes
Normal file
934
module/mes/match.upstream.mes
Normal file
|
|
@ -0,0 +1,934 @@
|
||||||
|
;;; match.scm -- portable hygienic pattern matcher -*- coding: utf-8; mode: scheme -*-
|
||||||
|
;;
|
||||||
|
;; This code is written by Alex Shinn and placed in the
|
||||||
|
;; Public Domain. All warranties are disclaimed.
|
||||||
|
|
||||||
|
;;> @example-import[(srfi 9)]
|
||||||
|
|
||||||
|
;;> This is a full superset of the popular @hyperlink[
|
||||||
|
;;> "http://www.cs.indiana.edu/scheme-repository/code.match.html"]{match}
|
||||||
|
;;> package by Andrew Wright, written in fully portable @scheme{syntax-rules}
|
||||||
|
;;> and thus preserving hygiene.
|
||||||
|
|
||||||
|
;;> The most notable extensions are the ability to use @emph{non-linear}
|
||||||
|
;;> patterns - patterns in which the same identifier occurs multiple
|
||||||
|
;;> times, tail patterns after ellipsis, and the experimental tree patterns.
|
||||||
|
|
||||||
|
;;> @subsubsection{Patterns}
|
||||||
|
|
||||||
|
;;> Patterns are written to look like the printed representation of
|
||||||
|
;;> the objects they match. The basic usage is
|
||||||
|
|
||||||
|
;;> @scheme{(match expr (pat body ...) ...)}
|
||||||
|
|
||||||
|
;;> where the result of @var{expr} is matched against each pattern in
|
||||||
|
;;> turn, and the corresponding body is evaluated for the first to
|
||||||
|
;;> succeed. Thus, a list of three elements matches a list of three
|
||||||
|
;;> elements.
|
||||||
|
|
||||||
|
;;> @example{(let ((ls (list 1 2 3))) (match ls ((1 2 3) #t)))}
|
||||||
|
|
||||||
|
;;> If no patterns match an error is signalled.
|
||||||
|
|
||||||
|
;;> Identifiers will match anything, and make the corresponding
|
||||||
|
;;> binding available in the body.
|
||||||
|
|
||||||
|
;;> @example{(match (list 1 2 3) ((a b c) b))}
|
||||||
|
|
||||||
|
;;> If the same identifier occurs multiple times, the first instance
|
||||||
|
;;> will match anything, but subsequent instances must match a value
|
||||||
|
;;> which is @scheme{equal?} to the first.
|
||||||
|
|
||||||
|
;;> @example{(match (list 1 2 1) ((a a b) 1) ((a b a) 2))}
|
||||||
|
|
||||||
|
;;> The special identifier @scheme{_} matches anything, no matter how
|
||||||
|
;;> many times it is used, and does not bind the result in the body.
|
||||||
|
|
||||||
|
;;> @example{(match (list 1 2 1) ((_ _ b) 1) ((a b a) 2))}
|
||||||
|
|
||||||
|
;;> To match a literal identifier (or list or any other literal), use
|
||||||
|
;;> @scheme{quote}.
|
||||||
|
|
||||||
|
;;> @example{(match 'a ('b 1) ('a 2))}
|
||||||
|
|
||||||
|
;;> Analogous to its normal usage in scheme, @scheme{quasiquote} can
|
||||||
|
;;> be used to quote a mostly literally matching object with selected
|
||||||
|
;;> parts unquoted.
|
||||||
|
|
||||||
|
;;> @example|{(match (list 1 2 3) (`(1 ,b ,c) (list b c)))}|
|
||||||
|
|
||||||
|
;;> Often you want to match any number of a repeated pattern. Inside
|
||||||
|
;;> a list pattern you can append @scheme{...} after an element to
|
||||||
|
;;> match zero or more of that pattern (like a regexp Kleene star).
|
||||||
|
|
||||||
|
;;> @example{(match (list 1 2) ((1 2 3 ...) #t))}
|
||||||
|
;;> @example{(match (list 1 2 3) ((1 2 3 ...) #t))}
|
||||||
|
;;> @example{(match (list 1 2 3 3 3) ((1 2 3 ...) #t))}
|
||||||
|
|
||||||
|
;;> Pattern variables matched inside the repeated pattern are bound to
|
||||||
|
;;> a list of each matching instance in the body.
|
||||||
|
|
||||||
|
;;> @example{(match (list 1 2) ((a b c ...) c))}
|
||||||
|
;;> @example{(match (list 1 2 3) ((a b c ...) c))}
|
||||||
|
;;> @example{(match (list 1 2 3 4 5) ((a b c ...) c))}
|
||||||
|
|
||||||
|
;;> More than one @scheme{...} may not be used in the same list, since
|
||||||
|
;;> this would require exponential backtracking in the general case.
|
||||||
|
;;> However, @scheme{...} need not be the final element in the list,
|
||||||
|
;;> and may be succeeded by a fixed number of patterns.
|
||||||
|
|
||||||
|
;;> @example{(match (list 1 2 3 4) ((a b c ... d e) c))}
|
||||||
|
;;> @example{(match (list 1 2 3 4 5) ((a b c ... d e) c))}
|
||||||
|
;;> @example{(match (list 1 2 3 4 5 6 7) ((a b c ... d e) c))}
|
||||||
|
|
||||||
|
;;> @scheme{___} is provided as an alias for @scheme{...} when it is
|
||||||
|
;;> inconvenient to use the ellipsis (as in a syntax-rules template).
|
||||||
|
|
||||||
|
;;> The @scheme{..1} syntax is exactly like the @scheme{...} except
|
||||||
|
;;> that it matches one or more repetitions (like a regexp "+").
|
||||||
|
|
||||||
|
;;> @example{(match (list 1 2) ((a b c ..1) c))}
|
||||||
|
;;> @example{(match (list 1 2 3) ((a b c ..1) c))}
|
||||||
|
|
||||||
|
;;> The boolean operators @scheme{and}, @scheme{or} and @scheme{not}
|
||||||
|
;;> can be used to group and negate patterns analogously to their
|
||||||
|
;;> Scheme counterparts.
|
||||||
|
|
||||||
|
;;> The @scheme{and} operator ensures that all subpatterns match.
|
||||||
|
;;> This operator is often used with the idiom @scheme{(and x pat)} to
|
||||||
|
;;> bind @var{x} to the entire value that matches @var{pat}
|
||||||
|
;;> (c.f. "as-patterns" in ML or Haskell). Another common use is in
|
||||||
|
;;> conjunction with @scheme{not} patterns to match a general case
|
||||||
|
;;> with certain exceptions.
|
||||||
|
|
||||||
|
;;> @example{(match 1 ((and) #t))}
|
||||||
|
;;> @example{(match 1 ((and x) x))}
|
||||||
|
;;> @example{(match 1 ((and x 1) x))}
|
||||||
|
|
||||||
|
;;> The @scheme{or} operator ensures that at least one subpattern
|
||||||
|
;;> matches. If the same identifier occurs in different subpatterns,
|
||||||
|
;;> it is matched independently. All identifiers from all subpatterns
|
||||||
|
;;> are bound if the @scheme{or} operator matches, but the binding is
|
||||||
|
;;> only defined for identifiers from the subpattern which matched.
|
||||||
|
|
||||||
|
;;> @example{(match 1 ((or) #t) (else #f))}
|
||||||
|
;;> @example{(match 1 ((or x) x))}
|
||||||
|
;;> @example{(match 1 ((or x 2) x))}
|
||||||
|
|
||||||
|
;;> The @scheme{not} operator succeeds if the given pattern doesn't
|
||||||
|
;;> match. None of the identifiers used are available in the body.
|
||||||
|
|
||||||
|
;;> @example{(match 1 ((not 2) #t))}
|
||||||
|
|
||||||
|
;;> The more general operator @scheme{?} can be used to provide a
|
||||||
|
;;> predicate. The usage is @scheme{(? predicate pat ...)} where
|
||||||
|
;;> @var{predicate} is a Scheme expression evaluating to a predicate
|
||||||
|
;;> called on the value to match, and any optional patterns after the
|
||||||
|
;;> predicate are then matched as in an @scheme{and} pattern.
|
||||||
|
|
||||||
|
;;> @example{(match 1 ((? odd? x) x))}
|
||||||
|
|
||||||
|
;;> The field operator @scheme{=} is used to extract an arbitrary
|
||||||
|
;;> field and match against it. It is useful for more complex or
|
||||||
|
;;> conditional destructuring that can't be more directly expressed in
|
||||||
|
;;> the pattern syntax. The usage is @scheme{(= field pat)}, where
|
||||||
|
;;> @var{field} can be any expression, and should result in a
|
||||||
|
;;> procedure of one argument, which is applied to the value to match
|
||||||
|
;;> to generate a new value to match against @var{pat}.
|
||||||
|
|
||||||
|
;;> Thus the pattern @scheme{(and (= car x) (= cdr y))} is equivalent
|
||||||
|
;;> to @scheme{(x . y)}, except it will result in an immediate error
|
||||||
|
;;> if the value isn't a pair.
|
||||||
|
|
||||||
|
;;> @example{(match '(1 . 2) ((= car x) x))}
|
||||||
|
;;> @example{(match 4 ((= sqrt x) x))}
|
||||||
|
|
||||||
|
;;> The record operator @scheme{$} is used as a concise way to match
|
||||||
|
;;> records defined by SRFI-9 (or SRFI-99). The usage is
|
||||||
|
;;> @scheme{($ rtd field ...)}, where @var{rtd} should be the record
|
||||||
|
;;> type descriptor specified as the first argument to
|
||||||
|
;;> @scheme{define-record-type}, and each @var{field} is a subpattern
|
||||||
|
;;> matched against the fields of the record in order. Not all fields
|
||||||
|
;;> must be present.
|
||||||
|
|
||||||
|
;;> @example{
|
||||||
|
;;> (let ()
|
||||||
|
;;> (define-record-type employee
|
||||||
|
;;> (make-employee name title)
|
||||||
|
;;> employee?
|
||||||
|
;;> (name get-name)
|
||||||
|
;;> (title get-title))
|
||||||
|
;;> (match (make-employee "Bob" "Doctor")
|
||||||
|
;;> (($ employee n t) (list t n))))
|
||||||
|
;;> }
|
||||||
|
|
||||||
|
;;> The @scheme{set!} and @scheme{get!} operators are used to bind an
|
||||||
|
;;> identifier to the setter and getter of a field, respectively. The
|
||||||
|
;;> setter is a procedure of one argument, which mutates the field to
|
||||||
|
;;> that argument. The getter is a procedure of no arguments which
|
||||||
|
;;> returns the current value of the field.
|
||||||
|
|
||||||
|
;;> @example{(let ((x (cons 1 2))) (match x ((1 . (set! s)) (s 3) x)))}
|
||||||
|
;;> @example{(match '(1 . 2) ((1 . (get! g)) (g)))}
|
||||||
|
|
||||||
|
;;> The new operator @scheme{***} can be used to search a tree for
|
||||||
|
;;> subpatterns. A pattern of the form @scheme{(x *** y)} represents
|
||||||
|
;;> the subpattern @var{y} located somewhere in a tree where the path
|
||||||
|
;;> from the current object to @var{y} can be seen as a list of the
|
||||||
|
;;> form @scheme{(x ...)}. @var{y} can immediately match the current
|
||||||
|
;;> object in which case the path is the empty list. In a sense it's
|
||||||
|
;;> a 2-dimensional version of the @scheme{...} pattern.
|
||||||
|
|
||||||
|
;;> As a common case the pattern @scheme{(_ *** y)} can be used to
|
||||||
|
;;> search for @var{y} anywhere in a tree, regardless of the path
|
||||||
|
;;> used.
|
||||||
|
|
||||||
|
;;> @example{(match '(a (a (a b))) ((x *** 'b) x))}
|
||||||
|
;;> @example{(match '(a (b) (c (d e) (f g))) ((x *** 'g) x))}
|
||||||
|
|
||||||
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
||||||
|
;; Notes
|
||||||
|
|
||||||
|
;; The implementation is a simple generative pattern matcher - each
|
||||||
|
;; pattern is expanded into the required tests, calling a failure
|
||||||
|
;; continuation if the tests fail. This makes the logic easy to
|
||||||
|
;; follow and extend, but produces sub-optimal code in cases where you
|
||||||
|
;; have many similar clauses due to repeating the same tests.
|
||||||
|
;; Nonetheless a smart compiler should be able to remove the redundant
|
||||||
|
;; tests. For MATCH-LET and DESTRUCTURING-BIND type uses there is no
|
||||||
|
;; performance hit.
|
||||||
|
|
||||||
|
;; The original version was written on 2006/11/29 and described in the
|
||||||
|
;; following Usenet post:
|
||||||
|
;; http://groups.google.com/group/comp.lang.scheme/msg/0941234de7112ffd
|
||||||
|
;; and is still available at
|
||||||
|
;; http://synthcode.com/scheme/match-simple.scm
|
||||||
|
;; It's just 80 lines for the core MATCH, and an extra 40 lines for
|
||||||
|
;; MATCH-LET, MATCH-LAMBDA and other syntactic sugar.
|
||||||
|
;;
|
||||||
|
;; A variant of this file which uses COND-EXPAND in a few places for
|
||||||
|
;; performance can be found at
|
||||||
|
;; http://synthcode.com/scheme/match-cond-expand.scm
|
||||||
|
;;
|
||||||
|
;; 2012/05/23 - fixing combinatorial explosion of code in certain or patterns
|
||||||
|
;; 2011/09/25 - fixing bug when directly matching an identifier repeated in
|
||||||
|
;; the pattern (thanks to Stefan Israelsson Tampe)
|
||||||
|
;; 2011/01/27 - fixing bug when matching tail patterns against improper lists
|
||||||
|
;; 2010/09/26 - adding `..1' patterns (thanks to Ludovic Courtès)
|
||||||
|
;; 2010/09/07 - fixing identifier extraction in some `...' and `***' patterns
|
||||||
|
;; 2009/11/25 - adding `***' tree search patterns
|
||||||
|
;; 2008/03/20 - fixing bug where (a ...) matched non-lists
|
||||||
|
;; 2008/03/15 - removing redundant check in vector patterns
|
||||||
|
;; 2008/03/06 - you can use `...' portably now (thanks to Taylor Campbell)
|
||||||
|
;; 2007/09/04 - fixing quasiquote patterns
|
||||||
|
;; 2007/07/21 - allowing ellipse patterns in non-final list positions
|
||||||
|
;; 2007/04/10 - fixing potential hygiene issue in match-check-ellipse
|
||||||
|
;; (thanks to Taylor Campbell)
|
||||||
|
;; 2007/04/08 - clean up, commenting
|
||||||
|
;; 2006/12/24 - bugfixes
|
||||||
|
;; 2006/12/01 - non-linear patterns, shared variables in OR, get!/set!
|
||||||
|
|
||||||
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
||||||
|
;; force compile-time syntax errors with useful messages
|
||||||
|
|
||||||
|
(define-syntax match-syntax-error
|
||||||
|
(syntax-rules ()
|
||||||
|
((_) (match-syntax-error "invalid match-syntax-error usage"))))
|
||||||
|
|
||||||
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
||||||
|
|
||||||
|
;;> @subsubsection{Syntax}
|
||||||
|
|
||||||
|
;;> @subsubsubsection{@rawcode{(match expr (pattern . body) ...)@br{}
|
||||||
|
;;> (match expr (pattern (=> failure) . body) ...)}}
|
||||||
|
|
||||||
|
;;> The result of @var{expr} is matched against each @var{pattern} in
|
||||||
|
;;> turn, according to the pattern rules described in the previous
|
||||||
|
;;> section, until the the first @var{pattern} matches. When a match is
|
||||||
|
;;> found, the corresponding @var{body}s are evaluated in order,
|
||||||
|
;;> and the result of the last expression is returned as the result
|
||||||
|
;;> of the entire @scheme{match}. If a @var{failure} is provided,
|
||||||
|
;;> then it is bound to a procedure of no arguments which continues,
|
||||||
|
;;> processing at the next @var{pattern}. If no @var{pattern} matches,
|
||||||
|
;;> an error is signalled.
|
||||||
|
|
||||||
|
;; The basic interface. MATCH just performs some basic syntax
|
||||||
|
;; validation, binds the match expression to a temporary variable `v',
|
||||||
|
;; and passes it on to MATCH-NEXT. It's a constant throughout the
|
||||||
|
;; code below that the binding `v' is a direct variable reference, not
|
||||||
|
;; an expression.
|
||||||
|
|
||||||
|
(define-syntax match
|
||||||
|
(syntax-rules ()
|
||||||
|
((match)
|
||||||
|
(match-syntax-error "missing match expression"))
|
||||||
|
((match atom)
|
||||||
|
(match-syntax-error "no match clauses"))
|
||||||
|
((match (app ...) (pat . body) ...)
|
||||||
|
(let ((v (app ...)))
|
||||||
|
(match-next v ((app ...) (set! (app ...))) (pat . body) ...)))
|
||||||
|
((match #(vec ...) (pat . body) ...)
|
||||||
|
(let ((v #(vec ...)))
|
||||||
|
(match-next v (v (set! v)) (pat . body) ...)))
|
||||||
|
((match atom (pat . body) ...)
|
||||||
|
(let ((v atom))
|
||||||
|
(match-next v (atom (set! atom)) (pat . body) ...)))
|
||||||
|
))
|
||||||
|
|
||||||
|
;; MATCH-NEXT passes each clause to MATCH-ONE in turn with its failure
|
||||||
|
;; thunk, which is expanded by recursing MATCH-NEXT on the remaining
|
||||||
|
;; clauses. `g+s' is a list of two elements, the get! and set!
|
||||||
|
;; expressions respectively.
|
||||||
|
|
||||||
|
(define-syntax match-next
|
||||||
|
(syntax-rules (=>)
|
||||||
|
;; no more clauses, the match failed
|
||||||
|
((match-next v g+s)
|
||||||
|
;; Here we call error in non-tail context, so that the backtrace
|
||||||
|
;; can show the source location of the failing match form.
|
||||||
|
(begin
|
||||||
|
(error 'match "no matching pattern" v)
|
||||||
|
#f))
|
||||||
|
;; named failure continuation
|
||||||
|
((match-next v g+s (pat (=> failure) . body) . rest)
|
||||||
|
(let ((failure (lambda () (match-next v g+s . rest))))
|
||||||
|
;; match-one analyzes the pattern for us
|
||||||
|
(match-one v pat g+s (match-drop-ids (begin . body)) (failure) ())))
|
||||||
|
;; anonymous failure continuation, give it a dummy name
|
||||||
|
((match-next v g+s (pat . body) . rest)
|
||||||
|
(match-next v g+s (pat (=> failure) . body) . rest))))
|
||||||
|
|
||||||
|
;; MATCH-ONE first checks for ellipse patterns, otherwise passes on to
|
||||||
|
;; MATCH-TWO.
|
||||||
|
|
||||||
|
(define-syntax match-one
|
||||||
|
(syntax-rules ()
|
||||||
|
;; If it's a list of two or more values, check to see if the
|
||||||
|
;; second one is an ellipse and handle accordingly, otherwise go
|
||||||
|
;; to MATCH-TWO.
|
||||||
|
((match-one v (p q . r) g+s sk fk i)
|
||||||
|
(match-check-ellipse
|
||||||
|
q
|
||||||
|
(match-extract-vars p (match-gen-ellipses v p r g+s sk fk i) i ())
|
||||||
|
(match-two v (p q . r) g+s sk fk i)))
|
||||||
|
;; Go directly to MATCH-TWO.
|
||||||
|
((match-one . x)
|
||||||
|
(match-two . x))))
|
||||||
|
|
||||||
|
;; This is the guts of the pattern matcher. We are passed a lot of
|
||||||
|
;; information in the form:
|
||||||
|
;;
|
||||||
|
;; (match-two var pattern getter setter success-k fail-k (ids ...))
|
||||||
|
;;
|
||||||
|
;; usually abbreviated
|
||||||
|
;;
|
||||||
|
;; (match-two v p g+s sk fk i)
|
||||||
|
;;
|
||||||
|
;; where VAR is the symbol name of the current variable we are
|
||||||
|
;; matching, PATTERN is the current pattern, getter and setter are the
|
||||||
|
;; corresponding accessors (e.g. CAR and SET-CAR! of the pair holding
|
||||||
|
;; VAR), SUCCESS-K is the success continuation, FAIL-K is the failure
|
||||||
|
;; continuation (which is just a thunk call and is thus safe to expand
|
||||||
|
;; multiple times) and IDS are the list of identifiers bound in the
|
||||||
|
;; pattern so far.
|
||||||
|
|
||||||
|
(define-syntax match-two
|
||||||
|
(syntax-rules (_ ___ ..1 *** quote quasiquote ? $ = and or not set! get!)
|
||||||
|
((match-two v () g+s (sk ...) fk i)
|
||||||
|
(if (null? v) (sk ... i) fk))
|
||||||
|
((match-two v (quote p) g+s (sk ...) fk i)
|
||||||
|
(if (equal? v 'p) (sk ... i) fk))
|
||||||
|
((match-two v (quasiquote p) . x)
|
||||||
|
(match-quasiquote v p . x))
|
||||||
|
((match-two v (and) g+s (sk ...) fk i) (sk ... i))
|
||||||
|
((match-two v (and p q ...) g+s sk fk i)
|
||||||
|
(match-one v p g+s (match-one v (and q ...) g+s sk fk) fk i))
|
||||||
|
((match-two v (or) g+s sk fk i) fk)
|
||||||
|
((match-two v (or p) . x)
|
||||||
|
(match-one v p . x))
|
||||||
|
((match-two v (or p ...) g+s sk fk i)
|
||||||
|
(match-extract-vars (or p ...) (match-gen-or v (p ...) g+s sk fk i) i ()))
|
||||||
|
((match-two v (not p) g+s (sk ...) fk i)
|
||||||
|
(match-one v p g+s (match-drop-ids fk) (sk ... i) i))
|
||||||
|
((match-two v (get! getter) (g s) (sk ...) fk i)
|
||||||
|
(let ((getter (lambda () g))) (sk ... i)))
|
||||||
|
((match-two v (set! setter) (g (s ...)) (sk ...) fk i)
|
||||||
|
(let ((setter (lambda (x) (s ... x)))) (sk ... i)))
|
||||||
|
((match-two v (? pred . p) g+s sk fk i)
|
||||||
|
(if (pred v) (match-one v (and . p) g+s sk fk i) fk))
|
||||||
|
((match-two v (= proc p) . x)
|
||||||
|
(let ((w (proc v))) (match-one w p . x))
|
||||||
|
;;(let ((W (proc v))) (match-one W p . x))
|
||||||
|
)
|
||||||
|
((match-two v (p ___ . r) g+s sk fk i)
|
||||||
|
(match-extract-vars p (match-gen-ellipses v p r g+s sk fk i) i ()))
|
||||||
|
((match-two v (p) g+s sk fk i)
|
||||||
|
(if (and (pair? v) (null? (cdr v)))
|
||||||
|
(let ;;((w (car v)))
|
||||||
|
((W (car v)))
|
||||||
|
;;(match-one w p ((car v) (set-car! v)) sk fk i)
|
||||||
|
(match-one W p ((car v) (set-car! v)) sk fk i)
|
||||||
|
)
|
||||||
|
fk))
|
||||||
|
((match-two v (p *** q) g+s sk fk i)
|
||||||
|
(match-extract-vars p (match-gen-search v p q g+s sk fk i) i ()))
|
||||||
|
((match-two v (p *** . q) g+s sk fk i)
|
||||||
|
(match-syntax-error "invalid use of ***" (p *** . q)))
|
||||||
|
((match-two v (p ..1) g+s sk fk i)
|
||||||
|
(if (pair? v)
|
||||||
|
(match-one v (p ___) g+s sk fk i)
|
||||||
|
fk))
|
||||||
|
((match-two v ($ rec p ...) g+s sk fk i)
|
||||||
|
(if (is-a? v rec)
|
||||||
|
(match-record-refs v rec 0 (p ...) g+s sk fk i)
|
||||||
|
fk))
|
||||||
|
((match-two v (p . q) g+s sk fk i)
|
||||||
|
(if (pair? v)
|
||||||
|
(let ;;((w (car v)) (x (cdr v)))
|
||||||
|
((W (car v)) (X (cdr v)))
|
||||||
|
(match-one ;;w p ((car v) (set-car! v))
|
||||||
|
W p ((car v) (set-car! v))
|
||||||
|
;;(match-one x q ((cdr v) (set-cdr! v)) sk fk)
|
||||||
|
(match-one X q ((cdr v) (set-cdr! v)) sk fk)
|
||||||
|
fk
|
||||||
|
i))
|
||||||
|
fk))
|
||||||
|
((match-two v #(p ...) g+s . x)
|
||||||
|
(match-vector v 0 () (p ...) . x))
|
||||||
|
((match-two v _ g+s (sk ...) fk i) (sk ... i))
|
||||||
|
;; Not a pair or vector or special literal, test to see if it's a
|
||||||
|
;; new symbol, in which case we just bind it, or if it's an
|
||||||
|
;; already bound symbol or some other literal, in which case we
|
||||||
|
;; compare it with EQUAL?.
|
||||||
|
(;;(match-two v x g+s (sk ...) fk (id ...))
|
||||||
|
(match-two V X g+s (sk ...) fk (id ...))
|
||||||
|
(let-syntax
|
||||||
|
((new-sym?
|
||||||
|
(syntax-rules (id ...)
|
||||||
|
;;((new-sym? x sk2 fk2) sk2)
|
||||||
|
((new-sym? X sk2 fk2) sk2)
|
||||||
|
((new-sym? y sk2 fk2) fk2))))
|
||||||
|
(new-sym? random-sym-to-match
|
||||||
|
;;(let ((x v)) (sk ... (id ... x)))
|
||||||
|
(let ((X V)) (sk ... (id ... X)))
|
||||||
|
;;(if (equal? v x) (sk ... (id ...)) fk)
|
||||||
|
(if (equal? V X) (sk ... (id ...)) fk)
|
||||||
|
)))
|
||||||
|
))
|
||||||
|
|
||||||
|
;; QUASIQUOTE patterns
|
||||||
|
|
||||||
|
(define-syntax match-quasiquote
|
||||||
|
(syntax-rules (unquote unquote-splicing quasiquote)
|
||||||
|
((_ v (unquote p) g+s sk fk i)
|
||||||
|
(match-one v p g+s sk fk i))
|
||||||
|
((_ v ((unquote-splicing p) . rest) g+s sk fk i)
|
||||||
|
(if (pair? v)
|
||||||
|
(match-one v
|
||||||
|
(p . tmp)
|
||||||
|
(match-quasiquote tmp rest g+s sk fk)
|
||||||
|
fk
|
||||||
|
i)
|
||||||
|
fk))
|
||||||
|
((_ v (quasiquote p) g+s sk fk i . depth)
|
||||||
|
(match-quasiquote v p g+s sk fk i #f . depth))
|
||||||
|
((_ v (unquote p) g+s sk fk i x . depth)
|
||||||
|
(match-quasiquote v p g+s sk fk i . depth))
|
||||||
|
((_ v (unquote-splicing p) g+s sk fk i x . depth)
|
||||||
|
(match-quasiquote v p g+s sk fk i . depth))
|
||||||
|
((_ v (p . q) g+s sk fk i . depth)
|
||||||
|
(if (pair? v)
|
||||||
|
(let ;;((w (car v)) (x (cdr v)))
|
||||||
|
((W (car v)) (X (cdr v)))
|
||||||
|
(match-quasiquote
|
||||||
|
;;w p g+s
|
||||||
|
W p g+s
|
||||||
|
;;(match-quasiquote-step x q g+s sk fk depth)
|
||||||
|
(match-quasiquote-step X q g+s sk fk depth)
|
||||||
|
fk i . depth))
|
||||||
|
fk))
|
||||||
|
((_ v #(elt ...) g+s sk fk i . depth)
|
||||||
|
(if (vector? v)
|
||||||
|
(let ((ls (vector->list v)))
|
||||||
|
(match-quasiquote ls (elt ...) g+s sk fk i . depth))
|
||||||
|
fk))
|
||||||
|
((_ v x g+s sk fk i . depth)
|
||||||
|
(match-one v 'x g+s sk fk i))))
|
||||||
|
|
||||||
|
(define-syntax match-quasiquote-step
|
||||||
|
(syntax-rules ()
|
||||||
|
((match-quasiquote-step x q g+s sk fk depth i)
|
||||||
|
(match-quasiquote x q g+s sk fk i . depth))))
|
||||||
|
|
||||||
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
||||||
|
;; Utilities
|
||||||
|
|
||||||
|
;; Takes two values and just expands into the first.
|
||||||
|
(define-syntax match-drop-ids
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ expr ids ...) expr)))
|
||||||
|
|
||||||
|
(define-syntax match-tuck-ids
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ (letish args (expr ...)) ids ...)
|
||||||
|
(letish args (expr ... ids ...)))))
|
||||||
|
|
||||||
|
(define-syntax match-drop-first-arg
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ arg expr) expr)))
|
||||||
|
|
||||||
|
;; To expand an OR group we try each clause in succession, passing the
|
||||||
|
;; first that succeeds to the success continuation. On failure for
|
||||||
|
;; any clause, we just try the next clause, finally resorting to the
|
||||||
|
;; failure continuation fk if all clauses fail. The only trick is
|
||||||
|
;; that we want to unify the identifiers, so that the success
|
||||||
|
;; continuation can refer to a variable from any of the OR clauses.
|
||||||
|
|
||||||
|
(define-syntax match-gen-or
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ v p g+s (sk ...) fk (i ...) ((id id-ls) ...))
|
||||||
|
(let ((sk2 (lambda (id ...) (sk ... (i ... id ...)))))
|
||||||
|
(match-gen-or-step v p g+s (match-drop-ids (sk2 id ...)) fk (i ...))))))
|
||||||
|
|
||||||
|
(define-syntax match-gen-or-step
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ v () g+s sk fk . x)
|
||||||
|
;; no OR clauses, call the failure continuation
|
||||||
|
fk)
|
||||||
|
((_ v (p) . x)
|
||||||
|
;; last (or only) OR clause, just expand normally
|
||||||
|
(match-one v p . x))
|
||||||
|
((_ v (p . q) g+s sk fk i)
|
||||||
|
;; match one and try the remaining on failure
|
||||||
|
(let ((fk2 (lambda () (match-gen-or-step v q g+s sk fk i))))
|
||||||
|
(match-one v p g+s sk (fk2) i)))
|
||||||
|
))
|
||||||
|
|
||||||
|
;; We match a pattern (p ...) by matching the pattern p in a loop on
|
||||||
|
;; each element of the variable, accumulating the bound ids into lists.
|
||||||
|
|
||||||
|
;; Look at the body of the simple case - it's just a named let loop,
|
||||||
|
;; matching each element in turn to the same pattern. The only trick
|
||||||
|
;; is that we want to keep track of the lists of each extracted id, so
|
||||||
|
;; when the loop recurses we cons the ids onto their respective list
|
||||||
|
;; variables, and on success we bind the ids (what the user input and
|
||||||
|
;; expects to see in the success body) to the reversed accumulated
|
||||||
|
;; list IDs.
|
||||||
|
|
||||||
|
(define-syntax match-gen-ellipses
|
||||||
|
(syntax-rules ()
|
||||||
|
(;;(_ v p () g+s (sk ...) fk i ((id id-ls) ...))
|
||||||
|
(_ v P () g+s (sk ...) fk i ((id id-ls) ...))
|
||||||
|
(match-check-identifier
|
||||||
|
;;p
|
||||||
|
P
|
||||||
|
;; simplest case equivalent to (p ...), just bind the list
|
||||||
|
(let ;;((p v))
|
||||||
|
((P v))
|
||||||
|
(if ;;(list? p)
|
||||||
|
(list? P)
|
||||||
|
(sk ... i)
|
||||||
|
fk))
|
||||||
|
;; simple case, match all elements of the list
|
||||||
|
(let loop ((ls v) (id-ls '()) ...)
|
||||||
|
(cond
|
||||||
|
((null? ls)
|
||||||
|
(let ((id (reverse id-ls)) ...) (sk ... i)))
|
||||||
|
((pair? ls)
|
||||||
|
(let ;;((w (car ls)))
|
||||||
|
((W (car ls)))
|
||||||
|
(match-one ;;w p ((car ls) (set-car! ls))
|
||||||
|
W p ((car ls) (set-car! ls))
|
||||||
|
(match-drop-ids (loop (cdr ls) (cons id id-ls) ...))
|
||||||
|
fk i)))
|
||||||
|
(else
|
||||||
|
fk)))))
|
||||||
|
((_ v p r g+s (sk ...) fk i ((id id-ls) ...))
|
||||||
|
;; general case, trailing patterns to match, keep track of the
|
||||||
|
;; remaining list length so we don't need any backtracking
|
||||||
|
(match-verify-no-ellipses
|
||||||
|
r
|
||||||
|
(let* ((tail-len (length 'r))
|
||||||
|
(ls v)
|
||||||
|
(len (and (list? ls) (length ls))))
|
||||||
|
(if (or (not len) (< len tail-len))
|
||||||
|
fk
|
||||||
|
(let loop ((ls ls) (n len) (id-ls '()) ...)
|
||||||
|
(cond
|
||||||
|
((= n tail-len)
|
||||||
|
(let ((id (reverse id-ls)) ...)
|
||||||
|
(match-one ls r (#f #f) (sk ...) fk i)))
|
||||||
|
((pair? ls)
|
||||||
|
(let ((w (car ls)))
|
||||||
|
(match-one w p ((car ls) (set-car! ls))
|
||||||
|
(match-drop-ids
|
||||||
|
(loop (cdr ls) (- n 1) (cons id id-ls) ...))
|
||||||
|
fk
|
||||||
|
i)))
|
||||||
|
(else
|
||||||
|
fk)))))))))
|
||||||
|
|
||||||
|
;; This is just a safety check. Although unlike syntax-rules we allow
|
||||||
|
;; trailing patterns after an ellipses, we explicitly disable multiple
|
||||||
|
;; ellipses at the same level. This is because in the general case
|
||||||
|
;; such patterns are exponential in the number of ellipses, and we
|
||||||
|
;; don't want to make it easy to construct very expensive operations
|
||||||
|
;; with simple looking patterns. For example, it would be O(n^2) for
|
||||||
|
;; patterns like (a ... b ...) because we must consider every trailing
|
||||||
|
;; element for every possible break for the leading "a ...".
|
||||||
|
|
||||||
|
(define-syntax match-verify-no-ellipses
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ (x . y) sk)
|
||||||
|
(match-check-ellipse
|
||||||
|
x
|
||||||
|
(match-syntax-error
|
||||||
|
"multiple ellipse patterns not allowed at same level")
|
||||||
|
(match-verify-no-ellipses y sk)))
|
||||||
|
((_ () sk)
|
||||||
|
sk)
|
||||||
|
((_ x sk)
|
||||||
|
(match-syntax-error "dotted tail not allowed after ellipse" x))))
|
||||||
|
|
||||||
|
;; To implement the tree search, we use two recursive procedures. TRY
|
||||||
|
;; attempts to match Y once, and on success it calls the normal SK on
|
||||||
|
;; the accumulated list ids as in MATCH-GEN-ELLIPSES. On failure, we
|
||||||
|
;; call NEXT which first checks if the current value is a list
|
||||||
|
;; beginning with X, then calls TRY on each remaining element of the
|
||||||
|
;; list. Since TRY will recursively call NEXT again on failure, this
|
||||||
|
;; effects a full depth-first search.
|
||||||
|
;;
|
||||||
|
;; The failure continuation throughout is a jump to the next step in
|
||||||
|
;; the tree search, initialized with the original failure continuation
|
||||||
|
;; FK.
|
||||||
|
|
||||||
|
(define-syntax match-gen-search
|
||||||
|
(syntax-rules ()
|
||||||
|
((match-gen-search v p q g+s sk fk i ((id id-ls) ...))
|
||||||
|
(letrec ((try (lambda (w fail id-ls ...)
|
||||||
|
(match-one w q g+s
|
||||||
|
(match-tuck-ids
|
||||||
|
(let ((id (reverse id-ls)) ...)
|
||||||
|
sk))
|
||||||
|
(next w fail id-ls ...) i)))
|
||||||
|
(next (lambda (w fail id-ls ...)
|
||||||
|
(if (not (pair? w))
|
||||||
|
(fail)
|
||||||
|
(let ((u (car w)))
|
||||||
|
(match-one
|
||||||
|
u p ((car w) (set-car! w))
|
||||||
|
(match-drop-ids
|
||||||
|
;; accumulate the head variables from
|
||||||
|
;; the p pattern, and loop over the tail
|
||||||
|
(let ((id-ls (cons id id-ls)) ...)
|
||||||
|
(let lp ((ls (cdr w)))
|
||||||
|
(if (pair? ls)
|
||||||
|
(try (car ls)
|
||||||
|
(lambda () (lp (cdr ls)))
|
||||||
|
id-ls ...)
|
||||||
|
(fail)))))
|
||||||
|
(fail) i))))))
|
||||||
|
;; the initial id-ls binding here is a dummy to get the right
|
||||||
|
;; number of '()s
|
||||||
|
(let ((id-ls '()) ...)
|
||||||
|
(try v (lambda () fk) id-ls ...))))))
|
||||||
|
|
||||||
|
;; Vector patterns are just more of the same, with the slight
|
||||||
|
;; exception that we pass around the current vector index being
|
||||||
|
;; matched.
|
||||||
|
|
||||||
|
(define-syntax match-vector
|
||||||
|
(syntax-rules (___)
|
||||||
|
((_ v n pats (p q) . x)
|
||||||
|
(match-check-ellipse q
|
||||||
|
(match-gen-vector-ellipses v n pats p . x)
|
||||||
|
(match-vector-two v n pats (p q) . x)))
|
||||||
|
((_ v n pats (p ___) sk fk i)
|
||||||
|
(match-gen-vector-ellipses v n pats p sk fk i))
|
||||||
|
((_ . x)
|
||||||
|
(match-vector-two . x))))
|
||||||
|
|
||||||
|
;; Check the exact vector length, then check each element in turn.
|
||||||
|
|
||||||
|
(define-syntax match-vector-two
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ v n ((pat index) ...) () sk fk i)
|
||||||
|
(if (vector? v)
|
||||||
|
(let ((len (vector-length v)))
|
||||||
|
(if (= len n)
|
||||||
|
(match-vector-step v ((pat index) ...) sk fk i)
|
||||||
|
fk))
|
||||||
|
fk))
|
||||||
|
((_ v n (pats ...) (p . q) . x)
|
||||||
|
(match-vector v (+ n 1) (pats ... (p n)) q . x))))
|
||||||
|
|
||||||
|
(define-syntax match-vector-step
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ v () (sk ...) fk i) (sk ... i))
|
||||||
|
((_ v ((pat index) . rest) sk fk i)
|
||||||
|
(let ((w (vector-ref v index)))
|
||||||
|
(match-one w pat ((vector-ref v index) (vector-set! v index))
|
||||||
|
(match-vector-step v rest sk fk)
|
||||||
|
fk i)))))
|
||||||
|
|
||||||
|
;; With a vector ellipse pattern we first check to see if the vector
|
||||||
|
;; length is at least the required length.
|
||||||
|
|
||||||
|
(define-syntax match-gen-vector-ellipses
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ v n ((pat index) ...) p sk fk i)
|
||||||
|
(if (vector? v)
|
||||||
|
(let ((len (vector-length v)))
|
||||||
|
(if (>= len n)
|
||||||
|
(match-vector-step v ((pat index) ...)
|
||||||
|
(match-vector-tail v p n len sk fk)
|
||||||
|
fk i)
|
||||||
|
fk))
|
||||||
|
fk))))
|
||||||
|
|
||||||
|
(define-syntax match-vector-tail
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ v p n len sk fk i)
|
||||||
|
(match-extract-vars p (match-vector-tail-two v p n len sk fk i) i ()))))
|
||||||
|
|
||||||
|
(define-syntax match-vector-tail-two
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ v p n len (sk ...) fk i ((id id-ls) ...))
|
||||||
|
(let loop ((j n) (id-ls '()) ...)
|
||||||
|
(if (>= j len)
|
||||||
|
(let ((id (reverse id-ls)) ...) (sk ... i))
|
||||||
|
(let ((w (vector-ref v j)))
|
||||||
|
(match-one w p ((vector-ref v j) (vetor-set! v j))
|
||||||
|
(match-drop-ids (loop (+ j 1) (cons id id-ls) ...))
|
||||||
|
fk i)))))))
|
||||||
|
|
||||||
|
(define-syntax match-record-refs
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ v rec n (p . q) g+s sk fk i)
|
||||||
|
(let ((w (slot-ref rec v n)))
|
||||||
|
(match-one w p ((slot-ref rec v n) (slot-set! rec v n))
|
||||||
|
(match-record-refs v rec (+ n 1) q g+s sk fk) fk i)))
|
||||||
|
((_ v rec n () g+s (sk ...) fk i)
|
||||||
|
(sk ... i))))
|
||||||
|
|
||||||
|
;; Extract all identifiers in a pattern. A little more complicated
|
||||||
|
;; than just looking for symbols, we need to ignore special keywords
|
||||||
|
;; and non-pattern forms (such as the predicate expression in ?
|
||||||
|
;; patterns), and also ignore previously bound identifiers.
|
||||||
|
;;
|
||||||
|
;; Calls the continuation with all new vars as a list of the form
|
||||||
|
;; ((orig-var tmp-name) ...), where tmp-name can be used to uniquely
|
||||||
|
;; pair with the original variable (e.g. it's used in the ellipse
|
||||||
|
;; generation for list variables).
|
||||||
|
;;
|
||||||
|
;; (match-extract-vars pattern continuation (ids ...) (new-vars ...))
|
||||||
|
|
||||||
|
(define-syntax match-extract-vars
|
||||||
|
(syntax-rules (_ ___ ..1 *** ? $ = quote quasiquote and or not get! set!)
|
||||||
|
((match-extract-vars (? pred . p) . x)
|
||||||
|
(match-extract-vars p . x))
|
||||||
|
((match-extract-vars ($ rec . p) . x)
|
||||||
|
(match-extract-vars p . x))
|
||||||
|
((match-extract-vars (= proc p) . x)
|
||||||
|
(match-extract-vars p . x))
|
||||||
|
((match-extract-vars (quote x) (k ...) i v)
|
||||||
|
(k ... v))
|
||||||
|
((match-extract-vars (quasiquote x) k i v)
|
||||||
|
(match-extract-quasiquote-vars x k i v (#t)))
|
||||||
|
((match-extract-vars (and . p) . x)
|
||||||
|
(match-extract-vars p . x))
|
||||||
|
((match-extract-vars (or . p) . x)
|
||||||
|
(match-extract-vars p . x))
|
||||||
|
((match-extract-vars (not . p) . x)
|
||||||
|
(match-extract-vars p . x))
|
||||||
|
;; A non-keyword pair, expand the CAR with a continuation to
|
||||||
|
;; expand the CDR.
|
||||||
|
((match-extract-vars (p q . r) k i v)
|
||||||
|
(match-check-ellipse
|
||||||
|
q
|
||||||
|
(match-extract-vars (p . r) k i v)
|
||||||
|
(match-extract-vars p (match-extract-vars-step (q . r) k i v) i ())))
|
||||||
|
((match-extract-vars (p . q) k i v)
|
||||||
|
(match-extract-vars p (match-extract-vars-step q k i v) i ()))
|
||||||
|
((match-extract-vars #(p ...) . x)
|
||||||
|
(match-extract-vars (p ...) . x))
|
||||||
|
((match-extract-vars _ (k ...) i v) (k ... v))
|
||||||
|
((match-extract-vars ___ (k ...) i v) (k ... v))
|
||||||
|
((match-extract-vars *** (k ...) i v) (k ... v))
|
||||||
|
((match-extract-vars ..1 (k ...) i v) (k ... v))
|
||||||
|
;; This is the main part, the only place where we might add a new
|
||||||
|
;; var if it's an unbound symbol.
|
||||||
|
((match-extract-vars p (k ...) (i ...) v)
|
||||||
|
(let-syntax
|
||||||
|
((new-sym?
|
||||||
|
(syntax-rules (i ...)
|
||||||
|
((new-sym? p sk fk) sk)
|
||||||
|
((new-sym? any sk fk) fk))))
|
||||||
|
(new-sym? random-sym-to-match
|
||||||
|
(k ... ((p p-ls) . v))
|
||||||
|
(k ... v))))
|
||||||
|
))
|
||||||
|
|
||||||
|
;; Stepper used in the above so it can expand the CAR and CDR
|
||||||
|
;; separately.
|
||||||
|
|
||||||
|
(define-syntax match-extract-vars-step
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ p k i v ((v2 v2-ls) ...))
|
||||||
|
(match-extract-vars p k (v2 ... . i) ((v2 v2-ls) ... . v)))
|
||||||
|
))
|
||||||
|
|
||||||
|
(define-syntax match-extract-quasiquote-vars
|
||||||
|
(syntax-rules (quasiquote unquote unquote-splicing)
|
||||||
|
((match-extract-quasiquote-vars (quasiquote x) k i v d)
|
||||||
|
(match-extract-quasiquote-vars x k i v (#t . d)))
|
||||||
|
((match-extract-quasiquote-vars (unquote-splicing x) k i v d)
|
||||||
|
(match-extract-quasiquote-vars (unquote x) k i v d))
|
||||||
|
((match-extract-quasiquote-vars (unquote x) k i v (#t))
|
||||||
|
(match-extract-vars x k i v))
|
||||||
|
((match-extract-quasiquote-vars (unquote x) k i v (#t . d))
|
||||||
|
(match-extract-quasiquote-vars x k i v d))
|
||||||
|
((match-extract-quasiquote-vars (x . y) k i v (#t . d))
|
||||||
|
(match-extract-quasiquote-vars
|
||||||
|
x
|
||||||
|
(match-extract-quasiquote-vars-step y k i v d) i ()))
|
||||||
|
((match-extract-quasiquote-vars #(x ...) k i v (#t . d))
|
||||||
|
(match-extract-quasiquote-vars (x ...) k i v d))
|
||||||
|
((match-extract-quasiquote-vars x (k ...) i v (#t . d))
|
||||||
|
(k ... v))
|
||||||
|
))
|
||||||
|
|
||||||
|
(define-syntax match-extract-quasiquote-vars-step
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ x k i v d ((v2 v2-ls) ...))
|
||||||
|
(match-extract-quasiquote-vars x k (v2 ... . i) ((v2 v2-ls) ... . v) d))
|
||||||
|
))
|
||||||
|
|
||||||
|
|
||||||
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
||||||
|
;; Gimme some sugar baby.
|
||||||
|
|
||||||
|
;;> Shortcut for @scheme{lambda} + @scheme{match}. Creates a
|
||||||
|
;;> procedure of one argument, and matches that argument against each
|
||||||
|
;;> clause.
|
||||||
|
|
||||||
|
(define-syntax match-lambda
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ (pattern . body) ...) (lambda (expr) (match expr (pattern . body) ...)))))
|
||||||
|
|
||||||
|
;;> Similar to @scheme{match-lambda}. Creates a procedure of any
|
||||||
|
;;> number of arguments, and matches the argument list against each
|
||||||
|
;;> clause.
|
||||||
|
|
||||||
|
(define-syntax match-lambda*
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ (pattern . body) ...) (lambda expr (match expr (pattern . body) ...)))))
|
||||||
|
|
||||||
|
;;> Matches each var to the corresponding expression, and evaluates
|
||||||
|
;;> the body with all match variables in scope. Raises an error if
|
||||||
|
;;> any of the expressions fail to match. Syntax analogous to named
|
||||||
|
;;> let can also be used for recursive functions which match on their
|
||||||
|
;;> arguments as in @scheme{match-lambda*}.
|
||||||
|
|
||||||
|
(define-syntax match-let
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ ((var value) ...) . body)
|
||||||
|
(match-let/helper let () () ((var value) ...) . body))
|
||||||
|
((_ loop ((var init) ...) . body)
|
||||||
|
(match-named-let loop ((var init) ...) . body))))
|
||||||
|
|
||||||
|
;;> Similar to @scheme{match-let}, but analogously to @scheme{letrec}
|
||||||
|
;;> matches and binds the variables with all match variables in scope.
|
||||||
|
|
||||||
|
(define-syntax match-letrec
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ ((var value) ...) . body)
|
||||||
|
(match-let/helper letrec () () ((var value) ...) . body))))
|
||||||
|
|
||||||
|
(define-syntax match-let/helper
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ let ((var expr) ...) () () . body)
|
||||||
|
(let ((var expr) ...) . body))
|
||||||
|
((_ let ((var expr) ...) ((pat tmp) ...) () . body)
|
||||||
|
(let ((var expr) ...)
|
||||||
|
(match-let* ((pat tmp) ...)
|
||||||
|
. body)))
|
||||||
|
((_ let (v ...) (p ...) (((a . b) expr) . rest) . body)
|
||||||
|
(match-let/helper
|
||||||
|
let (v ... (tmp expr)) (p ... ((a . b) tmp)) rest . body))
|
||||||
|
((_ let (v ...) (p ...) ((#(a ...) expr) . rest) . body)
|
||||||
|
(match-let/helper
|
||||||
|
let (v ... (tmp expr)) (p ... (#(a ...) tmp)) rest . body))
|
||||||
|
((_ let (v ...) (p ...) ((a expr) . rest) . body)
|
||||||
|
(match-let/helper let (v ... (a expr)) (p ...) rest . body))))
|
||||||
|
|
||||||
|
(define-syntax match-named-let
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ loop ((pat expr var) ...) () . body)
|
||||||
|
(let loop ((var expr) ...)
|
||||||
|
(match-let ((pat var) ...)
|
||||||
|
. body)))
|
||||||
|
((_ loop (v ...) ((pat expr) . rest) . body)
|
||||||
|
(match-named-let loop (v ... (pat expr tmp)) rest . body))))
|
||||||
|
|
||||||
|
;;> @subsubsubsection{@rawcode{(match-let* ((var value) ...) body ...)}}
|
||||||
|
|
||||||
|
;;> Similar to @scheme{match-let}, but analogously to @scheme{let*}
|
||||||
|
;;> matches and binds the variables in sequence, with preceding match
|
||||||
|
;;> variables in scope.
|
||||||
|
|
||||||
|
(define-syntax match-let*
|
||||||
|
(syntax-rules ()
|
||||||
|
((_ () . body)
|
||||||
|
(begin . body))
|
||||||
|
((_ ((pat expr) . rest) . body)
|
||||||
|
(match expr (pat (match-let* rest . body))))))
|
||||||
|
|
||||||
|
|
||||||
|
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
|
||||||
|
;; Otherwise COND-EXPANDed bits.
|
||||||
|
|
||||||
|
;; This *should* work, but doesn't :(
|
||||||
|
;; (define-syntax match-check-ellipse
|
||||||
|
;; (syntax-rules (...)
|
||||||
|
;; ((_ ... sk fk) sk)
|
||||||
|
;; ((_ x sk fk) fk)))
|
||||||
|
|
||||||
|
;; This is a little more complicated, and introduces a new let-syntax,
|
||||||
|
;; but should work portably in any R[56]RS Scheme. Taylor Campbell
|
||||||
|
;; originally came up with the idea.
|
||||||
|
(define-syntax match-check-ellipse
|
||||||
|
(syntax-rules ()
|
||||||
|
;; these two aren't necessary but provide fast-case failures
|
||||||
|
((match-check-ellipse (a . b) success-k failure-k) failure-k)
|
||||||
|
((match-check-ellipse #(a ...) success-k failure-k) failure-k)
|
||||||
|
;; matching an atom
|
||||||
|
((match-check-ellipse id success-k failure-k)
|
||||||
|
(let-syntax ((ellipse? (syntax-rules ()
|
||||||
|
;; iff `id' is `...' here then this will
|
||||||
|
;; match a list of any length
|
||||||
|
((ellipse? (foo id) sk fk) sk)
|
||||||
|
((ellipse? other sk fk) fk))))
|
||||||
|
;; this list of three elements will only many the (foo id) list
|
||||||
|
;; above if `id' is `...'
|
||||||
|
(ellipse? (a b c) success-k failure-k)))))
|
||||||
|
|
||||||
|
;; This is portable but can be more efficient with non-portable
|
||||||
|
;; extensions. This trick was originally discovered by Oleg Kiselyov.
|
||||||
|
|
||||||
|
(define-syntax match-check-identifier
|
||||||
|
(syntax-rules ()
|
||||||
|
;; fast-case failures, lists and vectors are not identifiers
|
||||||
|
((_ (x . y) success-k failure-k) failure-k)
|
||||||
|
((_ #(x ...) success-k failure-k) failure-k)
|
||||||
|
;; x is an atom
|
||||||
|
((_ x success-k failure-k)
|
||||||
|
(let-syntax
|
||||||
|
((sym?
|
||||||
|
(syntax-rules ()
|
||||||
|
;; if the symbol `abracadabra' matches x, then x is a
|
||||||
|
;; symbol
|
||||||
|
((sym? x sk fk) sk)
|
||||||
|
;; otherwise x is a non-symbol datum
|
||||||
|
((sym? y sk fk) fk))))
|
||||||
|
(sym? abracadabra success-k failure-k)))))
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; mes-0.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
|
||||||
23
module/mes/psyntax.mes
Normal file
23
module/mes/psyntax.mes
Normal file
|
|
@ -0,0 +1,23 @@
|
||||||
|
;;; -*-scheme-*-
|
||||||
|
|
||||||
|
;;; Mes --- Maxwell Equations of Software
|
||||||
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
|
;;;
|
||||||
|
;;; This file is part of Mes.
|
||||||
|
;;;
|
||||||
|
;;; Mes 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 3 of the License, or (at
|
||||||
|
;;; your option) any later version.
|
||||||
|
;;;
|
||||||
|
;;; Mes 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 Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
(mes-use-module (mes psyntax-0))
|
||||||
|
(mes-use-module (mes psyntax-pp))
|
||||||
|
(mes-use-module (mes psyntax-1))
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; quasiquote.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -18,7 +18,16 @@
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(define-macro (slow...quasiquote x)
|
;;; Commentary:
|
||||||
|
|
||||||
|
;;; quasiquote.mes is loaded after base. It provides quasiquote
|
||||||
|
;;; written in Scheme.
|
||||||
|
|
||||||
|
;;; Code:
|
||||||
|
|
||||||
|
(mes-use-module (mes base))
|
||||||
|
|
||||||
|
(define-macro (quasiquote x)
|
||||||
(define (check x)
|
(define (check x)
|
||||||
(cond ((pair? (cdr x)) (cond ((null? (cddr x)))
|
(cond ((pair? (cdr x)) (cond ((null? (cddr x)))
|
||||||
(#t (error (car x) "invalid form ~s" x))))))
|
(#t (error (car x) "invalid form ~s" x))))))
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; record-0.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
|
||||||
|
|
@ -4,7 +4,7 @@
|
||||||
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees.
|
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees.
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; syntax.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; repl.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -24,6 +24,8 @@
|
||||||
|
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
|
||||||
|
(mes-use-module (mes scm))
|
||||||
|
|
||||||
(define welcome
|
(define welcome
|
||||||
"Mes 0.2
|
"Mes 0.2
|
||||||
Copyright (C) 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
Copyright (C) 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
|
|
@ -97,6 +99,7 @@ along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
,sc-expand SEXP - SC-expand SEXP
|
,sc-expand SEXP - SC-expand SEXP
|
||||||
,help - Show this help
|
,help - Show this help
|
||||||
,show TOPIC - Show info on TOPIC [c, w]
|
,show TOPIC - Show info on TOPIC [c, w]
|
||||||
|
,use MODULE - load MODULE
|
||||||
")
|
")
|
||||||
|
|
||||||
(define show-commands
|
(define show-commands
|
||||||
|
|
@ -130,18 +133,23 @@ along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
(display (sc-expand sexp))
|
(display (sc-expand sexp))
|
||||||
(newline)))
|
(newline)))
|
||||||
|
|
||||||
(define (help) (display help-commands))
|
(define (help . x) (display help-commands))
|
||||||
(define (show)
|
(define (show . x)
|
||||||
(define topic-alist `((#\newline . ,show-commands)
|
(define topic-alist `((#\newline . ,show-commands)
|
||||||
(#\c . ,copying)
|
(#\c . ,copying)
|
||||||
(#\w . ,warranty)))
|
(#\w . ,warranty)))
|
||||||
(let ((topic (read-char)))
|
(let ((topic (read-char)))
|
||||||
(display (assoc-ref topic-alist topic))))
|
(display (assoc-ref topic-alist topic))))
|
||||||
(define (meta command)
|
(define (use a)
|
||||||
|
(lambda ()
|
||||||
|
(let ((module (read-env (current-module))))
|
||||||
|
(mes-load-module-env module a))))
|
||||||
|
(define (meta command a)
|
||||||
(let ((command-alist `((expand . ,expand)
|
(let ((command-alist `((expand . ,expand)
|
||||||
(sc-expand . ,scexpand)
|
(sc-expand . ,scexpand)
|
||||||
(help . ,help)
|
(help . ,help)
|
||||||
(show . ,show))))
|
(show . ,show)
|
||||||
|
(use . ,(use a)))))
|
||||||
((or (assoc-ref command-alist command)
|
((or (assoc-ref command-alist command)
|
||||||
(lambda () #f)))))
|
(lambda () #f)))))
|
||||||
|
|
||||||
|
|
@ -156,16 +164,18 @@ along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
(display sexp)
|
(display sexp)
|
||||||
(display "]")
|
(display "]")
|
||||||
(newline))
|
(newline))
|
||||||
(if (and (pair? sexp) (eq? (car sexp) (string->symbol "unquote")))
|
(cond ((and (pair? sexp) (eq? (car sexp) (string->symbol "unquote")))
|
||||||
(begin
|
(let ((r (meta (cadr sexp) a)))
|
||||||
(meta (cadr sexp))
|
(if (pair? r) (loop (append r a))
|
||||||
(loop a))
|
(loop a))))
|
||||||
(let ((e (eval-env sexp a)))
|
((and (pair? sexp) (eq? (car sexp) 'mes-use-module))
|
||||||
(if (eq? e *unspecified*) (loop a)
|
(loop (mes-load-module-env (cadr sexp) a)))
|
||||||
(let ((id (string->symbol (string-append "$" (number->string count)))))
|
(else (let ((e (eval-env sexp a)))
|
||||||
(set! count (+ count 1))
|
(if (eq? e *unspecified*) (loop a)
|
||||||
(display id)
|
(let ((id (string->symbol (string-append "$" (number->string count)))))
|
||||||
(display " = ")
|
(set! count (+ count 1))
|
||||||
(display e)
|
(display id)
|
||||||
(newline)
|
(display " = ")
|
||||||
(loop (acons id e a)))))))))))
|
(display e)
|
||||||
|
(newline)
|
||||||
|
(loop (acons id e a))))))))))))
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; scm.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -26,6 +26,8 @@
|
||||||
|
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
|
||||||
|
(mes-use-module (mes let))
|
||||||
|
|
||||||
(define (cadddr x) (car (cdddr x)))
|
(define (cadddr x) (car (cdddr x)))
|
||||||
|
|
||||||
(define (list . rest) rest)
|
(define (list . rest) rest)
|
||||||
|
|
|
||||||
|
|
@ -1,10 +1,9 @@
|
||||||
;; -*-scheme-*-
|
;; -*-scheme-*-
|
||||||
|
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees.
|
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; syntax.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -26,6 +25,8 @@
|
||||||
;;; syntax-rules is adapted from scheme48-1.1/scheme/alt/syntax.scm
|
;;; syntax-rules is adapted from scheme48-1.1/scheme/alt/syntax.scm
|
||||||
|
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
(mes-use-module (mes scm))
|
||||||
|
(mes-use-module (mes syntax.upstream))
|
||||||
|
|
||||||
(define (syntax-error message thing)
|
(define (syntax-error message thing)
|
||||||
(display "syntax-error:" (current-error-port))
|
(display "syntax-error:" (current-error-port))
|
||||||
|
|
@ -37,229 +38,6 @@
|
||||||
(define (silent-syntax-error message thing)
|
(define (silent-syntax-error message thing)
|
||||||
*unspecified*)
|
*unspecified*)
|
||||||
|
|
||||||
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees. See file COPYING.
|
|
||||||
|
|
||||||
;;; scheme48-1.1/COPYING
|
|
||||||
|
|
||||||
;; Copyright (c) 1993-2004 Richard Kelsey and Jonathan Rees
|
|
||||||
;; All rights reserved.
|
|
||||||
|
|
||||||
;; Redistribution and use in source and binary forms, with or without
|
|
||||||
;; modification, are permitted provided that the following conditions
|
|
||||||
;; are met:
|
|
||||||
;; 1. Redistributions of source code must retain the above copyright
|
|
||||||
;; notice, this list of conditions and the following disclaimer.
|
|
||||||
;; 2. Redistributions in binary form must reproduce the above copyright
|
|
||||||
;; notice, this list of conditions and the following disclaimer in the
|
|
||||||
;; documentation and/or other materials provided with the distribution.
|
|
||||||
;; 3. The name of the authors may not be used to endorse or promote products
|
|
||||||
;; derived from this software without specific prior written permission.
|
|
||||||
|
|
||||||
;; THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
|
|
||||||
;; IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
||||||
;; OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
||||||
;; IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
||||||
;; INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
||||||
;; NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
||||||
;; DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
;; THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
;; (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
||||||
;; THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
|
|
||||||
|
|
||||||
(define-macro (define-syntax macro-name transformer . stuff)
|
|
||||||
`(define-macro (,macro-name . args)
|
|
||||||
(,transformer (cons ',macro-name args)
|
|
||||||
(lambda (x0) x0)
|
|
||||||
eq?)))
|
|
||||||
|
|
||||||
;; Rewrite-rule compiler (a.k.a. "extend-syntax")
|
|
||||||
|
|
||||||
;; Example:
|
|
||||||
;;
|
|
||||||
;; (define-syntax or
|
|
||||||
;; (syntax-rules ()
|
|
||||||
;; ((or) #f)
|
|
||||||
;; ((or e) e)
|
|
||||||
;; ((or e1 e ...) (let ((temp e1))
|
|
||||||
;; (if temp temp (or e ...))))))
|
|
||||||
|
|
||||||
(define-syntax syntax-rules
|
|
||||||
(let ()
|
|
||||||
(define name? symbol?)
|
|
||||||
|
|
||||||
(define (segment-pattern? pattern)
|
|
||||||
(and (segment-template? pattern)
|
|
||||||
(or (null? (cddr pattern))
|
|
||||||
(syntax-error "segment matching not implemented" pattern))))
|
|
||||||
|
|
||||||
(define (segment-template? pattern)
|
|
||||||
(and (pair? pattern)
|
|
||||||
(pair? (cdr pattern))
|
|
||||||
(memq (cadr pattern) indicators-for-zero-or-more)))
|
|
||||||
|
|
||||||
(define indicators-for-zero-or-more (list (string->symbol "...") '---))
|
|
||||||
|
|
||||||
(lambda (exp r c)
|
|
||||||
|
|
||||||
(define %input (r '%input)) ;Gensym these, if you like.
|
|
||||||
(define %compare (r '%compare))
|
|
||||||
(define %rename (r '%rename))
|
|
||||||
(define %tail (r '%tail))
|
|
||||||
(define %temp (r '%temp))
|
|
||||||
|
|
||||||
(define rules (cddr exp))
|
|
||||||
(define subkeywords (cadr exp))
|
|
||||||
|
|
||||||
(define (make-transformer rules)
|
|
||||||
`(lambda (,%input ,%rename ,%compare)
|
|
||||||
(let ((,%tail (cdr ,%input)))
|
|
||||||
(cond ,@(map process-rule rules)
|
|
||||||
(else
|
|
||||||
(syntax-error
|
|
||||||
"use of macro doesn't match definition"
|
|
||||||
,%input))))))
|
|
||||||
|
|
||||||
(define (process-rule rule)
|
|
||||||
(if (and (pair? rule)
|
|
||||||
(pair? (cdr rule))
|
|
||||||
(null? (cddr rule)))
|
|
||||||
(let ((pattern (cdar rule))
|
|
||||||
(template (cadr rule)))
|
|
||||||
`((and ,@(process-match %tail pattern))
|
|
||||||
(let* ,(process-pattern pattern
|
|
||||||
%tail
|
|
||||||
(lambda (x) x))
|
|
||||||
,(process-template template
|
|
||||||
0
|
|
||||||
(meta-variables pattern 0 '())))))
|
|
||||||
(syntax-error "ill-formed syntax rule" rule)))
|
|
||||||
|
|
||||||
;; Generate code to test whether input expression matches pattern
|
|
||||||
|
|
||||||
(define (process-match input pattern)
|
|
||||||
(cond ((name? pattern)
|
|
||||||
(if (member pattern subkeywords)
|
|
||||||
`((,%compare ,input (,%rename ',pattern)))
|
|
||||||
`()))
|
|
||||||
((segment-pattern? pattern)
|
|
||||||
(process-segment-match input (car pattern)))
|
|
||||||
((pair? pattern)
|
|
||||||
`((let ((,%temp ,input))
|
|
||||||
(and (pair? ,%temp)
|
|
||||||
,@(process-match `(car ,%temp) (car pattern))
|
|
||||||
,@(process-match `(cdr ,%temp) (cdr pattern))))))
|
|
||||||
((or (null? pattern) (boolean? pattern) (char? pattern))
|
|
||||||
`((eq? ,input ',pattern)))
|
|
||||||
(else
|
|
||||||
`((equal? ,input ',pattern)))))
|
|
||||||
|
|
||||||
(define (process-segment-match input pattern)
|
|
||||||
(let ((conjuncts (process-match '(car l) pattern)))
|
|
||||||
(if (null? conjuncts)
|
|
||||||
`((list? ,input)) ;+++
|
|
||||||
`((let loop ((l ,input))
|
|
||||||
(or (null? l)
|
|
||||||
(and (pair? l)
|
|
||||||
,@conjuncts
|
|
||||||
(loop (cdr l)))))))))
|
|
||||||
|
|
||||||
;; Generate code to take apart the input expression
|
|
||||||
;; This is pretty bad, but it seems to work (can't say why).
|
|
||||||
|
|
||||||
(define (process-pattern pattern path mapit)
|
|
||||||
(cond ((name? pattern)
|
|
||||||
(if (memq pattern subkeywords)
|
|
||||||
'()
|
|
||||||
(list (list pattern (mapit path)))))
|
|
||||||
((segment-pattern? pattern)
|
|
||||||
(process-pattern (car pattern)
|
|
||||||
%temp
|
|
||||||
(lambda (x) ;temp is free in x
|
|
||||||
(mapit (if (eq? %temp x)
|
|
||||||
path ;+++
|
|
||||||
`(map (lambda (,%temp) ,x)
|
|
||||||
,path))))))
|
|
||||||
((pair? pattern)
|
|
||||||
(append (process-pattern (car pattern) `(car ,path) mapit)
|
|
||||||
(process-pattern (cdr pattern) `(cdr ,path) mapit)))
|
|
||||||
(else '())))
|
|
||||||
|
|
||||||
;; Generate code to compose the output expression according to template
|
|
||||||
|
|
||||||
(define (process-template template rank env)
|
|
||||||
(cond ((name? template)
|
|
||||||
(let ((probe (assq template env)))
|
|
||||||
(if probe
|
|
||||||
(if (<= (cdr probe) rank)
|
|
||||||
template
|
|
||||||
(syntax-error "template rank error (too few ...'s?)"
|
|
||||||
template))
|
|
||||||
`(,%rename ',template))))
|
|
||||||
((segment-template? template)
|
|
||||||
(let ((vars
|
|
||||||
(free-meta-variables (car template) (+ rank 1) env '())))
|
|
||||||
(if (null? vars)
|
|
||||||
(silent-syntax-error "too many ...'s" template)
|
|
||||||
(let* ((x (process-template (car template)
|
|
||||||
(+ rank 1)
|
|
||||||
env))
|
|
||||||
(gen (if (equal? (list x) vars)
|
|
||||||
x ;+++
|
|
||||||
`(map (lambda ,vars ,x)
|
|
||||||
,@vars))))
|
|
||||||
(if (null? (cddr template))
|
|
||||||
gen ;+++
|
|
||||||
`(append ,gen ,(process-template (cddr template)
|
|
||||||
rank env)))))))
|
|
||||||
((pair? template)
|
|
||||||
`(cons ,(process-template (car template) rank env)
|
|
||||||
,(process-template (cdr template) rank env)))
|
|
||||||
(else `(quote ,template))))
|
|
||||||
|
|
||||||
;; Return an association list of (var . rank)
|
|
||||||
|
|
||||||
(define (meta-variables pattern rank vars)
|
|
||||||
(cond ((name? pattern)
|
|
||||||
(if (memq pattern subkeywords)
|
|
||||||
vars
|
|
||||||
(cons (cons pattern rank) vars)))
|
|
||||||
((segment-pattern? pattern)
|
|
||||||
(meta-variables (car pattern) (+ rank 1) vars))
|
|
||||||
((pair? pattern)
|
|
||||||
(meta-variables (car pattern) rank
|
|
||||||
(meta-variables (cdr pattern) rank vars)))
|
|
||||||
(else vars)))
|
|
||||||
|
|
||||||
;; Return a list of meta-variables of given higher rank
|
|
||||||
|
|
||||||
(define (free-meta-variables template rank env free)
|
|
||||||
(cond ((name? template)
|
|
||||||
(if (and (not (memq template free))
|
|
||||||
(let ((probe (assq template env)))
|
|
||||||
(and probe (>= (cdr probe) rank))))
|
|
||||||
(cons template free)
|
|
||||||
free))
|
|
||||||
((segment-template? template)
|
|
||||||
(free-meta-variables (car template)
|
|
||||||
rank env
|
|
||||||
(free-meta-variables (cddr template)
|
|
||||||
rank env free)))
|
|
||||||
((pair? template)
|
|
||||||
(free-meta-variables (car template)
|
|
||||||
rank env
|
|
||||||
(free-meta-variables (cdr template)
|
|
||||||
rank env free)))
|
|
||||||
(else free)))
|
|
||||||
|
|
||||||
c ;ignored
|
|
||||||
|
|
||||||
;; Kludge for Scheme48 linker.
|
|
||||||
;; `(cons ,(make-transformer rules)
|
|
||||||
;; ',(find-free-names-in-syntax-rules subkeywords rules))
|
|
||||||
|
|
||||||
(make-transformer rules))))
|
|
||||||
|
|
||||||
(define-macro (define-syntax-rule id-pattern . template)
|
(define-macro (define-syntax-rule id-pattern . template)
|
||||||
`(define-syntax ,(car id-pattern)
|
`(define-syntax ,(car id-pattern)
|
||||||
(syntax-rules ()
|
(syntax-rules ()
|
||||||
|
|
|
||||||
251
module/mes/syntax.upstream.mes
Normal file
251
module/mes/syntax.upstream.mes
Normal file
|
|
@ -0,0 +1,251 @@
|
||||||
|
;; -*-scheme-*-
|
||||||
|
|
||||||
|
;;; Mes --- Maxwell Equations of Software
|
||||||
|
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees.
|
||||||
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
|
;;;
|
||||||
|
;;; This file is part of Mes.
|
||||||
|
;;;
|
||||||
|
;;; Mes 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 3 of the License, or (at
|
||||||
|
;;; your option) any later version.
|
||||||
|
;;;
|
||||||
|
;;; Mes 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 Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
;;; Commentary:
|
||||||
|
|
||||||
|
;;; syntax.mes is loaded after scm.mes. It provides the R5RS hygienic
|
||||||
|
;;; macros define-syntax, syntax-rules and define-syntax-rule.
|
||||||
|
;;; syntax-rules is adapted from scheme48-1.1/scheme/alt/syntax.scm
|
||||||
|
|
||||||
|
;;; Code:
|
||||||
|
|
||||||
|
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees. See file COPYING.
|
||||||
|
|
||||||
|
;;; scheme48-1.1/COPYING
|
||||||
|
|
||||||
|
;; Copyright (c) 1993-2004 Richard Kelsey and Jonathan Rees
|
||||||
|
;; All rights reserved.
|
||||||
|
|
||||||
|
;; Redistribution and use in source and binary forms, with or without
|
||||||
|
;; modification, are permitted provided that the following conditions
|
||||||
|
;; are met:
|
||||||
|
;; 1. Redistributions of source code must retain the above copyright
|
||||||
|
;; notice, this list of conditions and the following disclaimer.
|
||||||
|
;; 2. Redistributions in binary form must reproduce the above copyright
|
||||||
|
;; notice, this list of conditions and the following disclaimer in the
|
||||||
|
;; documentation and/or other materials provided with the distribution.
|
||||||
|
;; 3. The name of the authors may not be used to endorse or promote products
|
||||||
|
;; derived from this software without specific prior written permission.
|
||||||
|
|
||||||
|
;; THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
|
||||||
|
;; IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||||
|
;; OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||||||
|
;; IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||||
|
;; INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
||||||
|
;; NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||||
|
;; DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||||
|
;; THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||||
|
;; (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
||||||
|
;; THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||||
|
|
||||||
|
|
||||||
|
(define-macro (define-syntax macro-name transformer . stuff)
|
||||||
|
`(define-macro (,macro-name . args)
|
||||||
|
(,transformer (cons ',macro-name args)
|
||||||
|
(lambda (x0) x0)
|
||||||
|
eq?)))
|
||||||
|
|
||||||
|
;; Rewrite-rule compiler (a.k.a. "extend-syntax")
|
||||||
|
|
||||||
|
;; Example:
|
||||||
|
;;
|
||||||
|
;; (define-syntax or
|
||||||
|
;; (syntax-rules ()
|
||||||
|
;; ((or) #f)
|
||||||
|
;; ((or e) e)
|
||||||
|
;; ((or e1 e ...) (let ((temp e1))
|
||||||
|
;; (if temp temp (or e ...))))))
|
||||||
|
|
||||||
|
(define-syntax syntax-rules
|
||||||
|
(let ()
|
||||||
|
(define name? symbol?)
|
||||||
|
|
||||||
|
(define (segment-pattern? pattern)
|
||||||
|
(and (segment-template? pattern)
|
||||||
|
(or (null? (cddr pattern))
|
||||||
|
(syntax-error "segment matching not implemented" pattern))))
|
||||||
|
|
||||||
|
(define (segment-template? pattern)
|
||||||
|
(and (pair? pattern)
|
||||||
|
(pair? (cdr pattern))
|
||||||
|
(memq (cadr pattern) indicators-for-zero-or-more)))
|
||||||
|
|
||||||
|
(define indicators-for-zero-or-more (list (string->symbol "...") '---))
|
||||||
|
|
||||||
|
(lambda (exp r c)
|
||||||
|
|
||||||
|
(define %input (r '%input)) ;Gensym these, if you like.
|
||||||
|
(define %compare (r '%compare))
|
||||||
|
(define %rename (r '%rename))
|
||||||
|
(define %tail (r '%tail))
|
||||||
|
(define %temp (r '%temp))
|
||||||
|
|
||||||
|
(define rules (cddr exp))
|
||||||
|
(define subkeywords (cadr exp))
|
||||||
|
|
||||||
|
(define (make-transformer rules)
|
||||||
|
`(lambda (,%input ,%rename ,%compare)
|
||||||
|
(let ((,%tail (cdr ,%input)))
|
||||||
|
(cond ,@(map process-rule rules)
|
||||||
|
(else
|
||||||
|
(syntax-error
|
||||||
|
"use of macro doesn't match definition"
|
||||||
|
,%input))))))
|
||||||
|
|
||||||
|
(define (process-rule rule)
|
||||||
|
(if (and (pair? rule)
|
||||||
|
(pair? (cdr rule))
|
||||||
|
(null? (cddr rule)))
|
||||||
|
(let ((pattern (cdar rule))
|
||||||
|
(template (cadr rule)))
|
||||||
|
`((and ,@(process-match %tail pattern))
|
||||||
|
(let* ,(process-pattern pattern
|
||||||
|
%tail
|
||||||
|
(lambda (x) x))
|
||||||
|
,(process-template template
|
||||||
|
0
|
||||||
|
(meta-variables pattern 0 '())))))
|
||||||
|
(syntax-error "ill-formed syntax rule" rule)))
|
||||||
|
|
||||||
|
;; Generate code to test whether input expression matches pattern
|
||||||
|
|
||||||
|
(define (process-match input pattern)
|
||||||
|
(cond ((name? pattern)
|
||||||
|
(if (member pattern subkeywords)
|
||||||
|
`((,%compare ,input (,%rename ',pattern)))
|
||||||
|
`()))
|
||||||
|
((segment-pattern? pattern)
|
||||||
|
(process-segment-match input (car pattern)))
|
||||||
|
((pair? pattern)
|
||||||
|
`((let ((,%temp ,input))
|
||||||
|
(and (pair? ,%temp)
|
||||||
|
,@(process-match `(car ,%temp) (car pattern))
|
||||||
|
,@(process-match `(cdr ,%temp) (cdr pattern))))))
|
||||||
|
((or (null? pattern) (boolean? pattern) (char? pattern))
|
||||||
|
`((eq? ,input ',pattern)))
|
||||||
|
(else
|
||||||
|
`((equal? ,input ',pattern)))))
|
||||||
|
|
||||||
|
(define (process-segment-match input pattern)
|
||||||
|
(let ((conjuncts (process-match '(car l) pattern)))
|
||||||
|
(if (null? conjuncts)
|
||||||
|
`((list? ,input)) ;+++
|
||||||
|
`((let loop ((l ,input))
|
||||||
|
(or (null? l)
|
||||||
|
(and (pair? l)
|
||||||
|
,@conjuncts
|
||||||
|
(loop (cdr l)))))))))
|
||||||
|
|
||||||
|
;; Generate code to take apart the input expression
|
||||||
|
;; This is pretty bad, but it seems to work (can't say why).
|
||||||
|
|
||||||
|
(define (process-pattern pattern path mapit)
|
||||||
|
(cond ((name? pattern)
|
||||||
|
(if (memq pattern subkeywords)
|
||||||
|
'()
|
||||||
|
(list (list pattern (mapit path)))))
|
||||||
|
((segment-pattern? pattern)
|
||||||
|
(process-pattern (car pattern)
|
||||||
|
%temp
|
||||||
|
(lambda (x) ;temp is free in x
|
||||||
|
(mapit (if (eq? %temp x)
|
||||||
|
path ;+++
|
||||||
|
`(map (lambda (,%temp) ,x)
|
||||||
|
,path))))))
|
||||||
|
((pair? pattern)
|
||||||
|
(append (process-pattern (car pattern) `(car ,path) mapit)
|
||||||
|
(process-pattern (cdr pattern) `(cdr ,path) mapit)))
|
||||||
|
(else '())))
|
||||||
|
|
||||||
|
;; Generate code to compose the output expression according to template
|
||||||
|
|
||||||
|
(define (process-template template rank env)
|
||||||
|
(cond ((name? template)
|
||||||
|
(let ((probe (assq template env)))
|
||||||
|
(if probe
|
||||||
|
(if (<= (cdr probe) rank)
|
||||||
|
template
|
||||||
|
(syntax-error "template rank error (too few ...'s?)"
|
||||||
|
template))
|
||||||
|
`(,%rename ',template))))
|
||||||
|
((segment-template? template)
|
||||||
|
(let ((vars
|
||||||
|
(free-meta-variables (car template) (+ rank 1) env '())))
|
||||||
|
(if (null? vars)
|
||||||
|
(silent-syntax-error "too many ...'s" template)
|
||||||
|
(let* ((x (process-template (car template)
|
||||||
|
(+ rank 1)
|
||||||
|
env))
|
||||||
|
(gen (if (equal? (list x) vars)
|
||||||
|
x ;+++
|
||||||
|
`(map (lambda ,vars ,x)
|
||||||
|
,@vars))))
|
||||||
|
(if (null? (cddr template))
|
||||||
|
gen ;+++
|
||||||
|
`(append ,gen ,(process-template (cddr template)
|
||||||
|
rank env)))))))
|
||||||
|
((pair? template)
|
||||||
|
`(cons ,(process-template (car template) rank env)
|
||||||
|
,(process-template (cdr template) rank env)))
|
||||||
|
(else `(quote ,template))))
|
||||||
|
|
||||||
|
;; Return an association list of (var . rank)
|
||||||
|
|
||||||
|
(define (meta-variables pattern rank vars)
|
||||||
|
(cond ((name? pattern)
|
||||||
|
(if (memq pattern subkeywords)
|
||||||
|
vars
|
||||||
|
(cons (cons pattern rank) vars)))
|
||||||
|
((segment-pattern? pattern)
|
||||||
|
(meta-variables (car pattern) (+ rank 1) vars))
|
||||||
|
((pair? pattern)
|
||||||
|
(meta-variables (car pattern) rank
|
||||||
|
(meta-variables (cdr pattern) rank vars)))
|
||||||
|
(else vars)))
|
||||||
|
|
||||||
|
;; Return a list of meta-variables of given higher rank
|
||||||
|
|
||||||
|
(define (free-meta-variables template rank env free)
|
||||||
|
(cond ((name? template)
|
||||||
|
(if (and (not (memq template free))
|
||||||
|
(let ((probe (assq template env)))
|
||||||
|
(and probe (>= (cdr probe) rank))))
|
||||||
|
(cons template free)
|
||||||
|
free))
|
||||||
|
((segment-template? template)
|
||||||
|
(free-meta-variables (car template)
|
||||||
|
rank env
|
||||||
|
(free-meta-variables (cddr template)
|
||||||
|
rank env free)))
|
||||||
|
((pair? template)
|
||||||
|
(free-meta-variables (car template)
|
||||||
|
rank env
|
||||||
|
(free-meta-variables (cdr template)
|
||||||
|
rank env free)))
|
||||||
|
(else free)))
|
||||||
|
|
||||||
|
c ;ignored
|
||||||
|
|
||||||
|
;; Kludge for Scheme48 linker.
|
||||||
|
;; `(cons ,(make-transformer rules)
|
||||||
|
;; ',(find-free-names-in-syntax-rules subkeywords rules))
|
||||||
|
|
||||||
|
(make-transformer rules))))
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; test.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,6 +25,7 @@
|
||||||
|
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
|
||||||
|
(mes-use-module (mes base))
|
||||||
(define guile? (not (pair? (current-module))))
|
(define guile? (not (pair? (current-module))))
|
||||||
|
|
||||||
(define result
|
(define result
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; type-0.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; bytevectors.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
|
||||||
|
|
@ -3,7 +3,7 @@
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; srfi-0.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -27,10 +27,9 @@
|
||||||
(define mes '(0 1))
|
(define mes '(0 1))
|
||||||
|
|
||||||
(define (cond-expand-expander clauses)
|
(define (cond-expand-expander clauses)
|
||||||
(let loop ((clauses clauses))
|
(if (defined? (caar clauses))
|
||||||
(if (defined? (caar clauses))
|
(cdar clauses)
|
||||||
(eval (cons 'begin (cdar clauses)) (current-module))
|
(cond-expand-expander (cdr clauses))))
|
||||||
(loop (cdr clauses)))))
|
|
||||||
|
|
||||||
(define-macro (cond-expand . clauses)
|
(define-macro (cond-expand . clauses)
|
||||||
`(cond-expand-expander (quote ,clauses)))
|
`(begin ,@(cond-expand-expander clauses)))
|
||||||
|
|
|
||||||
|
|
@ -1,10 +1,9 @@
|
||||||
;;; -*-scheme-*-
|
;;; -*-scheme-*-
|
||||||
|
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees.
|
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; base-0.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -21,80 +20,10 @@
|
||||||
|
|
||||||
;;; Commentary:
|
;;; Commentary:
|
||||||
|
|
||||||
;;; srfi-9.mes - records. Assumes record-0.mes and record.mes are
|
;;; srfi-9.mes - records.
|
||||||
;;; available. Modified from
|
|
||||||
;;; scheme48-1.1/scheme/alt/jar-defrecord.scm to implement SRFI-9.
|
|
||||||
|
|
||||||
;;; Code:
|
(mes-use-module (mes scm))
|
||||||
|
(mes-use-module (mes syntax))
|
||||||
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees. See file COPYING.
|
(mes-use-module (mes record-0))
|
||||||
|
(mes-use-module (mes record))
|
||||||
;;; scheme48-1.1/COPYING
|
(mes-use-module (srfi srfi-9.upstream))
|
||||||
|
|
||||||
;; Copyright (c) 1993-2004 Richard Kelsey and Jonathan Rees
|
|
||||||
;; All rights reserved.
|
|
||||||
|
|
||||||
;; Redistribution and use in source and binary forms, with or without
|
|
||||||
;; modification, are permitted provided that the following conditions
|
|
||||||
;; are met:
|
|
||||||
;; 1. Redistributions of source code must retain the above copyright
|
|
||||||
;; notice, this list of conditions and the following disclaimer.
|
|
||||||
;; 2. Redistributions in binary form must reproduce the above copyright
|
|
||||||
;; notice, this list of conditions and the following disclaimer in the
|
|
||||||
;; documentation and/or other materials provided with the distribution.
|
|
||||||
;; 3. The name of the authors may not be used to endorse or promote products
|
|
||||||
;; derived from this software without specific prior written permission.
|
|
||||||
|
|
||||||
;; THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
|
|
||||||
;; IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
||||||
;; OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
||||||
;; IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
||||||
;; INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
||||||
;; NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
||||||
;; DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
;; THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
;; (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
||||||
;; THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
|
|
||||||
; This is JAR's define-record-type, which doesn't resemble Richard's.
|
|
||||||
|
|
||||||
; There's no implicit name concatenation, so it can be defined
|
|
||||||
; entirely using syntax-rules. Example:
|
|
||||||
; (define-record-type foo :foo
|
|
||||||
; (make-foo x y)
|
|
||||||
; foo? - predicate name is optional
|
|
||||||
; (x foo-x)
|
|
||||||
; (y foo-y)
|
|
||||||
; (z foo-z set-foo-z!))
|
|
||||||
|
|
||||||
(define-syntax define-record-type
|
|
||||||
(syntax-rules ()
|
|
||||||
((define-record-type type
|
|
||||||
(constructor arg ...)
|
|
||||||
(field . field-stuff)
|
|
||||||
...)
|
|
||||||
(begin (define type (make-record-type 'type '(field ...)))
|
|
||||||
(define constructor (record-constructor type '(arg ...)))
|
|
||||||
(define-accessors type (field . field-stuff) ...)))
|
|
||||||
((define-record-type type
|
|
||||||
(constructor arg ...)
|
|
||||||
pred
|
|
||||||
more ...)
|
|
||||||
(begin (define-record-type type
|
|
||||||
(constructor arg ...)
|
|
||||||
more ...)
|
|
||||||
(define pred (record-predicate type))))))
|
|
||||||
|
|
||||||
;; Straightforward version
|
|
||||||
(define-syntax define-accessors
|
|
||||||
(syntax-rules ()
|
|
||||||
((define-accessors type field-spec ...)
|
|
||||||
(begin (define-accessor type . field-spec) ...))))
|
|
||||||
|
|
||||||
(define-syntax define-accessor
|
|
||||||
(syntax-rules ()
|
|
||||||
((define-accessor type field accessor)
|
|
||||||
(define accessor (record-accessor type 'field)))
|
|
||||||
((define-accessor type field accessor modifier)
|
|
||||||
(begin (define accessor (record-accessor type 'field))
|
|
||||||
(define modifier (record-modifier type 'field))))))
|
|
||||||
|
|
|
||||||
100
module/srfi/srfi-9.upstream.mes
Normal file
100
module/srfi/srfi-9.upstream.mes
Normal file
|
|
@ -0,0 +1,100 @@
|
||||||
|
;;; -*-scheme-*-
|
||||||
|
|
||||||
|
;;; Mes --- Maxwell Equations of Software
|
||||||
|
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees.
|
||||||
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
|
;;;
|
||||||
|
;;; This file is part of Mes.
|
||||||
|
;;;
|
||||||
|
;;; Mes 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 3 of the License, or (at
|
||||||
|
;;; your option) any later version.
|
||||||
|
;;;
|
||||||
|
;;; Mes 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 Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
;;; Commentary:
|
||||||
|
|
||||||
|
;;; srfi-9.mes - records. Assumes record-0.mes and record.mes are
|
||||||
|
;;; available. Modified from
|
||||||
|
;;; scheme48-1.1/scheme/alt/jar-defrecord.scm to implement SRFI-9.
|
||||||
|
|
||||||
|
;;; Code:
|
||||||
|
|
||||||
|
;;; Copyright (c) 1993-2004 by Richard Kelsey and Jonathan Rees. See file COPYING.
|
||||||
|
|
||||||
|
;;; scheme48-1.1/COPYING
|
||||||
|
|
||||||
|
;; Copyright (c) 1993-2004 Richard Kelsey and Jonathan Rees
|
||||||
|
;; All rights reserved.
|
||||||
|
|
||||||
|
;; Redistribution and use in source and binary forms, with or without
|
||||||
|
;; modification, are permitted provided that the following conditions
|
||||||
|
;; are met:
|
||||||
|
;; 1. Redistributions of source code must retain the above copyright
|
||||||
|
;; notice, this list of conditions and the following disclaimer.
|
||||||
|
;; 2. Redistributions in binary form must reproduce the above copyright
|
||||||
|
;; notice, this list of conditions and the following disclaimer in the
|
||||||
|
;; documentation and/or other materials provided with the distribution.
|
||||||
|
;; 3. The name of the authors may not be used to endorse or promote products
|
||||||
|
;; derived from this software without specific prior written permission.
|
||||||
|
|
||||||
|
;; THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
|
||||||
|
;; IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||||
|
;; OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||||||
|
;; IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||||||
|
;; INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
||||||
|
;; NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||||
|
;; DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||||
|
;; THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||||
|
;; (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
||||||
|
;; THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||||
|
|
||||||
|
; This is JAR's define-record-type, which doesn't resemble Richard's.
|
||||||
|
|
||||||
|
; There's no implicit name concatenation, so it can be defined
|
||||||
|
; entirely using syntax-rules. Example:
|
||||||
|
; (define-record-type foo :foo
|
||||||
|
; (make-foo x y)
|
||||||
|
; foo? - predicate name is optional
|
||||||
|
; (x foo-x)
|
||||||
|
; (y foo-y)
|
||||||
|
; (z foo-z set-foo-z!))
|
||||||
|
|
||||||
|
(define-syntax define-record-type
|
||||||
|
(syntax-rules ()
|
||||||
|
((define-record-type type
|
||||||
|
(constructor arg ...)
|
||||||
|
(field . field-stuff)
|
||||||
|
...)
|
||||||
|
(begin (define type (make-record-type 'type '(field ...)))
|
||||||
|
(define constructor (record-constructor type '(arg ...)))
|
||||||
|
(define-accessors type (field . field-stuff) ...)))
|
||||||
|
((define-record-type type
|
||||||
|
(constructor arg ...)
|
||||||
|
pred
|
||||||
|
more ...)
|
||||||
|
(begin (define-record-type type
|
||||||
|
(constructor arg ...)
|
||||||
|
more ...)
|
||||||
|
(define pred (record-predicate type))))))
|
||||||
|
|
||||||
|
;; Straightforward version
|
||||||
|
(define-syntax define-accessors
|
||||||
|
(syntax-rules ()
|
||||||
|
((define-accessors type field-spec ...)
|
||||||
|
(begin (define-accessor type . field-spec) ...))))
|
||||||
|
|
||||||
|
(define-syntax define-accessor
|
||||||
|
(syntax-rules ()
|
||||||
|
((define-accessor type field accessor)
|
||||||
|
(define accessor (record-accessor type 'field)))
|
||||||
|
((define-accessor type field accessor modifier)
|
||||||
|
(begin (define accessor (record-accessor type 'field))
|
||||||
|
(define modifier (record-modifier type 'field))))))
|
||||||
2
posix.c
2
posix.c
|
|
@ -59,5 +59,5 @@ current_input_port ()
|
||||||
SCM
|
SCM
|
||||||
set_current_input_port (SCM port)
|
set_current_input_port (SCM port)
|
||||||
{
|
{
|
||||||
g_stdin = fdopen (VALUE (port), "r");
|
g_stdin = VALUE (port) ? fdopen (VALUE (port), "r") : stdin;
|
||||||
}
|
}
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,7 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
cat $($(dirname $0)/include.mes $0) $0 /dev/stdin | $(dirname $0)/mes $MES_FLAGS "$@" > a.out
|
prefix=module/
|
||||||
|
cat $prefix/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/mes $MES_FLAGS "$@" > a.out
|
||||||
#paredit:|
|
#paredit:|
|
||||||
chmod +x a.out
|
chmod +x a.out
|
||||||
exit $?
|
exit $?
|
||||||
|
|
@ -24,7 +25,6 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
(mes-use-module (mes base))
|
||||||
(mes-use-module (mes quasiquote))
|
(mes-use-module (mes quasiquote))
|
||||||
(mes-use-module (mes let))
|
(mes-use-module (mes let))
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,7 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
cat ${1-$(dirname $(dirname $0))/share/doc/mes/examples/main.c} | cat $($(dirname $0)/include.mes $0) $0 /dev/stdin | $(dirname $0)/mes $MES_FLAGS "$@" > a.out
|
prefix=module/
|
||||||
|
cat ${1-$(dirname $(dirname $0))/share/doc/mes/examples/main.c} | cat $prefix/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/mes $MES_FLAGS "$@" > a.out
|
||||||
chmod +x a.out
|
chmod +x a.out
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -33,25 +34,6 @@ exit $?
|
||||||
|
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (mes scm))
|
|
||||||
(mes-use-module (mes syntax))
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes record-0))
|
|
||||||
(mes-use-module (mes record))
|
|
||||||
(mes-use-module (srfi srfi-9))
|
|
||||||
(mes-use-module (mes lalr-0))
|
|
||||||
(mes-use-module (mes lalr))
|
|
||||||
(mes-use-module (srfi srfi-1))
|
|
||||||
(mes-use-module (mes match))
|
|
||||||
(mes-use-module (rnrs bytevectors))
|
|
||||||
(mes-use-module (mes elf))
|
|
||||||
(mes-use-module (mes libc-i386))
|
|
||||||
(mes-use-module (language c lexer))
|
|
||||||
(mes-use-module (language c parser))
|
|
||||||
(mes-use-module (language c compiler))
|
(mes-use-module (language c compiler))
|
||||||
|
|
||||||
(compile)
|
(compile)
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,7 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo -e 'EOF\n___P((()))' | cat $($(dirname $0)/include.mes $0) $0 /dev/stdin | $(dirname $0)/mes $MES_FLAGS "$@"
|
prefix=module/
|
||||||
|
echo -e 'EOF\n___P((()))' | cat $prefix/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/mes $MES_FLAGS "$@"
|
||||||
chmod +x a.out
|
chmod +x a.out
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -34,18 +35,6 @@ exit $?
|
||||||
|
|
||||||
;;; Code:
|
;;; Code:
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (mes scm))
|
|
||||||
(mes-use-module (mes syntax))
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes record-0))
|
|
||||||
(mes-use-module (mes record))
|
|
||||||
(mes-use-module (srfi srfi-9))
|
|
||||||
(mes-use-module (mes lalr-0))
|
|
||||||
(mes-use-module (mes lalr))
|
|
||||||
(mes-use-module (language paren))
|
(mes-use-module (language paren))
|
||||||
|
|
||||||
(paren-depth)
|
(paren-depth)
|
||||||
|
|
|
||||||
|
|
@ -2,7 +2,8 @@
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
MES_ARENA=${MES_ARENA-5000000}
|
MES_ARENA=${MES_ARENA-5000000}
|
||||||
export MES_ARENA
|
export MES_ARENA
|
||||||
cat $($(dirname $0)/include.mes $0) $0 /dev/stdin | $(dirname $0)/mes $MES_FLAGS "$@"
|
prefix=module/
|
||||||
|
cat $prefix/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/mes $MES_FLAGS "$@"
|
||||||
#paredit:|
|
#paredit:|
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -25,14 +26,8 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (mes scm))
|
(mes-use-module (mes scm))
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes syntax))
|
(mes-use-module (mes syntax))
|
||||||
(mes-use-module (mes match))
|
|
||||||
(mes-use-module (mes repl))
|
(mes-use-module (mes repl))
|
||||||
|
|
||||||
(repl)
|
(repl)
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; base.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,8 +25,6 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
(pass-if "first dummy" #t)
|
(pass-if "first dummy" #t)
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; closure.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,8 +25,6 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
(pass-if "first dummy" #t)
|
(pass-if "first dummy" #t)
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; scm.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,17 +25,9 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes scm))
|
(mes-use-module (mes scm))
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
(if guile?
|
|
||||||
(use-modules (srfi srfi-1)))
|
|
||||||
|
|
||||||
(pass-if "values" (seq? (values 0 1) 0))
|
(pass-if "values" (seq? (values 0 1) 0))
|
||||||
(pass-if "values 2" (seq? ((lambda (x) x) (values 1 2 3)) 1))
|
(pass-if "values 2" (seq? ((lambda (x) x) (values 1 2 3)) 1))
|
||||||
(pass-if "values 3" (seq? 1 ((lambda (x) x) (values 1 2 3))))
|
(pass-if "values 3" (seq? 1 ((lambda (x) x) (values 1 2 3))))
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/..//mes "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/..//mes "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
|
||||||
|
|
@ -1,7 +1,7 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
set -x
|
set -x
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
|
||||||
|
|
@ -1,7 +1,7 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
set -x
|
set -x
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
|
||||||
|
|
@ -1,7 +1,7 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
set -x
|
set -x
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/..//mes "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/..//mes "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/..//mes "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/..//mes "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/..//mes "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/..//mes "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -25,7 +25,6 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
(mes-use-module (mes base))
|
||||||
(mes-use-module (mes quasiquote))
|
(mes-use-module (mes quasiquote))
|
||||||
(mes-use-module (mes let))
|
(mes-use-module (mes let))
|
||||||
|
|
@ -33,9 +32,6 @@ exit $?
|
||||||
(mes-use-module (mes scm))
|
(mes-use-module (mes scm))
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
(when guile?
|
|
||||||
(use-modules (srfi srfi-1)))
|
|
||||||
|
|
||||||
(pass-if "first dummy" #t)
|
(pass-if "first dummy" #t)
|
||||||
(pass-if-not "second dummy" #f)
|
(pass-if-not "second dummy" #f)
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; let-syntax.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,11 +25,6 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (mes scm))
|
|
||||||
(mes-use-module (mes syntax))
|
(mes-use-module (mes syntax))
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; let.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,9 +25,6 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
(mes-use-module (mes let))
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; match.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,16 +25,6 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes scm))
|
|
||||||
(mes-use-module (mes syntax))
|
|
||||||
(mes-use-module (mes record-0))
|
|
||||||
(mes-use-module (mes record))
|
|
||||||
(mes-use-module (srfi srfi-9))
|
|
||||||
(mes-use-module (mes match))
|
(mes-use-module (mes match))
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
|
|
|
||||||
27
module/mes/lalr-0.mes → tests/module.test
Normal file → Executable file
27
module/mes/lalr-0.mes → tests/module.test
Normal file → Executable file
|
|
@ -1,9 +1,19 @@
|
||||||
|
#! /bin/sh
|
||||||
|
# -*-scheme-*-
|
||||||
|
set -x
|
||||||
|
#echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes "$@"
|
||||||
|
#paredit:||
|
||||||
|
cat module/mes/base-0.mes $0 | $(dirname $0)/../scripts/mes "$@"
|
||||||
|
#paredit:|
|
||||||
|
exit $?
|
||||||
|
!#
|
||||||
|
|
||||||
;;; -*-scheme-*-
|
;;; -*-scheme-*-
|
||||||
|
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; lalr-0.mes: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -18,16 +28,9 @@
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
;;; Commentary:
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
;;; lalr-0.mes has mes-specific definitions needed for lalr.mes
|
(pass-if "first dummy" #t)
|
||||||
|
(pass-if-not "second dummy" #f)
|
||||||
|
|
||||||
;;; Code:
|
(result 'report)
|
||||||
|
|
||||||
(define pprint display)
|
|
||||||
(define lalr-keyword? symbol?)
|
|
||||||
(define-macro (BITS-PER-WORD) 30)
|
|
||||||
(define-macro (logical-or x . y) `(logior ,x ,@y))
|
|
||||||
(define-macro (lalr-error msg obj) `(error ,msg ,obj))
|
|
||||||
(define (note-source-location lvalue tok) lvalue)
|
|
||||||
(define *eoi* -1)
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -25,20 +25,6 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes scm))
|
|
||||||
(mes-use-module (mes psyntax-0))
|
|
||||||
(mes-use-module (mes psyntax-pp))
|
|
||||||
(mes-use-module (mes psyntax-1))
|
|
||||||
(mes-use-module (mes test))
|
|
||||||
|
|
||||||
(pass-if "first dummy" #t)
|
|
||||||
(pass-if-not "second dummy" #f)
|
|
||||||
|
|
||||||
(cond-expand
|
(cond-expand
|
||||||
(guile
|
(guile
|
||||||
;;(use-modules (ice-9 syncase))
|
;;(use-modules (ice-9 syncase))
|
||||||
|
|
@ -46,7 +32,12 @@ exit $?
|
||||||
(define syntax-object->datum syntax->datum)
|
(define syntax-object->datum syntax->datum)
|
||||||
(define datum->syntax-object datum->syntax)
|
(define datum->syntax-object datum->syntax)
|
||||||
)
|
)
|
||||||
(mes))
|
(mes
|
||||||
|
(mes-use-module (mes psyntax))
|
||||||
|
(mes-use-module (mes test))))
|
||||||
|
|
||||||
|
(pass-if "first dummy" #t)
|
||||||
|
(pass-if-not "second dummy" #f)
|
||||||
|
|
||||||
(when (not guile?)
|
(when (not guile?)
|
||||||
(pass-if "andmap"
|
(pass-if "andmap"
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; quasiquote.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,7 +25,6 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
(mes-use-module (mes base))
|
||||||
(mes-use-module (mes quasiquote))
|
(mes-use-module (mes quasiquote))
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
|
||||||
|
|
@ -1,7 +1,7 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
# ***REMOVE THIS BLOCK COMMENT INITIALLY***
|
# ***REMOVE THIS BLOCK COMMENT INITIALLY***
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; record.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,17 +25,7 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes scm))
|
|
||||||
(mes-use-module (mes syntax))
|
|
||||||
(mes-use-module (mes record-0))
|
|
||||||
(mes-use-module (mes record))
|
|
||||||
(mes-use-module (srfi srfi-9))
|
(mes-use-module (srfi srfi-9))
|
||||||
|
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
(when guile?
|
(when guile?
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; scm.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,17 +25,10 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes scm))
|
(mes-use-module (mes scm))
|
||||||
|
(mes-use-module (srfi srfi-0))
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
(when guile?
|
|
||||||
(use-modules (srfi srfi-1)))
|
|
||||||
|
|
||||||
(pass-if "first dummy" #t)
|
(pass-if "first dummy" #t)
|
||||||
(pass-if-not "second dummy" #f)
|
(pass-if-not "second dummy" #f)
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,6 +1,6 @@
|
||||||
#! /bin/sh
|
#! /bin/sh
|
||||||
# -*-scheme-*-
|
# -*-scheme-*-
|
||||||
echo ' ()' | cat $($(dirname $0)/../scripts/include.mes $0) $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
echo ' ()' | cat $(dirname $0)/../module/mes/base-0.mes $0 /dev/stdin | $(dirname $0)/../scripts/mes $MES_FLAGS "$@"
|
||||||
#paredit:||
|
#paredit:||
|
||||||
exit $?
|
exit $?
|
||||||
!#
|
!#
|
||||||
|
|
@ -10,7 +10,7 @@ exit $?
|
||||||
;;; Mes --- Maxwell Equations of Software
|
;;; Mes --- Maxwell Equations of Software
|
||||||
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
;;; Copyright © 2016 Jan Nieuwenhuizen <janneke@gnu.org>
|
||||||
;;;
|
;;;
|
||||||
;;; vector.test: This file is part of Mes.
|
;;; This file is part of Mes.
|
||||||
;;;
|
;;;
|
||||||
;;; Mes is free software; you can redistribute it and/or modify it
|
;;; Mes is free software; you can redistribute it and/or modify it
|
||||||
;;; under the terms of the GNU General Public License as published by
|
;;; under the terms of the GNU General Public License as published by
|
||||||
|
|
@ -25,17 +25,9 @@ exit $?
|
||||||
;;; You should have received a copy of the GNU General Public License
|
;;; You should have received a copy of the GNU General Public License
|
||||||
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
;;; along with Mes. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
(mes-use-module (mes base-0))
|
|
||||||
(mes-use-module (mes base))
|
|
||||||
(mes-use-module (mes quasiquote))
|
|
||||||
(mes-use-module (mes let))
|
|
||||||
(mes-use-module (srfi srfi-0))
|
|
||||||
(mes-use-module (mes scm))
|
(mes-use-module (mes scm))
|
||||||
(mes-use-module (mes test))
|
(mes-use-module (mes test))
|
||||||
|
|
||||||
(when guile?
|
|
||||||
(use-modules (srfi srfi-1)))
|
|
||||||
|
|
||||||
(pass-if "first dummy" #t)
|
(pass-if "first dummy" #t)
|
||||||
(pass-if-not "second dummy" #f)
|
(pass-if-not "second dummy" #f)
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in a new issue