
entries x and y in the list produced by the sort call, if x's bfp = y's bfp, x should come before y if x's efp < y's efp. The idea is that enclosing entries should always come later in the list. this affects only languages where two expressions can start at the same character position. pdhtml.ss expanded capability of ez-grammar with support for simpl parsing of binary operators w/precedence and associativity and automatically generated markdown grammar descriptions. ez-grammar-test.ss now also doubles as a test of pdhtml for algebraic languages. mats/examples.ms, examples/ez-grammar.ss, examples/ez-grammar-test.ss, examples/Makefile original commit: 53b8d16a1e86f3956585dbec0c7b573e485f7844
29 lines
1.1 KiB
Makefile
29 lines
1.1 KiB
Makefile
# Unix make file to compile the examples.
|
|
# Compilation is not necessary since the examples may be loaded from
|
|
# source, but this gives an example of how to use make for Scheme.
|
|
# * To compile files not already compiled, type "make". Only those
|
|
# files in the object list below and not yet compiled will be compiled.
|
|
# * To compile all files, type "make all". Only those files in the object
|
|
# list below will be compiled.
|
|
# * To compile one file, say "fumble.ss", type "make fumble.so". The
|
|
# file need not be in the object list below.
|
|
# * To remove the object files, type "make clean".
|
|
# * To print the examples, type "make print".
|
|
|
|
src = def.ss edit.ss fact.ss fatfib.ss fft.ss fib.ss freq.ss interpret.ss\
|
|
m4.ss macro.ss matrix.ss object.ss power.ss queue.ss rabbit.ss rsa.ss\
|
|
scons.ss setof.ss socket.ss unify.ss compat.ss ez-grammar-test.ss
|
|
obj = ${src:%.ss=%.so}
|
|
|
|
Scheme = ../bin/scheme -q
|
|
|
|
.SUFFIXES:
|
|
.SUFFIXES: .ss .so
|
|
.ss.so: ; echo '(time (compile-file "$*"))' | ${Scheme}
|
|
|
|
needed: ${obj}
|
|
|
|
all: ; echo "(time (for-each compile-file (map symbol->string '(${src}))))" | ${Scheme}
|
|
|
|
clean: ; /bin/rm -f $(obj) expr.md
|