Compare commits

...

21 Commits

Author SHA1 Message Date
c311d4ebc4 cl: Phase 5 set-macro-character + Phase 6 corpus 200+ — 518/518 tests
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 37s
set-macro-character/set-dispatch-macro-character/get-macro-character
stubs: cl-reader-macros + cl-dispatch-macros dicts, full dispatch in
eval.sx. All Phase 5+6 roadmap items ticked. 518 total tests, 0 failed.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 12:35:26 +00:00
99f8ccb30e cl: Phase 6 packages — defpackage/in-package + pkg:sym — 518/518 tests
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 40s
cl-packages dict, cl-current-package, cl-package-sep? strips pkg:
prefix from symbol/function lookups. defpackage/in-package/export/
use-package/import/find-package/package-name dispatch. Package-
qualified calls like (cl:car ...) and (cl:mapcar ...) work.
4 package tests added to stdlib.sx.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 12:33:36 +00:00
4f9da65b3d cl: Phase 6 FORMAT + substr fixes — 514/514 tests
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 39s
FORMAT with ~A/~S/~D/~F/~%/~&/~T/~P/~{...~}/~^; cl-fmt-loop,
cl-fmt-find-close, cl-fmt-iterate, cl-fmt-a/cl-fmt-s helpers.
Fix substr(start,length) semantics throughout: SUBSEQ end formula
corrected to (- end start), cl-fmt-loop char extraction fixed.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 12:23:54 +00:00
025ddbebdd cl: Phase 6 stdlib — sequence/list/string functions, 508/508 tests
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 44s
mapc/mapcan/reduce/find/find-if/position/count/every/some/notany/
notevery/remove/remove-if/subst/member; assoc/rassoc/getf/last/
butlast/nthcdr/list*/cadr/caddr/cadddr; subseq/coerce/make-list.
44 new tests in tests/stdlib.sx. Helpers: cl-member-helper,
cl-subst-helper, cl-position-helper.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 12:17:13 +00:00
f449f82fdd cl: Phase 5 macros+LOOP + Phase 2 dynamic vars — 464/464 tests
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 44s
defmacro/macrolet/symbol-macrolet/macroexpand, gensym/gentemp, full
LOOP macro (loop.sx) with all clause types. Phase 2 dynamic variables:
cl-apply-dyn, cl-letstar-bind, cl-mark-special!/cl-special? for
defvar/defparameter specials with let-based dynamic rebinding.
27 macro+LOOP tests; 182 eval tests (8 new dynamic var tests).

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 12:04:37 +00:00
0e426cfea8 cl: Phase 4 CLOS complete — generic functions, multi-dispatch, method qualifiers, 437/437 tests
- lib/common-lisp/clos.sx (27 forms): class registry (8 built-in classes),
  defclass/make-instance/slot-value/slot-boundp/change-class, defgeneric/defmethod
  with :before/:after/:around, clos-call-generic (standard combination: sort by
  specificity, fire befores, call primary chain, fire afters reversed),
  call-next-method/next-method-p, with-slots, deferred accessor installation
- lib/common-lisp/tests/clos.sx: 41 tests (class-of, subclass-of?, defclass,
  make-instance, slot ops, inheritance, method specificity, qualifiers, accessors,
  with-slots, change-class)
- lib/common-lisp/tests/programs/geometry.sx: 12 tests — intersect generic
  dispatching on geo-point×geo-point, geo-point×geo-line, geo-line×geo-line,
  geo-line×geo-plane (multi-dispatch by class precedence)
- lib/common-lisp/tests/programs/mop-trace.sx: 13 tests — :before/:after
  tracing on area and describe-shape generics, call-next-method in circle/rect
- eval.sx: dynamic variables — cl-apply-dyn saves/restores global slot for
  specials; cl-mark-special!/cl-special?/cl-dyn-unbound; defvar now marks
  specials; let/let* rebind via cl-apply-dyn; 8 new tests (182 eval total)
- conformance.sh + test.sh: Phase 4 suites wired in
- plans/common-lisp-on-sx.md: Phase 4 + dynamic variable boxes ticked

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 11:38:37 +00:00
71c4b5e33f cl: Phase 3 all complete — conformance.sh runner, 363/363 tests green
conformance.sh runs all 7 test suites (reader/parser/eval/conditions/
restart-demo/parse-recover/interactive-debugger), writes scoreboard.json
and scoreboard.md. 363 total tests: 79 tokenizer, 31 parser/lambda-lists,
174 evaluator (including unwind-protect), 59 conditions, 20 classic programs.
Phase 3 fully complete — all roadmap boxes ticked.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 11:24:50 +00:00
4cd8773766 cl: multiple values — 15 new tests (174 eval, 346 total green)
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 46s
VALUES wraps 2+ values in {:cl-type "mv"}; cl-mv-primary strips to
primary in IF/AND/OR/COND/cl-call-fn single-value contexts; cl-mv-vals
expands for MULTIPLE-VALUE-BIND, MULTIPLE-VALUE-CALL, NTH-VALUE.
2026-05-05 11:23:12 +00:00
733b1ebefa cl: Phase 3 complete — *debugger-hook*, *break-on-signals*, invoke-restart-interactively (147 tests)
cl-debugger-hook: mutable global (fn (c hook) result); cl-invoke-debugger
calls it with infinite-recursion guard (sets hook nil during call).
cl-error now routes unhandled errors through cl-invoke-debugger instead of
bare host error — allows the hook to invoke a restart and resume.
cl-break-on-signals: when set to a type name, cl-signal fires the debugger
hook before walking handlers if the condition matches.
cl-invoke-restart-interactively: calls the restart fn with no args (no
terminal protocol — equivalent to (invoke-restart name)).
4 new tests in conditions.sx covering all three; Phase 3 fully complete.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 11:21:52 +00:00
85911d7b84 cl: Phase 3 interactive-debugger — *debugger-hook* pattern, 7 tests (143 total)
cl-debugger-hook global (nil = default), cl-invoke-debugger walks the hook,
cl-error-with-debugger routes unhandled errors through the hook, and
make-policy-debugger builds a hook from a (fn (condition restarts) name)
policy function. Tests: hook receives condition, policy selects use-zero/abort
restarts, compute-restarts visible inside hook, handler wins before hook fires,
infinite-recursion guard. Wired into test.sh program suite runner.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 11:17:57 +00:00
ab66b29a74 cl: Phase 3 classic programs — restart-demo (7 tests) + parse-recover (6 tests)
restart-demo.sx: safe-divide with division-by-zero condition, use-zero
and retry restarts. Demonstrates handler-bind invoking a restart to
resume computation with a corrected value.

parse-recover.sx: token parser signalling parse-error on non-integer
tokens, skip-token and use-zero restarts. Demonstrates recovery-via-
restart and handler-case abort patterns.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 11:16:35 +00:00
32a82a2e12 cl: unwind-protect — 8 new tests (159 eval, 331 total green)
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 44s
cl-eval-unwind-protect evaluates protected form, runs cleanup via
for-each (results discarded, sentinels preserved), returns original
result — correctly propagates block-return/go-tag through cleanup.
2026-05-05 11:14:39 +00:00
7d6df6fd5f cl: Phase 3 conditions + restarts — handler-bind, handler-case, restart-case, 55 tests (123 total runtime)
define-condition with 15-type ANSI hierarchy (condition/error/warning/
simple-error/simple-warning/type-error/arithmetic-error/division-by-zero/
cell-error/unbound-variable/undefined-function/program-error/storage-condition).

cl-condition-of-type? walks the hierarchy; cl-make-condition builds tagged
dicts {:cl-type "cl-condition" :class name :slots {...}}. cl-signal-obj
walks cl-handler-stack for non-unwinding dispatch. cl-handler-case and
cl-restart-case use call/cc escape continuations for unwinding. All stacks
are mutable SX globals (the built-in handler-bind/restart-case only accept
literal AST specs — not computed lists). Key fix: cl-condition-of-type?
captures cl-condition-classes at define-time via let-closure to avoid
free-variable failure through env_merge parent chain.

55 tests in lib/common-lisp/tests/conditions.sx, wired into test.sh.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 11:14:04 +00:00
fd16776dd2 cl: unwind-protect — cleanup frame in cl-eval-ast, 8 new tests (159 eval)
Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-05-05 11:13:53 +00:00
a12a6a11cb cl: tagbody + go — 11 new tests (151 eval, 323 total green)
Sentinel-based tagbody: cl-build-tag-map indexes tags by str-normalised key
(handles integer tags); cl-eval-tagbody loops with go-jump restart;
go-tag propagates through cl-eval-body alongside block-return.
2026-05-05 11:07:43 +00:00
ce7243a1fb cl: block + return-from — 13 new tests (140 eval, 312 total green)
Sentinel propagation in cl-eval-body; cl-eval-block catches matching
sentinels; BLOCK/RETURN-FROM/RETURN dispatch added to cl-eval-list.
Parser: CL strings now {:cl-type "string"} dicts for proper CL semantics.
2026-05-05 10:57:33 +00:00
3f8fe41d4d Merge architecture into loops/common-lisp 2026-05-05 10:47:02 +00:00
4da91bb9b4 cl: Phase 2 eval — 127 tests, 299 total green
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 12s
lib/common-lisp/eval.sx: cl-eval-ast implementing quote, if, progn,
let/let*, flet, labels, setq/setf, function, lambda, the, locally,
eval-when, defun, defvar/defparameter/defconstant, built-in arithmetic
(+/-/*//, min/max/abs/evenp/oddp), comparisons, predicates, list ops,
string ops, funcall/apply/mapcar.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-04-25 18:58:48 +00:00
cdee007185 cl: Phase 1 lambda-list parser + 31 tests (172 total green)
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Has been cancelled
Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-04-25 18:26:58 +00:00
bcf6057ac5 common-lisp: Phase 1 reader + 62 tests (141 total)
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Has been cancelled
lib/common-lisp/parser.sx — cl-read/cl-read-all: lists, dotted
pairs (a . b) → cons dict, quote/backquote/unquote/splice as
wrapper lists, #' → FUNCTION, #(…) → vector dict, #:foo →
uninterned dict, NIL→nil, T→true, integer radix conversion
(#xFF/#b1010/#o17). Floats/ratios kept as annotated dicts.

lib/common-lisp/tests/parse.sx — 62 tests, all green.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-04-25 18:15:07 +00:00
13d0ebcce8 common-lisp: Phase 1 tokenizer + 79 tests
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Has been cancelled
lib/common-lisp/reader.sx — CL tokenizer: symbols with package
qualification (pkg:sym/pkg::sym), integers, floats, ratios, hex/
binary/octal (#xFF/#b1010/#o17), strings with escapes, #\ char
literals (named + bare), reader macros (#' #( #: ,@), line and
nested block comments.

lib/common-lisp/tests/read.sx — 79 tests, all green.
lib/common-lisp/test.sh — test runner (sx_server pipe protocol).

Key SX gotcha: use str not concat for string building.

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
2026-04-25 18:06:30 +00:00
24 changed files with 7443 additions and 61 deletions

500
lib/common-lisp/clos.sx Normal file
View File

@@ -0,0 +1,500 @@
;; lib/common-lisp/clos.sx — CLOS: classes, instances, generic functions
;;
;; Class records: {:clos-type "class" :name "NAME" :slots {...} :parents [...] :methods [...]}
;; Instance: {:clos-type "instance" :class "NAME" :slots {slot: val ...}}
;; Method: {:qualifiers [...] :specializers [...] :fn (fn (args next-fn) ...)}
;;
;; SX primitive notes:
;; dict->list: use (map (fn (k) (list k (get d k))) (keys d))
;; dict-set (pure): use assoc
;; fn?/callable?: use callable?
;; ── dict helpers ───────────────────────────────────────────────────────────
(define
clos-dict->list
(fn (d) (map (fn (k) (list k (get d k))) (keys d))))
;; ── class registry ─────────────────────────────────────────────────────────
(define
clos-class-registry
(dict
"t"
{:parents (list) :clos-type "class" :slots (dict) :methods (list) :name "t"}
"null"
{:parents (list "t") :clos-type "class" :slots (dict) :methods (list) :name "null"}
"integer"
{:parents (list "t") :clos-type "class" :slots (dict) :methods (list) :name "integer"}
"float"
{:parents (list "t") :clos-type "class" :slots (dict) :methods (list) :name "float"}
"string"
{:parents (list "t") :clos-type "class" :slots (dict) :methods (list) :name "string"}
"symbol"
{:parents (list "t") :clos-type "class" :slots (dict) :methods (list) :name "symbol"}
"cons"
{:parents (list "t") :clos-type "class" :slots (dict) :methods (list) :name "cons"}
"list"
{:parents (list "t") :clos-type "class" :slots (dict) :methods (list) :name "list"}))
;; ── clos-generic-registry ─────────────────────────────────────────────────
(define clos-generic-registry (dict))
;; ── class-of ──────────────────────────────────────────────────────────────
(define
clos-class-of
(fn
(x)
(cond
((nil? x) "null")
((integer? x) "integer")
((float? x) "float")
((string? x) "string")
((symbol? x) "symbol")
((and (list? x) (> (len x) 0)) "cons")
((and (list? x) (= (len x) 0)) "null")
((and (dict? x) (= (get x "clos-type") "instance")) (get x "class"))
(:else "t"))))
;; ── subclass-of? ──────────────────────────────────────────────────────────
;;
;; Captures clos-class-registry at define time to avoid free-variable issues.
(define
clos-subclass-of?
(let
((registry clos-class-registry))
(fn
(class-name super-name)
(if
(= class-name super-name)
true
(let
((rec (get registry class-name)))
(if
(nil? rec)
false
(some
(fn (p) (clos-subclass-of? p super-name))
(get rec "parents"))))))))
;; ── instance-of? ──────────────────────────────────────────────────────────
(define
clos-instance-of?
(fn (obj class-name) (clos-subclass-of? (clos-class-of obj) class-name)))
;; ── defclass ──────────────────────────────────────────────────────────────
;;
;; slot-specs: list of dicts with keys: name initarg initform accessor reader writer
;; Each missing key defaults to nil.
(define clos-slot-spec (fn (spec) (if (string? spec) {:initform nil :initarg nil :reader nil :writer nil :accessor nil :name spec} spec)))
(define
clos-defclass
(fn
(name parents slot-specs)
(let
((slots (dict)))
(for-each
(fn
(pname)
(let
((prec (get clos-class-registry pname)))
(when
(not (nil? prec))
(for-each
(fn
(k)
(when
(nil? (get slots k))
(dict-set! slots k (get (get prec "slots") k))))
(keys (get prec "slots"))))))
parents)
(for-each
(fn
(s)
(let
((spec (clos-slot-spec s)))
(dict-set! slots (get spec "name") spec)))
slot-specs)
(let
((class-rec {:parents parents :clos-type "class" :slots slots :methods (list) :name name}))
(dict-set! clos-class-registry name class-rec)
(clos-install-accessors-for name slots)
name))))
;; ── accessor installation (forward-declared, defined after defmethod) ──────
(define
clos-install-accessors-for
(fn
(class-name slots)
(for-each
(fn
(k)
(let
((spec (get slots k)))
(let
((reader (get spec "reader")))
(when
(not (nil? reader))
(clos-add-reader-method reader class-name k)))
(let
((accessor (get spec "accessor")))
(when
(not (nil? accessor))
(clos-add-reader-method accessor class-name k)))))
(keys slots))))
;; placeholder — real impl filled in after defmethod is defined
(define clos-add-reader-method (fn (method-name class-name slot-name) nil))
;; ── make-instance ─────────────────────────────────────────────────────────
(define
clos-make-instance
(fn
(class-name &rest initargs)
(let
((class-rec (get clos-class-registry class-name)))
(if
(nil? class-rec)
(error (str "No class named: " class-name))
(let
((slots (dict)))
(for-each
(fn
(k)
(let
((spec (get (get class-rec "slots") k)))
(let
((initform (get spec "initform")))
(when
(not (nil? initform))
(dict-set!
slots
k
(if (callable? initform) (initform) initform))))))
(keys (get class-rec "slots")))
(define
apply-args
(fn
(args)
(when
(>= (len args) 2)
(let
((key (str (first args))) (val (first (rest args))))
(let
((skey (if (= (slice key 0 1) ":") (slice key 1 (len key)) key)))
(let
((matched false))
(for-each
(fn
(sk)
(let
((spec (get (get class-rec "slots") sk)))
(let
((ia (get spec "initarg")))
(when
(or
(= ia key)
(= ia (str ":" skey))
(= sk skey))
(dict-set! slots sk val)
(set! matched true)))))
(keys (get class-rec "slots")))))
(apply-args (rest (rest args)))))))
(apply-args initargs)
{:clos-type "instance" :slots slots :class class-name})))))
;; ── slot-value ────────────────────────────────────────────────────────────
(define
clos-slot-value
(fn
(instance slot-name)
(if
(and (dict? instance) (= (get instance "clos-type") "instance"))
(get (get instance "slots") slot-name)
(error (str "Not a CLOS instance: " (inspect instance))))))
(define
clos-set-slot-value!
(fn
(instance slot-name value)
(if
(and (dict? instance) (= (get instance "clos-type") "instance"))
(dict-set! (get instance "slots") slot-name value)
(error (str "Not a CLOS instance: " (inspect instance))))))
(define
clos-slot-boundp
(fn
(instance slot-name)
(and
(dict? instance)
(= (get instance "clos-type") "instance")
(not (nil? (get (get instance "slots") slot-name))))))
;; ── find-class / change-class ─────────────────────────────────────────────
(define clos-find-class (fn (name) (get clos-class-registry name)))
(define
clos-change-class!
(fn
(instance new-class-name)
(if
(and (dict? instance) (= (get instance "clos-type") "instance"))
(dict-set! instance "class" new-class-name)
(error (str "Not a CLOS instance: " (inspect instance))))))
;; ── defgeneric ────────────────────────────────────────────────────────────
(define
clos-defgeneric
(fn
(name options)
(let
((combination (or (get options "method-combination") "standard")))
(when
(nil? (get clos-generic-registry name))
(dict-set! clos-generic-registry name {:methods (list) :combination combination :name name}))
name)))
;; ── defmethod ─────────────────────────────────────────────────────────────
;;
;; method-fn: (fn (args next-fn) body)
;; args = list of all call arguments
;; next-fn = (fn () next-method-result) or nil
(define
clos-defmethod
(fn
(generic-name qualifiers specializers method-fn)
(when
(nil? (get clos-generic-registry generic-name))
(clos-defgeneric generic-name {}))
(let
((grec (get clos-generic-registry generic-name))
(new-method {:fn method-fn :qualifiers qualifiers :specializers specializers}))
(let
((kept (filter (fn (m) (not (and (= (get m "qualifiers") qualifiers) (= (get m "specializers") specializers)))) (get grec "methods"))))
(dict-set!
clos-generic-registry
generic-name
(assoc grec "methods" (append kept (list new-method))))
generic-name))))
;; Now install the real accessor-method installer
(set!
clos-add-reader-method
(fn
(method-name class-name slot-name)
(clos-defmethod
method-name
(list)
(list class-name)
(fn (args next-fn) (clos-slot-value (first args) slot-name)))))
;; ── method specificity ─────────────────────────────────────────────────────
(define
clos-method-matches?
(fn
(method args)
(let
((specs (get method "specializers")))
(if
(> (len specs) (len args))
false
(define
check-all
(fn
(i)
(if
(>= i (len specs))
true
(let
((spec (nth specs i)) (arg (nth args i)))
(if
(= spec "t")
(check-all (+ i 1))
(if
(clos-instance-of? arg spec)
(check-all (+ i 1))
false))))))
(check-all 0)))))
;; Precedence distance: how far class-name is from spec-name up the hierarchy.
(define
clos-specificity
(let
((registry clos-class-registry))
(fn
(class-name spec-name)
(define
walk
(fn
(cn depth)
(if
(= cn spec-name)
depth
(let
((rec (get registry cn)))
(if
(nil? rec)
nil
(let
((results (map (fn (p) (walk p (+ depth 1))) (get rec "parents"))))
(let
((non-nil (filter (fn (x) (not (nil? x))) results)))
(if
(empty? non-nil)
nil
(reduce
(fn (a b) (if (< a b) a b))
(first non-nil)
(rest non-nil))))))))))
(walk class-name 0))))
(define
clos-method-more-specific?
(fn
(m1 m2 args)
(let
((s1 (get m1 "specializers")) (s2 (get m2 "specializers")))
(define
cmp
(fn
(i)
(if
(>= i (len s1))
false
(let
((c1 (clos-specificity (clos-class-of (nth args i)) (nth s1 i)))
(c2
(clos-specificity (clos-class-of (nth args i)) (nth s2 i))))
(cond
((and (nil? c1) (nil? c2)) (cmp (+ i 1)))
((nil? c1) false)
((nil? c2) true)
((< c1 c2) true)
((> c1 c2) false)
(:else (cmp (+ i 1))))))))
(cmp 0))))
(define
clos-sort-methods
(fn
(methods args)
(define
insert
(fn
(m sorted)
(if
(empty? sorted)
(list m)
(if
(clos-method-more-specific? m (first sorted) args)
(cons m sorted)
(cons (first sorted) (insert m (rest sorted)))))))
(reduce (fn (acc m) (insert m acc)) (list) methods)))
;; ── call-generic (standard method combination) ─────────────────────────────
(define
clos-call-generic
(fn
(generic-name args)
(let
((grec (get clos-generic-registry generic-name)))
(if
(nil? grec)
(error (str "No generic function: " generic-name))
(let
((applicable (filter (fn (m) (clos-method-matches? m args)) (get grec "methods"))))
(if
(empty? applicable)
(error
(str
"No applicable method for "
generic-name
" with classes "
(inspect (map clos-class-of args))))
(let
((primary (filter (fn (m) (empty? (get m "qualifiers"))) applicable))
(before
(filter
(fn (m) (= (get m "qualifiers") (list "before")))
applicable))
(after
(filter
(fn (m) (= (get m "qualifiers") (list "after")))
applicable))
(around
(filter
(fn (m) (= (get m "qualifiers") (list "around")))
applicable)))
(let
((sp (clos-sort-methods primary args))
(sb (clos-sort-methods before args))
(sa (clos-sort-methods after args))
(sw (clos-sort-methods around args)))
(define
make-primary-chain
(fn
(methods)
(if
(empty? methods)
(fn
()
(error (str "No next primary method: " generic-name)))
(fn
()
((get (first methods) "fn")
args
(make-primary-chain (rest methods)))))))
(define
make-around-chain
(fn
(around-methods inner-thunk)
(if
(empty? around-methods)
inner-thunk
(fn
()
((get (first around-methods) "fn")
args
(make-around-chain
(rest around-methods)
inner-thunk))))))
(for-each (fn (m) ((get m "fn") args (fn () nil))) sb)
(let
((primary-thunk (make-primary-chain sp)))
(let
((result (if (empty? sw) (primary-thunk) ((make-around-chain sw primary-thunk)))))
(for-each
(fn (m) ((get m "fn") args (fn () nil)))
(reverse sa))
result))))))))))
;; ── call-next-method / next-method-p ──────────────────────────────────────
(define clos-call-next-method (fn (next-fn) (next-fn)))
(define clos-next-method-p (fn (next-fn) (not (nil? next-fn))))
;; ── with-slots ────────────────────────────────────────────────────────────
(define
clos-with-slots
(fn
(instance slot-names body-fn)
(let
((vals (map (fn (s) (clos-slot-value instance s)) slot-names)))
(apply body-fn vals))))

161
lib/common-lisp/conformance.sh Executable file
View File

@@ -0,0 +1,161 @@
#!/usr/bin/env bash
# lib/common-lisp/conformance.sh — CL-on-SX conformance test runner
#
# Runs all Common Lisp test suites and writes scoreboard.json + scoreboard.md.
#
# Usage:
# bash lib/common-lisp/conformance.sh
# bash lib/common-lisp/conformance.sh -v
set -uo pipefail
cd "$(git rev-parse --show-toplevel)"
SX_SERVER="${SX_SERVER:-hosts/ocaml/_build/default/bin/sx_server.exe}"
if [ ! -x "$SX_SERVER" ]; then
SX_SERVER="/root/rose-ash/hosts/ocaml/_build/default/bin/sx_server.exe"
fi
if [ ! -x "$SX_SERVER" ]; then
echo "ERROR: sx_server.exe not found."
exit 1
fi
VERBOSE="${1:-}"
TOTAL_PASS=0; TOTAL_FAIL=0
SUITE_NAMES=()
SUITE_PASS=()
SUITE_FAIL=()
# run_suite NAME "file1 file2 ..." PASS_VAR FAIL_VAR FAILURES_VAR
run_suite() {
local name="$1" load_files="$2" pass_var="$3" fail_var="$4" failures_var="$5"
local TMP; TMP=$(mktemp)
{
printf '(epoch 1)\n(load "spec/stdlib.sx")\n'
local i=2
for f in $load_files; do
printf '(epoch %d)\n(load "%s")\n' "$i" "$f"
i=$((i+1))
done
printf '(epoch 100)\n(eval "%s")\n' "$pass_var"
printf '(epoch 101)\n(eval "%s")\n' "$fail_var"
} > "$TMP"
local OUT; OUT=$(timeout 30 "$SX_SERVER" < "$TMP" 2>/dev/null)
rm -f "$TMP"
local P F
P=$(echo "$OUT" | grep -A1 "^(ok-len 100 " | tail -1 | tr -d ' ()' || true)
F=$(echo "$OUT" | grep -A1 "^(ok-len 101 " | tail -1 | tr -d ' ()' || true)
# Also try plain (ok 100 N) format
[ -z "$P" ] && P=$(echo "$OUT" | grep "^(ok 100 " | awk '{print $3}' | tr -d ')' || true)
[ -z "$F" ] && F=$(echo "$OUT" | grep "^(ok 101 " | awk '{print $3}' | tr -d ')' || true)
[ -z "$P" ] && P=0; [ -z "$F" ] && F=0
SUITE_NAMES+=("$name")
SUITE_PASS+=("$P")
SUITE_FAIL+=("$F")
TOTAL_PASS=$((TOTAL_PASS + P))
TOTAL_FAIL=$((TOTAL_FAIL + F))
if [ "$F" = "0" ] && [ "${P:-0}" -gt 0 ] 2>/dev/null; then
echo " PASS $name ($P tests)"
else
echo " FAIL $name ($P passed, $F failed)"
fi
}
echo "=== Common Lisp on SX — Conformance Run ==="
echo ""
run_suite "Phase 1: tokenizer/reader" \
"lib/common-lisp/reader.sx lib/common-lisp/tests/read.sx" \
"cl-test-pass" "cl-test-fail" "cl-test-fails"
run_suite "Phase 1: parser/lambda-lists" \
"lib/common-lisp/reader.sx lib/common-lisp/parser.sx lib/common-lisp/tests/lambda.sx" \
"cl-test-pass" "cl-test-fail" "cl-test-fails"
run_suite "Phase 2: evaluator" \
"lib/common-lisp/reader.sx lib/common-lisp/parser.sx lib/common-lisp/eval.sx lib/common-lisp/tests/eval.sx" \
"cl-test-pass" "cl-test-fail" "cl-test-fails"
run_suite "Phase 3: condition system" \
"lib/common-lisp/runtime.sx lib/common-lisp/tests/conditions.sx" \
"passed" "failed" "failures"
run_suite "Phase 3: restart-demo" \
"lib/common-lisp/runtime.sx lib/common-lisp/tests/programs/restart-demo.sx" \
"demo-passed" "demo-failed" "demo-failures"
run_suite "Phase 3: parse-recover" \
"lib/common-lisp/runtime.sx lib/common-lisp/tests/programs/parse-recover.sx" \
"parse-passed" "parse-failed" "parse-failures"
run_suite "Phase 3: interactive-debugger" \
"lib/common-lisp/runtime.sx lib/common-lisp/tests/programs/interactive-debugger.sx" \
"debugger-passed" "debugger-failed" "debugger-failures"
run_suite "Phase 4: CLOS" \
"lib/common-lisp/runtime.sx lib/common-lisp/clos.sx lib/common-lisp/tests/clos.sx" \
"passed" "failed" "failures"
run_suite "Phase 4: geometry" \
"lib/common-lisp/runtime.sx lib/common-lisp/clos.sx lib/common-lisp/tests/programs/geometry.sx" \
"geo-passed" "geo-failed" "geo-failures"
run_suite "Phase 4: mop-trace" \
"lib/common-lisp/runtime.sx lib/common-lisp/clos.sx lib/common-lisp/tests/programs/mop-trace.sx" \
"mop-passed" "mop-failed" "mop-failures"
run_suite "Phase 5: macros+LOOP" \
"lib/common-lisp/reader.sx lib/common-lisp/parser.sx lib/common-lisp/eval.sx lib/common-lisp/loop.sx lib/common-lisp/tests/macros.sx" \
"macro-passed" "macro-failed" "macro-failures"
run_suite "Phase 6: stdlib" \
"lib/common-lisp/reader.sx lib/common-lisp/parser.sx lib/common-lisp/eval.sx lib/common-lisp/tests/stdlib.sx" \
"stdlib-passed" "stdlib-failed" "stdlib-failures"
echo ""
echo "=== Total: $TOTAL_PASS passed, $TOTAL_FAIL failed ==="
# ── write scoreboard.json ─────────────────────────────────────────────────
SCORE_DIR="lib/common-lisp"
JSON="$SCORE_DIR/scoreboard.json"
{
printf '{\n'
printf ' "generated": "%s",\n' "$(date -u +%Y-%m-%dT%H:%M:%SZ)"
printf ' "total_pass": %d,\n' "$TOTAL_PASS"
printf ' "total_fail": %d,\n' "$TOTAL_FAIL"
printf ' "suites": [\n'
first=true
for i in "${!SUITE_NAMES[@]}"; do
if [ "$first" = "true" ]; then first=false; else printf ',\n'; fi
printf ' {"name": "%s", "pass": %d, "fail": %d}' \
"${SUITE_NAMES[$i]}" "${SUITE_PASS[$i]}" "${SUITE_FAIL[$i]}"
done
printf '\n ]\n'
printf '}\n'
} > "$JSON"
# ── write scoreboard.md ───────────────────────────────────────────────────
MD="$SCORE_DIR/scoreboard.md"
{
printf '# Common Lisp on SX — Scoreboard\n\n'
printf '_Generated: %s_\n\n' "$(date -u '+%Y-%m-%d %H:%M UTC')"
printf '| Suite | Pass | Fail | Status |\n'
printf '|-------|------|------|--------|\n'
for i in "${!SUITE_NAMES[@]}"; do
p="${SUITE_PASS[$i]}" f="${SUITE_FAIL[$i]}"
status=""
if [ "$f" = "0" ] && [ "${p:-0}" -gt 0 ] 2>/dev/null; then
status="pass"
else
status="FAIL"
fi
printf '| %s | %s | %s | %s |\n' "${SUITE_NAMES[$i]}" "$p" "$f" "$status"
done
printf '\n**Total: %d passed, %d failed**\n' "$TOTAL_PASS" "$TOTAL_FAIL"
} > "$MD"
echo ""
echo "Scoreboard written to $JSON and $MD"
[ "$TOTAL_FAIL" -eq 0 ]

1391
lib/common-lisp/eval.sx Normal file

File diff suppressed because it is too large Load Diff

623
lib/common-lisp/loop.sx Normal file
View File

@@ -0,0 +1,623 @@
;; lib/common-lisp/loop.sx — The LOOP macro for CL-on-SX
;;
;; Supported clauses:
;; for VAR in LIST — iterate over list
;; for VAR across VECTOR — alias for 'in'
;; for VAR from N — numeric iteration (to/upto/below/downto/above/by)
;; for VAR = EXPR [then EXPR] — general iteration
;; while COND — stop when false
;; until COND — stop when true
;; repeat N — repeat N times
;; collect EXPR [into VAR]
;; append EXPR [into VAR]
;; nconc EXPR [into VAR]
;; sum EXPR [into VAR]
;; count EXPR [into VAR]
;; maximize EXPR [into VAR]
;; minimize EXPR [into VAR]
;; do FORM...
;; when/if COND clause...
;; unless COND clause...
;; finally FORM...
;; always COND
;; never COND
;; thereis COND
;; named BLOCK-NAME
;;
;; Depends on: lib/common-lisp/runtime.sx, lib/common-lisp/eval.sx already loaded.
;; Uses defmacro in the CL evaluator.
;; ── LOOP expansion driver ─────────────────────────────────────────────────
;; cl-loop-parse: analyse the flat LOOP clause list and build a Lisp form.
;; Returns a (block NAME (let (...) (tagbody ...))) form.
(define
cl-loop-parse
(fn
(clauses)
(define block-name nil)
(define with-bindings (list))
(define for-bindings (list))
(define test-forms (list))
(define repeat-var nil)
(define repeat-count nil)
(define body-forms (list))
(define accum-vars (dict))
(define accum-clauses (dict))
(define result-var nil)
(define finally-forms (list))
(define return-expr nil)
(define termination nil)
(define idx 0)
(define (lp-peek) (if (< idx (len clauses)) (nth clauses idx) nil))
(define
(next!)
(let ((v (lp-peek))) (do (set! idx (+ idx 1)) v)))
(define
(skip-if pred)
(if (and (not (nil? (lp-peek))) (pred (lp-peek))) (next!) nil))
(define (upcase-str s) (if (string? s) (upcase s) s))
(define (kw? s k) (= (upcase-str s) k))
(define
(make-accum-var!)
(if
(nil? result-var)
(do (set! result-var "#LOOP-RESULT") result-var)
result-var))
(define
(add-accum! type expr into-var)
(let
((v (if (nil? into-var) (make-accum-var!) into-var)))
(if
(not (has-key? accum-vars v))
(do
(set!
accum-vars
(assoc
accum-vars
v
(cond
((= type ":sum") 0)
((= type ":count") 0)
((= type ":maximize") nil)
((= type ":minimize") nil)
(:else (list)))))
(set! accum-clauses (assoc accum-clauses v type))))
(let
((update (cond ((= type ":collect") (list "SETQ" v (list "APPEND" v (list "LIST" expr)))) ((= type ":append") (list "SETQ" v (list "APPEND" v expr))) ((= type ":nconc") (list "SETQ" v (list "NCONC" v expr))) ((= type ":sum") (list "SETQ" v (list "+" v expr))) ((= type ":count") (list "SETQ" v (list "+" v (list "IF" expr 1 0)))) ((= type ":maximize") (list "SETQ" v (list "IF" (list "OR" (list "NULL" v) (list ">" expr v)) expr v))) ((= type ":minimize") (list "SETQ" v (list "IF" (list "OR" (list "NULL" v) (list "<" expr v)) expr v))) (:else (list "SETQ" v (list "APPEND" v (list "LIST" expr)))))))
(set! body-forms (append body-forms (list update))))))
(define
(parse-clause!)
(let
((tok (lp-peek)))
(if
(nil? tok)
nil
(do
(let
((u (upcase-str tok)))
(cond
((= u "NAMED")
(do (next!) (set! block-name (next!)) (parse-clause!)))
((= u "WITH")
(do
(next!)
(let
((var (next!)))
(skip-if (fn (s) (kw? s "=")))
(let
((init (next!)))
(set!
with-bindings
(append with-bindings (list (list var init))))
(parse-clause!)))))
((= u "FOR")
(do
(next!)
(let
((var (next!)))
(let
((kw2 (upcase-str (lp-peek))))
(cond
((or (= kw2 "IN") (= kw2 "ACROSS"))
(do
(next!)
(let
((lst-expr (next!))
(tail-var (str "#TAIL-" var)))
(set!
for-bindings
(append for-bindings (list {:list lst-expr :tail tail-var :type ":list" :var var})))
(parse-clause!))))
((= kw2 "=")
(do
(next!)
(let
((init-expr (next!)))
(let
((then-expr (if (kw? (lp-peek) "THEN") (do (next!) (next!)) init-expr)))
(set!
for-bindings
(append for-bindings (list {:type ":general" :then then-expr :init init-expr :var var})))
(parse-clause!)))))
((or (= kw2 "FROM") (= kw2 "DOWNFROM") (= kw2 "UPFROM"))
(do
(next!)
(let
((from-expr (next!))
(dir (if (= kw2 "DOWNFROM") ":down" ":up"))
(limit-expr nil)
(limit-type nil)
(step-expr 1))
(let
((lkw (upcase-str (lp-peek))))
(when
(or
(= lkw "TO")
(= lkw "UPTO")
(= lkw "BELOW")
(= lkw "DOWNTO")
(= lkw "ABOVE"))
(do
(next!)
(set! limit-type lkw)
(set! limit-expr (next!)))))
(when
(kw? (lp-peek) "BY")
(do (next!) (set! step-expr (next!))))
(set!
for-bindings
(append for-bindings (list {:dir dir :step step-expr :from from-expr :type ":numeric" :limit-type limit-type :var var :limit limit-expr})))
(parse-clause!))))
((or (= kw2 "TO") (= kw2 "UPTO") (= kw2 "BELOW"))
(do
(next!)
(let
((limit-expr (next!))
(step-expr 1))
(when
(kw? (lp-peek) "BY")
(do (next!) (set! step-expr (next!))))
(set!
for-bindings
(append for-bindings (list {:dir ":up" :step step-expr :from 0 :type ":numeric" :limit-type kw2 :var var :limit limit-expr})))
(parse-clause!))))
(:else (do (parse-clause!))))))))
((= u "WHILE")
(do
(next!)
(set! test-forms (append test-forms (list {:expr (next!) :type ":while"})))
(parse-clause!)))
((= u "UNTIL")
(do
(next!)
(set! test-forms (append test-forms (list {:expr (next!) :type ":until"})))
(parse-clause!)))
((= u "REPEAT")
(do
(next!)
(set! repeat-count (next!))
(set! repeat-var "#REPEAT-COUNT")
(parse-clause!)))
((or (= u "COLLECT") (= u "COLLECTING"))
(do
(next!)
(let
((expr (next!)) (into-var nil))
(when
(kw? (lp-peek) "INTO")
(do (next!) (set! into-var (next!))))
(add-accum! ":collect" expr into-var)
(parse-clause!))))
((or (= u "APPEND") (= u "APPENDING"))
(do
(next!)
(let
((expr (next!)) (into-var nil))
(when
(kw? (lp-peek) "INTO")
(do (next!) (set! into-var (next!))))
(add-accum! ":append" expr into-var)
(parse-clause!))))
((or (= u "NCONC") (= u "NCONCING"))
(do
(next!)
(let
((expr (next!)) (into-var nil))
(when
(kw? (lp-peek) "INTO")
(do (next!) (set! into-var (next!))))
(add-accum! ":nconc" expr into-var)
(parse-clause!))))
((or (= u "SUM") (= u "SUMMING"))
(do
(next!)
(let
((expr (next!)) (into-var nil))
(when
(kw? (lp-peek) "INTO")
(do (next!) (set! into-var (next!))))
(add-accum! ":sum" expr into-var)
(parse-clause!))))
((or (= u "COUNT") (= u "COUNTING"))
(do
(next!)
(let
((expr (next!)) (into-var nil))
(when
(kw? (lp-peek) "INTO")
(do (next!) (set! into-var (next!))))
(add-accum! ":count" expr into-var)
(parse-clause!))))
((or (= u "MAXIMIZE") (= u "MAXIMIZING"))
(do
(next!)
(let
((expr (next!)) (into-var nil))
(when
(kw? (lp-peek) "INTO")
(do (next!) (set! into-var (next!))))
(add-accum! ":maximize" expr into-var)
(parse-clause!))))
((or (= u "MINIMIZE") (= u "MINIMIZING"))
(do
(next!)
(let
((expr (next!)) (into-var nil))
(when
(kw? (lp-peek) "INTO")
(do (next!) (set! into-var (next!))))
(add-accum! ":minimize" expr into-var)
(parse-clause!))))
((= u "DO")
(do
(next!)
(define
(loop-kw? s)
(let
((us (upcase-str s)))
(some
(fn (k) (= us k))
(list
"FOR"
"WITH"
"WHILE"
"UNTIL"
"REPEAT"
"COLLECT"
"COLLECTING"
"APPEND"
"APPENDING"
"NCONC"
"NCONCING"
"SUM"
"SUMMING"
"COUNT"
"COUNTING"
"MAXIMIZE"
"MAXIMIZING"
"MINIMIZE"
"MINIMIZING"
"DO"
"WHEN"
"IF"
"UNLESS"
"FINALLY"
"ALWAYS"
"NEVER"
"THEREIS"
"RETURN"
"NAMED"))))
(define
(collect-do-forms!)
(if
(or (nil? (lp-peek)) (loop-kw? (lp-peek)))
nil
(do
(set!
body-forms
(append body-forms (list (next!))))
(collect-do-forms!))))
(collect-do-forms!)
(parse-clause!)))
((or (= u "WHEN") (= u "IF"))
(do
(next!)
(let
((cond-expr (next!))
(body-start (len body-forms)))
(parse-clause!)
;; wrap forms added since body-start in (WHEN cond ...)
(when (> (len body-forms) body-start)
(let ((added (list (nth body-forms body-start))))
(set! body-forms
(append
(if (> body-start 0)
(list (nth body-forms (- body-start 1)))
(list))
(list (list "WHEN" cond-expr (first added)))))
nil)))))
((= u "UNLESS")
(do
(next!)
(let
((cond-expr (next!))
(body-start (len body-forms)))
(parse-clause!)
(when (> (len body-forms) body-start)
(let ((added (list (nth body-forms body-start))))
(set! body-forms
(append
(if (> body-start 0)
(list (nth body-forms (- body-start 1)))
(list))
(list (list "UNLESS" cond-expr (first added)))))
nil)))))
((= u "ALWAYS")
(do (next!) (set! termination {:expr (next!) :type ":always"}) (parse-clause!)))
((= u "NEVER")
(do (next!) (set! termination {:expr (next!) :type ":never"}) (parse-clause!)))
((= u "THEREIS")
(do (next!) (set! termination {:expr (next!) :type ":thereis"}) (parse-clause!)))
((= u "RETURN")
(do (next!) (set! return-expr (next!)) (parse-clause!)))
((= u "FINALLY")
(do
(next!)
(define
(collect-finally!)
(if
(nil? (lp-peek))
nil
(do
(set!
finally-forms
(append finally-forms (list (next!))))
(collect-finally!))))
(collect-finally!)
(parse-clause!)))
(:else
(do
(set! body-forms (append body-forms (list (next!))))
(parse-clause!)))))))))
(parse-clause!)
(define let-bindings (list))
(for-each
(fn (wb) (set! let-bindings (append let-bindings (list wb))))
with-bindings)
(for-each
(fn
(v)
(set!
let-bindings
(append let-bindings (list (list v (get accum-vars v))))))
(keys accum-vars))
(when
(not (nil? repeat-var))
(set!
let-bindings
(append let-bindings (list (list repeat-var repeat-count)))))
(for-each
(fn
(fb)
(let
((type (get fb "type")))
(cond
((= type ":list")
(do
(set!
let-bindings
(append
let-bindings
(list (list (get fb "tail") (get fb "list")))
(list
(list
(get fb "var")
(list
"IF"
(list "CONSP" (get fb "tail"))
(list "CAR" (get fb "tail"))
nil)))))
nil))
((= type ":numeric")
(set!
let-bindings
(append
let-bindings
(list (list (get fb "var") (get fb "from"))))))
((= type ":general")
(set!
let-bindings
(append
let-bindings
(list (list (get fb "var") (get fb "init"))))))
(:else nil))))
for-bindings)
(define all-tests (list))
(when
(not (nil? repeat-var))
(set!
all-tests
(append
all-tests
(list
(list
"WHEN"
(list "<=" repeat-var 0)
(list "RETURN-FROM" block-name (if (nil? result-var) nil result-var))))))
(set!
body-forms
(append
(list (list "SETQ" repeat-var (list "-" repeat-var 1)))
body-forms)))
(for-each
(fn
(fb)
(when
(= (get fb "type") ":list")
(let
((tvar (get fb "tail")) (var (get fb "var")))
(set!
all-tests
(append
all-tests
(list
(list
"WHEN"
(list "NULL" tvar)
(list
"RETURN-FROM"
block-name
(if (nil? result-var) nil result-var))))))
(set!
body-forms
(append
body-forms
(list
(list "SETQ" tvar (list "CDR" tvar))
(list
"SETQ"
var
(list "IF" (list "CONSP" tvar) (list "CAR" tvar) nil))))))))
for-bindings)
(for-each
(fn
(fb)
(when
(= (get fb "type") ":numeric")
(let
((var (get fb "var"))
(dir (get fb "dir"))
(lim (get fb "limit"))
(ltype (get fb "limit-type"))
(step (get fb "step")))
(when
(not (nil? lim))
(let
((test-op (cond ((or (= ltype "BELOW") (= ltype "ABOVE")) (if (= dir ":up") ">=" "<=")) ((or (= ltype "TO") (= ltype "UPTO")) ">") ((= ltype "DOWNTO") "<") (:else (if (= dir ":up") ">" "<")))))
(set!
all-tests
(append
all-tests
(list
(list
"WHEN"
(list test-op var lim)
(list
"RETURN-FROM"
block-name
(if (nil? result-var) nil result-var))))))))
(let
((step-op (if (or (= dir ":down") (= ltype "DOWNTO") (= ltype "ABOVE")) "-" "+")))
(set!
body-forms
(append
body-forms
(list (list "SETQ" var (list step-op var step)))))))))
for-bindings)
(for-each
(fn
(fb)
(when
(= (get fb "type") ":general")
(set!
body-forms
(append
body-forms
(list (list "SETQ" (get fb "var") (get fb "then")))))))
for-bindings)
(for-each
(fn
(t)
(let
((type (get t "type")) (expr (get t "expr")))
(if
(= type ":while")
(set!
all-tests
(append
all-tests
(list
(list
"WHEN"
(list "NOT" expr)
(list
"RETURN-FROM"
block-name
(if (nil? result-var) nil result-var))))))
(set!
all-tests
(append
all-tests
(list
(list
"WHEN"
expr
(list
"RETURN-FROM"
block-name
(if (nil? result-var) nil result-var)))))))))
test-forms)
(when
(not (nil? termination))
(let
((type (get termination "type")) (expr (get termination "expr")))
(cond
((= type ":always")
(set!
body-forms
(append
body-forms
(list
(list "UNLESS" expr (list "RETURN-FROM" block-name false)))))
(set! return-expr true))
((= type ":never")
(set!
body-forms
(append
body-forms
(list
(list "WHEN" expr (list "RETURN-FROM" block-name false)))))
(set! return-expr true))
((= type ":thereis")
(set!
body-forms
(append
body-forms
(list
(list "WHEN" expr (list "RETURN-FROM" block-name expr)))))))))
(define tag "#LOOP-START")
(define
inner-body
(append (list tag) all-tests body-forms (list (list "GO" tag))))
(define
result-form
(cond
((not (nil? return-expr)) return-expr)
((not (nil? result-var)) result-var)
(:else nil)))
(define
full-body
(if
(= (len let-bindings) 0)
(append
(list "PROGN")
(list (append (list "TAGBODY") inner-body))
finally-forms
(list result-form))
(list
"LET*"
let-bindings
(append (list "TAGBODY") inner-body)
(append (list "PROGN") finally-forms (list result-form)))))
(list "BLOCK" block-name full-body)))
;; ── Install LOOP as a CL macro ────────────────────────────────────────────
;;
;; (loop ...) — the form arrives with head "LOOP" and rest = clauses.
;; The macro fn receives the full form.
(dict-set!
cl-macro-registry
"LOOP"
(fn (form env) (cl-loop-parse (rest form))))

377
lib/common-lisp/parser.sx Normal file
View File

@@ -0,0 +1,377 @@
;; Common Lisp reader — converts token stream to CL AST forms.
;;
;; Depends on: lib/common-lisp/reader.sx (cl-tokenize)
;;
;; AST representation:
;; integer/float → SX number (or {:cl-type "float"/:ratio ...})
;; string "hello" → {:cl-type "string" :value "hello"}
;; symbol FOO → SX string "FOO" (upcase)
;; symbol NIL → nil
;; symbol T → true
;; :keyword → {:cl-type "keyword" :name "FOO"}
;; #\char → {:cl-type "char" :value "a"}
;; #:uninterned → {:cl-type "uninterned" :name "FOO"}
;; ratio 1/3 → {:cl-type "ratio" :value "1/3"}
;; float 3.14 → {:cl-type "float" :value "3.14"}
;; proper list (a b c) → SX list (a b c)
;; dotted pair (a . b) → {:cl-type "cons" :car a :cdr b}
;; vector #(a b) → {:cl-type "vector" :elements (list a b)}
;; 'x → ("QUOTE" x)
;; `x → ("QUASIQUOTE" x)
;; ,x → ("UNQUOTE" x)
;; ,@x → ("UNQUOTE-SPLICING" x)
;; #'x → ("FUNCTION" x)
;;
;; Public API:
;; (cl-read src) — parse first form from string, return form
;; (cl-read-all src) — parse all top-level forms, return list
;; ── number conversion ─────────────────────────────────────────────
(define
cl-hex-val
(fn
(c)
(let
((o (cl-ord c)))
(cond
((and (>= o 48) (<= o 57)) (- o 48))
((and (>= o 65) (<= o 70)) (+ 10 (- o 65)))
((and (>= o 97) (<= o 102)) (+ 10 (- o 97)))
(:else 0)))))
(define
cl-parse-radix-str
(fn
(s radix start)
(let
((n (string-length s)) (i start) (acc 0))
(define
loop
(fn
()
(when
(< i n)
(do
(set! acc (+ (* acc radix) (cl-hex-val (substring s i (+ i 1)))))
(set! i (+ i 1))
(loop)))))
(loop)
acc)))
(define
cl-convert-integer
(fn
(s)
(let
((n (string-length s)) (neg false))
(cond
((and (> n 2) (= (substring s 0 1) "#"))
(let
((letter (downcase (substring s 1 2))))
(cond
((= letter "x") (cl-parse-radix-str s 16 2))
((= letter "b") (cl-parse-radix-str s 2 2))
((= letter "o") (cl-parse-radix-str s 8 2))
(:else (parse-int s 0)))))
(:else (parse-int s 0))))))
;; ── reader ────────────────────────────────────────────────────────
;; Read one form from token list.
;; Returns {:form F :rest remaining-toks} or {:form nil :rest toks :eof true}
(define
cl-read-form
(fn
(toks)
(if
(not toks)
{:form nil :rest toks :eof true}
(let
((tok (nth toks 0)) (nxt (rest toks)))
(let
((type (get tok "type")) (val (get tok "value")))
(cond
((= type "eof") {:form nil :rest toks :eof true})
((= type "integer") {:form (cl-convert-integer val) :rest nxt})
((= type "float") {:form {:cl-type "float" :value val} :rest nxt})
((= type "ratio") {:form {:cl-type "ratio" :value val} :rest nxt})
((= type "string") {:form {:cl-type "string" :value val} :rest nxt})
((= type "char") {:form {:cl-type "char" :value val} :rest nxt})
((= type "keyword") {:form {:cl-type "keyword" :name val} :rest nxt})
((= type "uninterned") {:form {:cl-type "uninterned" :name val} :rest nxt})
((= type "symbol")
(cond
((= val "NIL") {:form nil :rest nxt})
((= val "T") {:form true :rest nxt})
(:else {:form val :rest nxt})))
;; list forms
((= type "lparen") (cl-read-list nxt))
((= type "hash-paren") (cl-read-vector nxt))
;; reader macros that wrap the next form
((= type "quote") (cl-read-wrap "QUOTE" nxt))
((= type "backquote") (cl-read-wrap "QUASIQUOTE" nxt))
((= type "comma") (cl-read-wrap "UNQUOTE" nxt))
((= type "comma-at") (cl-read-wrap "UNQUOTE-SPLICING" nxt))
((= type "hash-quote") (cl-read-wrap "FUNCTION" nxt))
;; skip unrecognised tokens
(:else (cl-read-form nxt))))))))
;; Wrap next form in a list: (name form)
(define
cl-read-wrap
(fn
(name toks)
(let
((inner (cl-read-form toks)))
{:form (list name (get inner "form")) :rest (get inner "rest")})))
;; Read list forms until ')'; handles dotted pair (a . b)
;; Called after consuming '('
(define
cl-read-list
(fn
(toks)
(let
((result (cl-read-list-items toks (list))))
{:form (get result "items") :rest (get result "rest")})))
(define
cl-read-list-items
(fn
(toks acc)
(if
(not toks)
{:items acc :rest toks}
(let
((tok (nth toks 0)))
(let
((type (get tok "type")))
(cond
((= type "eof") {:items acc :rest toks})
((= type "rparen") {:items acc :rest (rest toks)})
;; dotted pair: read one more form then expect ')'
((= type "dot")
(let
((cdr-result (cl-read-form (rest toks))))
(let
((cdr-form (get cdr-result "form"))
(after-cdr (get cdr-result "rest")))
;; skip the closing ')'
(let
((close (if after-cdr (nth after-cdr 0) nil)))
(let
((remaining
(if
(and close (= (get close "type") "rparen"))
(rest after-cdr)
after-cdr)))
;; build dotted structure
(let
((dotted (cl-build-dotted acc cdr-form)))
{:items dotted :rest remaining}))))))
(:else
(let
((item (cl-read-form toks)))
(cl-read-list-items
(get item "rest")
(concat acc (list (get item "form"))))))))))))
;; Build dotted form: (a b . c) → ((DOTTED a b) . c) style
;; In CL (a b c . d) means a proper dotted structure.
;; We represent it as {:cl-type "cons" :car a :cdr (list->dotted b c d)}
(define
cl-build-dotted
(fn
(head-items tail)
(if
(= (len head-items) 0)
tail
(if
(= (len head-items) 1)
{:cl-type "cons" :car (nth head-items 0) :cdr tail}
(let
((last-item (nth head-items (- (len head-items) 1)))
(but-last (slice head-items 0 (- (len head-items) 1))))
{:cl-type "cons"
:car (cl-build-dotted but-last (list last-item))
:cdr tail})))))
;; Read vector #(…) elements until ')'
(define
cl-read-vector
(fn
(toks)
(let
((result (cl-read-vector-items toks (list))))
{:form {:cl-type "vector" :elements (get result "items")} :rest (get result "rest")})))
(define
cl-read-vector-items
(fn
(toks acc)
(if
(not toks)
{:items acc :rest toks}
(let
((tok (nth toks 0)))
(let
((type (get tok "type")))
(cond
((= type "eof") {:items acc :rest toks})
((= type "rparen") {:items acc :rest (rest toks)})
(:else
(let
((item (cl-read-form toks)))
(cl-read-vector-items
(get item "rest")
(concat acc (list (get item "form"))))))))))))
;; ── lambda-list parser ───────────────────────────────────────────
;;
;; (cl-parse-lambda-list forms) — parse a list of CL forms (already read)
;; into a structured dict:
;; {:required (list sym ...)
;; :optional (list {:name N :default D :supplied S} ...)
;; :rest nil | "SYM"
;; :key (list {:name N :keyword K :default D :supplied S} ...)
;; :allow-other-keys false | true
;; :aux (list {:name N :init I} ...)}
;;
;; Symbols arrive as SX strings (upcase). &-markers are strings like "&OPTIONAL".
;; Key params: keyword is the upcase name string; caller uses it as :keyword.
;; Supplied-p: nil when absent.
(define
cl-parse-opt-spec
(fn
(spec)
(if
(list? spec)
{:name (nth spec 0)
:default (if (> (len spec) 1) (nth spec 1) nil)
:supplied (if (> (len spec) 2) (nth spec 2) nil)}
{:name spec :default nil :supplied nil})))
(define
cl-parse-key-spec
(fn
(spec)
(if
(list? spec)
(let
((first (nth spec 0)))
(if
(list? first)
;; ((:keyword var) default supplied-p)
{:name (nth first 1)
:keyword (get first "name")
:default (if (> (len spec) 1) (nth spec 1) nil)
:supplied (if (> (len spec) 2) (nth spec 2) nil)}
;; (var default supplied-p)
{:name first
:keyword first
:default (if (> (len spec) 1) (nth spec 1) nil)
:supplied (if (> (len spec) 2) (nth spec 2) nil)}))
{:name spec :keyword spec :default nil :supplied nil})))
(define
cl-parse-aux-spec
(fn
(spec)
(if
(list? spec)
{:name (nth spec 0) :init (if (> (len spec) 1) (nth spec 1) nil)}
{:name spec :init nil})))
(define
cl-parse-lambda-list
(fn
(forms)
(let
((state "required")
(required (list))
(optional (list))
(rest-name nil)
(key (list))
(allow-other-keys false)
(aux (list)))
(define
scan
(fn
(items)
(when
(> (len items) 0)
(let
((item (nth items 0)) (tail (rest items)))
(cond
((= item "&OPTIONAL")
(do (set! state "optional") (scan tail)))
((= item "&REST")
(do (set! state "rest") (scan tail)))
((= item "&BODY")
(do (set! state "rest") (scan tail)))
((= item "&KEY")
(do (set! state "key") (scan tail)))
((= item "&AUX")
(do (set! state "aux") (scan tail)))
((= item "&ALLOW-OTHER-KEYS")
(do (set! allow-other-keys true) (scan tail)))
((= state "required")
(do (append! required item) (scan tail)))
((= state "optional")
(do (append! optional (cl-parse-opt-spec item)) (scan tail)))
((= state "rest")
(do (set! rest-name item) (set! state "done") (scan tail)))
((= state "key")
(do (append! key (cl-parse-key-spec item)) (scan tail)))
((= state "aux")
(do (append! aux (cl-parse-aux-spec item)) (scan tail)))
(:else (scan tail)))))))
(scan forms)
{:required required
:optional optional
:rest rest-name
:key key
:allow-other-keys allow-other-keys
:aux aux})))
;; Convenience: parse lambda list from a CL source string
(define
cl-parse-lambda-list-str
(fn
(src)
(cl-parse-lambda-list (cl-read src))))
;; ── public API ────────────────────────────────────────────────────
(define
cl-read
(fn
(src)
(let
((toks (cl-tokenize src)))
(get (cl-read-form toks) "form"))))
(define
cl-read-all
(fn
(src)
(let
((toks (cl-tokenize src)))
(define
loop
(fn
(toks acc)
(if
(or (not toks) (= (get (nth toks 0) "type") "eof"))
acc
(let
((result (cl-read-form toks)))
(if
(get result "eof")
acc
(loop (get result "rest") (concat acc (list (get result "form")))))))))
(loop toks (list)))))

381
lib/common-lisp/reader.sx Normal file
View File

@@ -0,0 +1,381 @@
;; Common Lisp tokenizer
;;
;; Tokens: {:type T :value V :pos P}
;;
;; Types:
;; "symbol" — FOO, PKG:SYM, PKG::SYM, T, NIL (upcase)
;; "keyword" — :foo (value is upcase name without colon)
;; "integer" — 42, -5, #xFF, #b1010, #o17 (string)
;; "float" — 3.14, 1.0e10 (string)
;; "ratio" — 1/3 (string "N/D")
;; "string" — unescaped content
;; "char" — single-character string
;; "lparen" "rparen" "quote" "backquote" "comma" "comma-at"
;; "hash-quote" — #'
;; "hash-paren" — #(
;; "uninterned" — #:foo (upcase name)
;; "dot" — standalone . (dotted pair separator)
;; "eof"
(define cl-make-tok (fn (type value pos) {:type type :value value :pos pos}))
;; ── char ordinal table ────────────────────────────────────────────
(define
cl-ord-table
(let
((t (dict)) (i 0))
(define
cl-fill
(fn
()
(when
(< i 128)
(do
(dict-set! t (char-from-code i) i)
(set! i (+ i 1))
(cl-fill)))))
(cl-fill)
t))
(define cl-ord (fn (c) (or (get cl-ord-table c) 0)))
;; ── character predicates ──────────────────────────────────────────
(define cl-digit? (fn (c) (and (>= (cl-ord c) 48) (<= (cl-ord c) 57))))
(define
cl-hex?
(fn
(c)
(or
(cl-digit? c)
(and (>= (cl-ord c) 65) (<= (cl-ord c) 70))
(and (>= (cl-ord c) 97) (<= (cl-ord c) 102)))))
(define cl-octal? (fn (c) (and (>= (cl-ord c) 48) (<= (cl-ord c) 55))))
(define cl-binary? (fn (c) (or (= c "0") (= c "1"))))
(define cl-ws? (fn (c) (or (= c " ") (= c "\t") (= c "\n") (= c "\r"))))
(define
cl-alpha?
(fn
(c)
(or
(and (>= (cl-ord c) 65) (<= (cl-ord c) 90))
(and (>= (cl-ord c) 97) (<= (cl-ord c) 122)))))
;; Characters that end a token (whitespace + terminating macro chars)
(define
cl-terminating?
(fn
(c)
(or
(cl-ws? c)
(= c "(")
(= c ")")
(= c "\"")
(= c ";")
(= c "`")
(= c ","))))
;; Symbol constituent: not terminating, not reader-special
(define
cl-sym-char?
(fn
(c)
(not
(or
(cl-terminating? c)
(= c "#")
(= c "|")
(= c "\\")
(= c "'")))))
;; ── named character table ─────────────────────────────────────────
(define
cl-named-chars
{:space " "
:newline "\n"
:tab "\t"
:return "\r"
:backspace (char-from-code 8)
:rubout (char-from-code 127)
:delete (char-from-code 127)
:escape (char-from-code 27)
:altmode (char-from-code 27)
:null (char-from-code 0)
:nul (char-from-code 0)
:page (char-from-code 12)
:formfeed (char-from-code 12)})
;; ── main tokenizer ────────────────────────────────────────────────
(define
cl-tokenize
(fn
(src)
(let
((pos 0) (n (string-length src)) (toks (list)))
(define at (fn () (if (< pos n) (substring src pos (+ pos 1)) nil)))
(define peek1 (fn () (if (< (+ pos 1) n) (substring src (+ pos 1) (+ pos 2)) nil)))
(define adv (fn () (set! pos (+ pos 1))))
;; Advance while predicate holds; return substring from start to end
(define
read-while
(fn
(pred)
(let
((start pos))
(define
rw-loop
(fn
()
(when
(and (at) (pred (at)))
(do (adv) (rw-loop)))))
(rw-loop)
(substring src start pos))))
(define
skip-line
(fn
()
(when
(and (at) (not (= (at) "\n")))
(do (adv) (skip-line)))))
(define
skip-block
(fn
(depth)
(when
(at)
(cond
((and (= (at) "#") (= (peek1) "|"))
(do (adv) (adv) (skip-block (+ depth 1))))
((and (= (at) "|") (= (peek1) "#"))
(do
(adv)
(adv)
(when (> depth 1) (skip-block (- depth 1)))))
(:else (do (adv) (skip-block depth)))))))
;; Read string literal — called with pos just past opening "
(define
read-str
(fn
(acc)
(if
(not (at))
acc
(cond
((= (at) "\"") (do (adv) acc))
((= (at) "\\")
(do
(adv)
(let
((e (at)))
(adv)
(read-str
(str
acc
(cond
((= e "n") "\n")
((= e "t") "\t")
((= e "r") "\r")
((= e "\"") "\"")
((= e "\\") "\\")
(:else e)))))))
(:else
(let
((c (at)))
(adv)
(read-str (str acc c))))))))
;; Read #\ char literal — called with pos just past the backslash
(define
read-char-lit
(fn
()
(let
((first (at)))
(adv)
(let
((rest (if (and (at) (cl-alpha? (at))) (read-while cl-alpha?) "")))
(if
(= rest "")
first
(let
((name (downcase (str first rest))))
(or (get cl-named-chars name) first)))))))
;; Number scanner — called with pos just past first digit(s).
;; acc holds what was already consumed (first digit or sign+digit).
(define
scan-num
(fn
(p acc)
(let
((more (read-while cl-digit?)))
(set! acc (str acc more))
(cond
;; ratio N/D
((and (at) (= (at) "/") (peek1) (cl-digit? (peek1)))
(do
(adv)
(let
((denom (read-while cl-digit?)))
{:type "ratio" :value (str acc "/" denom) :pos p})))
;; float: decimal point N.M[eE]
((and (at) (= (at) ".") (peek1) (cl-digit? (peek1)))
(do
(adv)
(let
((frac (read-while cl-digit?)))
(set! acc (str acc "." frac))
(when
(and (at) (or (= (at) "e") (= (at) "E")))
(do
(set! acc (str acc (at)))
(adv)
(when
(and (at) (or (= (at) "+") (= (at) "-")))
(do (set! acc (str acc (at))) (adv)))
(set! acc (str acc (read-while cl-digit?)))))
{:type "float" :value acc :pos p})))
;; float: exponent only NeE
((and (at) (or (= (at) "e") (= (at) "E")))
(do
(set! acc (str acc (at)))
(adv)
(when
(and (at) (or (= (at) "+") (= (at) "-")))
(do (set! acc (str acc (at))) (adv)))
(set! acc (str acc (read-while cl-digit?)))
{:type "float" :value acc :pos p}))
(:else {:type "integer" :value acc :pos p})))))
(define
read-radix
(fn
(letter p)
(let
((pred
(cond
((or (= letter "x") (= letter "X")) cl-hex?)
((or (= letter "b") (= letter "B")) cl-binary?)
((or (= letter "o") (= letter "O")) cl-octal?)
(:else cl-digit?))))
{:type "integer"
:value (str "#" letter (read-while pred))
:pos p})))
(define emit (fn (tok) (append! toks tok)))
(define
scan
(fn
()
(when
(< pos n)
(let
((c (at)) (p pos))
(cond
((cl-ws? c) (do (adv) (scan)))
((= c ";") (do (adv) (skip-line) (scan)))
((= c "(") (do (adv) (emit (cl-make-tok "lparen" "(" p)) (scan)))
((= c ")") (do (adv) (emit (cl-make-tok "rparen" ")" p)) (scan)))
((= c "'") (do (adv) (emit (cl-make-tok "quote" "'" p)) (scan)))
((= c "`") (do (adv) (emit (cl-make-tok "backquote" "`" p)) (scan)))
((= c ",")
(do
(adv)
(if
(= (at) "@")
(do (adv) (emit (cl-make-tok "comma-at" ",@" p)))
(emit (cl-make-tok "comma" "," p)))
(scan)))
((= c "\"")
(do
(adv)
(emit (cl-make-tok "string" (read-str "") p))
(scan)))
;; :keyword
((= c ":")
(do
(adv)
(emit (cl-make-tok "keyword" (upcase (read-while cl-sym-char?)) p))
(scan)))
;; dispatch macro #
((= c "#")
(do
(adv)
(let
((d (at)))
(cond
((= d "'") (do (adv) (emit (cl-make-tok "hash-quote" "#'" p)) (scan)))
((= d "(") (do (adv) (emit (cl-make-tok "hash-paren" "#(" p)) (scan)))
((= d ":")
(do
(adv)
(emit
(cl-make-tok "uninterned" (upcase (read-while cl-sym-char?)) p))
(scan)))
((= d "|") (do (adv) (skip-block 1) (scan)))
((= d "\\")
(do (adv) (emit (cl-make-tok "char" (read-char-lit) p)) (scan)))
((or (= d "x") (= d "X"))
(do (adv) (emit (read-radix d p)) (scan)))
((or (= d "b") (= d "B"))
(do (adv) (emit (read-radix d p)) (scan)))
((or (= d "o") (= d "O"))
(do (adv) (emit (read-radix d p)) (scan)))
(:else (scan))))))
;; standalone dot, float .5, or symbol starting with dots
((= c ".")
(do
(adv)
(cond
((or (not (at)) (cl-terminating? (at)))
(do (emit (cl-make-tok "dot" "." p)) (scan)))
((cl-digit? (at))
(do
(emit
(cl-make-tok "float" (str "0." (read-while cl-digit?)) p))
(scan)))
(:else
(do
(emit
(cl-make-tok "symbol" (upcase (str "." (read-while cl-sym-char?))) p))
(scan))))))
;; sign followed by digit → number
((and (or (= c "+") (= c "-")) (peek1) (cl-digit? (peek1)))
(do
(adv)
(let
((first-d (at)))
(adv)
(emit (scan-num p (str c first-d))))
(scan)))
;; decimal digit → number
((cl-digit? c)
(do
(adv)
(emit (scan-num p c))
(scan)))
;; symbol constituent (includes bare +, -, etc.)
((cl-sym-char? c)
(do
(emit (cl-make-tok "symbol" (upcase (read-while cl-sym-char?)) p))
(scan)))
(:else (do (adv) (scan))))))))
(scan)
(append! toks (cl-make-tok "eof" nil n))
toks)))

View File

@@ -1,18 +1,14 @@
;; lib/common-lisp/runtime.sx — CL built-ins using SX spec primitives
;; lib/common-lisp/runtime.sx — CL built-ins + condition system on SX
;;
;; Provides CL-specific wrappers and helpers. Deliberately thin: wherever
;; an SX spec primitive already does the job, we alias it rather than
;; reinventing it.
;; Section 1-9: Type predicates, arithmetic, characters, strings, gensym,
;; multiple values, sets, radix formatting, list utilities.
;; Section 10: Condition system (define-condition, signal/error/warn,
;; handler-bind, handler-case, restart-case, invoke-restart).
;;
;; Primitives used from spec:
;; char/char->integer/integer->char/char-upcase/char-downcase
;; format (Phase 21 — must be loaded before this file)
;; gensym (Phase 12)
;; rational/rational? (Phase 16)
;; make-set/set-member?/set-union/etc (Phase 18)
;; open-input-string/read-char/etc (Phase 14)
;; modulo/remainder/quotient/gcd/lcm/expt (Phase 2 / Phase 15)
;; number->string with radix (Phase 15)
;; format gensym rational/rational? make-set/set-member?/etc
;; modulo/remainder/quotient/gcd/lcm/expt number->string
;; ---------------------------------------------------------------------------
;; 1. Type predicates
@@ -304,3 +300,425 @@
((or (cl-empty? plist) (cl-empty? (rest plist))) nil)
((equal? (first plist) key) (first (rest plist)))
(else (cl-getf (rest (rest plist)) key))))
;; ---------------------------------------------------------------------------
;; 10. Condition system (Phase 3)
;;
;; Condition objects:
;; {:cl-type "cl-condition" :class "NAME" :slots {slot-name val ...}}
;;
;; The built-in handler-bind / restart-case expect LITERAL handler specs in
;; source (they operate on the raw AST), so we implement our own handler and
;; restart stacks as mutable SX globals.
;; ---------------------------------------------------------------------------
;; ── condition class registry ───────────────────────────────────────────────
;;
;; Populated at load time with all ANSI standard condition types.
;; Also mutated by cl-define-condition.
(define
cl-condition-classes
(dict
"condition"
{:parents (list) :slots (list) :name "condition"}
"serious-condition"
{:parents (list "condition") :slots (list) :name "serious-condition"}
"error"
{:parents (list "serious-condition") :slots (list) :name "error"}
"warning"
{:parents (list "condition") :slots (list) :name "warning"}
"simple-condition"
{:parents (list "condition") :slots (list "format-control" "format-arguments") :name "simple-condition"}
"simple-error"
{:parents (list "error" "simple-condition") :slots (list "format-control" "format-arguments") :name "simple-error"}
"simple-warning"
{:parents (list "warning" "simple-condition") :slots (list "format-control" "format-arguments") :name "simple-warning"}
"type-error"
{:parents (list "error") :slots (list "datum" "expected-type") :name "type-error"}
"arithmetic-error"
{:parents (list "error") :slots (list "operation" "operands") :name "arithmetic-error"}
"division-by-zero"
{:parents (list "arithmetic-error") :slots (list) :name "division-by-zero"}
"cell-error"
{:parents (list "error") :slots (list "name") :name "cell-error"}
"unbound-variable"
{:parents (list "cell-error") :slots (list) :name "unbound-variable"}
"undefined-function"
{:parents (list "cell-error") :slots (list) :name "undefined-function"}
"program-error"
{:parents (list "error") :slots (list) :name "program-error"}
"storage-condition"
{:parents (list "serious-condition") :slots (list) :name "storage-condition"}))
;; ── condition predicates ───────────────────────────────────────────────────
(define
cl-condition?
(fn (x) (and (dict? x) (= (get x "cl-type") "cl-condition"))))
;; cl-condition-of-type? walks the class hierarchy.
;; We capture cl-condition-classes at define time via let to avoid
;; free-variable scoping issues at call time.
(define
cl-condition-of-type?
(let
((classes cl-condition-classes))
(fn
(c type-name)
(if
(not (cl-condition? c))
false
(let
((class-name (get c "class")))
(define
check
(fn
(n)
(if
(= n type-name)
true
(let
((entry (get classes n)))
(if
(nil? entry)
false
(some (fn (p) (check p)) (get entry "parents")))))))
(check class-name))))))
;; ── condition constructors ─────────────────────────────────────────────────
;; cl-define-condition registers a new condition class.
;; name: string (condition class name)
;; parents: list of strings (parent class names)
;; slot-names: list of strings
(define
cl-define-condition
(fn
(name parents slot-names)
(begin (dict-set! cl-condition-classes name {:parents parents :slots slot-names :name name}) name)))
;; cl-make-condition constructs a condition object.
;; Keyword args (alternating slot-name/value pairs) populate the slots dict.
(define
cl-make-condition
(fn
(name &rest kw-args)
(let
((slots (dict)))
(define
fill
(fn
(args)
(when
(>= (len args) 2)
(begin
(dict-set! slots (first args) (first (rest args)))
(fill (rest (rest args)))))))
(fill kw-args)
{:cl-type "cl-condition" :slots slots :class name})))
;; ── condition accessors ────────────────────────────────────────────────────
(define
cl-condition-slot
(fn
(c slot-name)
(if (cl-condition? c) (get (get c "slots") slot-name) nil)))
(define
cl-condition-message
(fn
(c)
(if
(not (cl-condition? c))
(str c)
(let
((slots (get c "slots")))
(or
(get slots "message")
(get slots "format-control")
(str "Condition: " (get c "class")))))))
(define
cl-simple-condition-format-control
(fn (c) (cl-condition-slot c "format-control")))
(define
cl-simple-condition-format-arguments
(fn (c) (cl-condition-slot c "format-arguments")))
(define cl-type-error-datum (fn (c) (cl-condition-slot c "datum")))
(define
cl-type-error-expected-type
(fn (c) (cl-condition-slot c "expected-type")))
(define
cl-arithmetic-error-operation
(fn (c) (cl-condition-slot c "operation")))
(define
cl-arithmetic-error-operands
(fn (c) (cl-condition-slot c "operands")))
;; ── mutable handler + restart stacks ──────────────────────────────────────
;;
;; Handler entry: {:type "type-name" :fn (fn (condition) result)}
;; Restart entry: {:name "restart-name" :fn (fn (&optional arg) result) :escape k}
;;
;; New handlers are prepended (checked first = most recent handler wins).
(define cl-handler-stack (list))
(define cl-restart-stack (list))
(define
cl-push-handlers
(fn (entries) (set! cl-handler-stack (append entries cl-handler-stack))))
(define
cl-pop-handlers
(fn
(n)
(set! cl-handler-stack (slice cl-handler-stack n (len cl-handler-stack)))))
(define
cl-push-restarts
(fn (entries) (set! cl-restart-stack (append entries cl-restart-stack))))
(define
cl-pop-restarts
(fn
(n)
(set! cl-restart-stack (slice cl-restart-stack n (len cl-restart-stack)))))
;; ── *debugger-hook* + invoke-debugger ────────────────────────────────────
;;
;; cl-debugger-hook: called when an error propagates with no handler.
;; Signature: (fn (condition hook) result). The hook arg is itself
;; (so the hook can rebind it to nil to prevent recursion).
;; nil = use default (re-raise as host error).
(define cl-debugger-hook nil)
(define cl-invoke-debugger
(fn (c)
(if (nil? cl-debugger-hook)
(error (str "Debugger: " (cl-condition-message c)))
(let ((hook cl-debugger-hook))
(set! cl-debugger-hook nil)
(let ((result (hook c hook)))
(set! cl-debugger-hook hook)
result)))))
;; ── *break-on-signals* ────────────────────────────────────────────────────
;;
;; When set to a type name string, cl-signal invokes the debugger hook
;; before walking handlers if the condition is of that type.
;; nil = disabled (ANSI default).
(define cl-break-on-signals nil)
;; ── invoke-restart-interactively ──────────────────────────────────────────
;;
;; Like invoke-restart but calls the restart's fn with no arguments
;; (real CL would prompt the user for each arg via :interactive).
(define cl-invoke-restart-interactively
(fn (name)
(let ((entry (cl-find-restart-entry name cl-restart-stack)))
(if (nil? entry)
(error (str "No active restart: " name))
(let ((restart-fn (get entry "fn"))
(escape (get entry "escape")))
(escape (restart-fn)))))))
;; ── cl-signal (non-unwinding) ─────────────────────────────────────────────
;;
;; Walks cl-handler-stack; for each matching entry, calls the handler fn.
;; Handlers return normally — signal continues to the next matching handler.
(define
cl-signal-obj
(fn
(obj stack)
(if
(empty? stack)
nil
(let
((entry (first stack)))
(if
(cl-condition-of-type? obj (get entry "type"))
(begin ((get entry "fn") obj) (cl-signal-obj obj (rest stack)))
(cl-signal-obj obj (rest stack)))))))
(define cl-signal
(fn (c)
(let ((obj (if (cl-condition? c)
c
(cl-make-condition "simple-condition"
"format-control" (str c)))))
;; *break-on-signals*: invoke debugger hook when type matches
(when (and (not (nil? cl-break-on-signals))
(cl-condition-of-type? obj cl-break-on-signals))
(cl-invoke-debugger obj))
(cl-signal-obj obj cl-handler-stack))))
;; ── cl-error ───────────────────────────────────────────────────────────────
;;
;; Signals an error. If no handler catches it, raises a host-level error.
(define
cl-error
(fn
(c &rest args)
(let
((obj (cond ((cl-condition? c) c) ((string? c) (cl-make-condition "simple-error" "format-control" c "format-arguments" args)) (:else (cl-make-condition "simple-error" "format-control" (str c))))))
(cl-signal-obj obj cl-handler-stack)
(cl-invoke-debugger obj))))
;; ── cl-warn ────────────────────────────────────────────────────────────────
(define
cl-warn
(fn
(c &rest args)
(let
((obj (cond ((cl-condition? c) c) ((string? c) (cl-make-condition "simple-warning" "format-control" c "format-arguments" args)) (:else (cl-make-condition "simple-warning" "format-control" (str c))))))
(cl-signal-obj obj cl-handler-stack))))
;; ── cl-handler-bind (non-unwinding) ───────────────────────────────────────
;;
;; bindings: list of (type-name handler-fn) pairs
;; thunk: (fn () body)
(define
cl-handler-bind
(fn
(bindings thunk)
(let
((entries (map (fn (b) {:fn (first (rest b)) :type (first b)}) bindings)))
(begin
(cl-push-handlers entries)
(let
((result (thunk)))
(begin (cl-pop-handlers (len entries)) result))))))
;; ── cl-handler-case (unwinding) ───────────────────────────────────────────
;;
;; thunk: (fn () body)
;; cases: list of (type-name handler-fn) pairs
;;
;; Uses call/cc for the escape continuation.
(define
cl-handler-case
(fn
(thunk &rest cases)
(call/cc
(fn
(escape)
(let
((entries (map (fn (c) {:fn (fn (x) (escape ((first (rest c)) x))) :type (first c)}) cases)))
(begin
(cl-push-handlers entries)
(let
((result (thunk)))
(begin (cl-pop-handlers (len entries)) result))))))))
;; ── cl-restart-case ────────────────────────────────────────────────────────
;;
;; thunk: (fn () body)
;; restarts: list of (name params body-fn) triples
;; body-fn is (fn () val) or (fn (arg) val)
(define
cl-restart-case
(fn
(thunk &rest restarts)
(call/cc
(fn
(escape)
(let
((entries (map (fn (r) {:fn (first (rest (rest r))) :escape escape :name (first r)}) restarts)))
(begin
(cl-push-restarts entries)
(let
((result (thunk)))
(begin (cl-pop-restarts (len entries)) result))))))))
;; ── cl-with-simple-restart ─────────────────────────────────────────────────
(define
cl-with-simple-restart
(fn
(name description thunk)
(cl-restart-case thunk (list name (list) (fn () nil)))))
;; ── find-restart / invoke-restart / compute-restarts ──────────────────────
(define
cl-find-restart-entry
(fn
(name stack)
(if
(empty? stack)
nil
(let
((entry (first stack)))
(if
(= (get entry "name") name)
entry
(cl-find-restart-entry name (rest stack)))))))
(define
cl-find-restart
(fn (name) (cl-find-restart-entry name cl-restart-stack)))
(define
cl-invoke-restart
(fn
(name &rest args)
(let
((entry (cl-find-restart-entry name cl-restart-stack)))
(if
(nil? entry)
(error (str "No active restart: " name))
(let
((restart-fn (get entry "fn")) (escape (get entry "escape")))
(escape
(if (empty? args) (restart-fn) (restart-fn (first args)))))))))
(define
cl-compute-restarts
(fn () (map (fn (e) (get e "name")) cl-restart-stack)))
;; ── with-condition-restarts (stub — association is advisory) ──────────────
(define cl-with-condition-restarts (fn (c restarts thunk) (thunk)))
;; ── cl-cerror ──────────────────────────────────────────────────────────────
;;
;; Signals a continuable error. The "continue" restart is established;
;; invoke-restart "continue" to proceed past the error.
;; ── cl-cerror ──────────────────────────────────────────────────────────────
;;
;; Signals a continuable error. The "continue" restart is established;
;; invoke-restart "continue" to proceed past the error.
(define cl-cerror
(fn (continue-string c &rest args)
(let ((obj (if (cl-condition? c)
c
(cl-make-condition "simple-error"
"format-control" (str c)
"format-arguments" args))))
(cl-restart-case
(fn () (cl-signal-obj obj cl-handler-stack))
(list "continue" (list) (fn () nil))))))

View File

@@ -0,0 +1,19 @@
{
"generated": "2026-05-05T12:35:09Z",
"total_pass": 518,
"total_fail": 0,
"suites": [
{"name": "Phase 1: tokenizer/reader", "pass": 79, "fail": 0},
{"name": "Phase 1: parser/lambda-lists", "pass": 31, "fail": 0},
{"name": "Phase 2: evaluator", "pass": 182, "fail": 0},
{"name": "Phase 3: condition system", "pass": 59, "fail": 0},
{"name": "Phase 3: restart-demo", "pass": 7, "fail": 0},
{"name": "Phase 3: parse-recover", "pass": 6, "fail": 0},
{"name": "Phase 3: interactive-debugger", "pass": 7, "fail": 0},
{"name": "Phase 4: CLOS", "pass": 41, "fail": 0},
{"name": "Phase 4: geometry", "pass": 12, "fail": 0},
{"name": "Phase 4: mop-trace", "pass": 13, "fail": 0},
{"name": "Phase 5: macros+LOOP", "pass": 27, "fail": 0},
{"name": "Phase 6: stdlib", "pass": 54, "fail": 0}
]
}

View File

@@ -0,0 +1,20 @@
# Common Lisp on SX — Scoreboard
_Generated: 2026-05-05 12:35 UTC_
| Suite | Pass | Fail | Status |
|-------|------|------|--------|
| Phase 1: tokenizer/reader | 79 | 0 | pass |
| Phase 1: parser/lambda-lists | 31 | 0 | pass |
| Phase 2: evaluator | 182 | 0 | pass |
| Phase 3: condition system | 59 | 0 | pass |
| Phase 3: restart-demo | 7 | 0 | pass |
| Phase 3: parse-recover | 6 | 0 | pass |
| Phase 3: interactive-debugger | 7 | 0 | pass |
| Phase 4: CLOS | 41 | 0 | pass |
| Phase 4: geometry | 12 | 0 | pass |
| Phase 4: mop-trace | 13 | 0 | pass |
| Phase 5: macros+LOOP | 27 | 0 | pass |
| Phase 6: stdlib | 54 | 0 | pass |
**Total: 518 passed, 0 failed**

View File

@@ -292,6 +292,147 @@ check 113 "cl-format-decimal 42" '"42"'
check 114 "n->s base 16" '"1f"'
check 115 "s->n base 16" "31"
# ── Phase 2: condition system unit tests ─────────────────────────────────────
# Load runtime.sx then conditions.sx; query the passed/failed/failures globals.
UNIT_FILE=$(mktemp); trap "rm -f $UNIT_FILE" EXIT
cat > "$UNIT_FILE" << 'UNIT'
(epoch 1)
(load "spec/stdlib.sx")
(epoch 2)
(load "lib/common-lisp/runtime.sx")
(epoch 3)
(load "lib/common-lisp/tests/conditions.sx")
(epoch 4)
(eval "passed")
(epoch 5)
(eval "failed")
(epoch 6)
(eval "failures")
UNIT
UNIT_OUT=$(timeout 30 "$SX_SERVER" < "$UNIT_FILE" 2>/dev/null)
# extract passed/failed counts from ok-len lines
UNIT_PASSED=$(echo "$UNIT_OUT" | grep -A1 "^(ok-len 4 " | tail -1 || true)
UNIT_FAILED=$(echo "$UNIT_OUT" | grep -A1 "^(ok-len 5 " | tail -1 || true)
UNIT_ERRS=$(echo "$UNIT_OUT" | grep -A1 "^(ok-len 6 " | tail -1 || true)
# fallback: try plain ok lines
[ -z "$UNIT_PASSED" ] && UNIT_PASSED=$(echo "$UNIT_OUT" | grep "^(ok 4 " | awk '{print $3}' | tr -d ')' || true)
[ -z "$UNIT_FAILED" ] && UNIT_FAILED=$(echo "$UNIT_OUT" | grep "^(ok 5 " | awk '{print $3}' | tr -d ')' || true)
[ -z "$UNIT_PASSED" ] && UNIT_PASSED=0
[ -z "$UNIT_FAILED" ] && UNIT_FAILED=0
if [ "$UNIT_FAILED" = "0" ] && [ "$UNIT_PASSED" -gt 0 ] 2>/dev/null; then
PASS=$((PASS + UNIT_PASSED))
[ "$VERBOSE" = "-v" ] && echo " ok condition tests ($UNIT_PASSED)"
else
FAIL=$((FAIL + 1))
ERRORS+=" FAIL [condition tests] (${UNIT_PASSED} passed, ${UNIT_FAILED} failed) ${UNIT_ERRS}
"
fi
# ── Phase 3: classic program tests ───────────────────────────────────────────
run_program_suite() {
local prog="$1" pass_var="$2" fail_var="$3" failures_var="$4"
local PROG_FILE=$(mktemp)
printf '(epoch 1)\n(load "spec/stdlib.sx")\n(epoch 2)\n(load "lib/common-lisp/runtime.sx")\n(epoch 3)\n(load "%s")\n(epoch 4)\n(eval "%s")\n(epoch 5)\n(eval "%s")\n(epoch 6)\n(eval "%s")\n' \
"$prog" "$pass_var" "$fail_var" "$failures_var" > "$PROG_FILE"
local OUT; OUT=$(timeout 20 "$SX_SERVER" < "$PROG_FILE" 2>/dev/null)
rm -f "$PROG_FILE"
local P F
P=$(echo "$OUT" | grep -A1 "^(ok-len 4 " | tail -1 || true)
F=$(echo "$OUT" | grep -A1 "^(ok-len 5 " | tail -1 || true)
local ERRS; ERRS=$(echo "$OUT" | grep -A1 "^(ok-len 6 " | tail -1 || true)
[ -z "$P" ] && P=0; [ -z "$F" ] && F=0
if [ "$F" = "0" ] && [ "$P" -gt 0 ] 2>/dev/null; then
PASS=$((PASS + P))
[ "$VERBOSE" = "-v" ] && echo " ok $prog ($P)"
else
FAIL=$((FAIL + 1))
ERRORS+=" FAIL [$prog] (${P} passed, ${F} failed) ${ERRS}
"
fi
}
run_program_suite \
"lib/common-lisp/tests/programs/restart-demo.sx" \
"demo-passed" "demo-failed" "demo-failures"
run_program_suite \
"lib/common-lisp/tests/programs/parse-recover.sx" \
"parse-passed" "parse-failed" "parse-failures"
run_program_suite \
"lib/common-lisp/tests/programs/interactive-debugger.sx" \
"debugger-passed" "debugger-failed" "debugger-failures"
# ── Phase 4: CLOS unit tests ─────────────────────────────────────────────────
CLOS_FILE=$(mktemp); trap "rm -f $CLOS_FILE" EXIT
printf '(epoch 1)\n(load "spec/stdlib.sx")\n(epoch 2)\n(load "lib/common-lisp/runtime.sx")\n(epoch 3)\n(load "lib/common-lisp/clos.sx")\n(epoch 4)\n(load "lib/common-lisp/tests/clos.sx")\n(epoch 5)\n(eval "passed")\n(epoch 6)\n(eval "failed")\n(epoch 7)\n(eval "failures")\n' > "$CLOS_FILE"
CLOS_OUT=$(timeout 30 "$SX_SERVER" < "$CLOS_FILE" 2>/dev/null)
rm -f "$CLOS_FILE"
CLOS_PASSED=$(echo "$CLOS_OUT" | grep -A1 "^(ok-len 5 " | tail -1 || true)
CLOS_FAILED=$(echo "$CLOS_OUT" | grep -A1 "^(ok-len 6 " | tail -1 || true)
[ -z "$CLOS_PASSED" ] && CLOS_PASSED=$(echo "$CLOS_OUT" | grep "^(ok 5 " | awk '{print $3}' | tr -d ')' || true)
[ -z "$CLOS_FAILED" ] && CLOS_FAILED=$(echo "$CLOS_OUT" | grep "^(ok 6 " | awk '{print $3}' | tr -d ')' || true)
[ -z "$CLOS_PASSED" ] && CLOS_PASSED=0; [ -z "$CLOS_FAILED" ] && CLOS_FAILED=0
if [ "$CLOS_FAILED" = "0" ] && [ "$CLOS_PASSED" -gt 0 ] 2>/dev/null; then
PASS=$((PASS + CLOS_PASSED))
[ "$VERBOSE" = "-v" ] && echo " ok CLOS unit tests ($CLOS_PASSED)"
else
FAIL=$((FAIL + 1))
ERRORS+=" FAIL [CLOS unit tests] (${CLOS_PASSED} passed, ${CLOS_FAILED} failed)
"
fi
# ── Phase 4: CLOS classic programs ───────────────────────────────────────────
run_clos_suite() {
local prog="$1" pass_var="$2" fail_var="$3" failures_var="$4"
local PROG_FILE=$(mktemp)
printf '(epoch 1)\n(load "spec/stdlib.sx")\n(epoch 2)\n(load "lib/common-lisp/runtime.sx")\n(epoch 3)\n(load "lib/common-lisp/clos.sx")\n(epoch 4)\n(load "%s")\n(epoch 5)\n(eval "%s")\n(epoch 6)\n(eval "%s")\n(epoch 7)\n(eval "%s")\n' \
"$prog" "$pass_var" "$fail_var" "$failures_var" > "$PROG_FILE"
local OUT; OUT=$(timeout 20 "$SX_SERVER" < "$PROG_FILE" 2>/dev/null)
rm -f "$PROG_FILE"
local P F
P=$(echo "$OUT" | grep -A1 "^(ok-len 5 " | tail -1 || true)
F=$(echo "$OUT" | grep -A1 "^(ok-len 6 " | tail -1 || true)
local ERRS; ERRS=$(echo "$OUT" | grep -A1 "^(ok-len 7 " | tail -1 || true)
[ -z "$P" ] && P=0; [ -z "$F" ] && F=0
if [ "$F" = "0" ] && [ "$P" -gt 0 ] 2>/dev/null; then
PASS=$((PASS + P))
[ "$VERBOSE" = "-v" ] && echo " ok $prog ($P)"
else
FAIL=$((FAIL + 1))
ERRORS+=" FAIL [$prog] (${P} passed, ${F} failed) ${ERRS}
"
fi
}
run_clos_suite \
"lib/common-lisp/tests/programs/geometry.sx" \
"geo-passed" "geo-failed" "geo-failures"
run_clos_suite \
"lib/common-lisp/tests/programs/mop-trace.sx" \
"mop-passed" "mop-failed" "mop-failures"
# ── Phase 5: macros + LOOP ───────────────────────────────────────────────────
MACRO_FILE=$(mktemp); trap "rm -f $MACRO_FILE" EXIT
printf '(epoch 1)\n(load "spec/stdlib.sx")\n(epoch 2)\n(load "lib/common-lisp/reader.sx")\n(epoch 3)\n(load "lib/common-lisp/parser.sx")\n(epoch 4)\n(load "lib/common-lisp/eval.sx")\n(epoch 5)\n(load "lib/common-lisp/loop.sx")\n(epoch 6)\n(load "lib/common-lisp/tests/macros.sx")\n(epoch 7)\n(eval "macro-passed")\n(epoch 8)\n(eval "macro-failed")\n(epoch 9)\n(eval "macro-failures")\n' > "$MACRO_FILE"
MACRO_OUT=$(timeout 60 "$SX_SERVER" < "$MACRO_FILE" 2>/dev/null)
rm -f "$MACRO_FILE"
MACRO_PASSED=$(echo "$MACRO_OUT" | grep -A1 "^(ok-len 7 " | tail -1 || true)
MACRO_FAILED=$(echo "$MACRO_OUT" | grep -A1 "^(ok-len 8 " | tail -1 || true)
[ -z "$MACRO_PASSED" ] && MACRO_PASSED=0; [ -z "$MACRO_FAILED" ] && MACRO_FAILED=0
if [ "$MACRO_FAILED" = "0" ] && [ "$MACRO_PASSED" -gt 0 ] 2>/dev/null; then
PASS=$((PASS + MACRO_PASSED))
[ "$VERBOSE" = "-v" ] && echo " ok Phase 5 macros+LOOP ($MACRO_PASSED)"
else
FAIL=$((FAIL + 1))
ERRORS+=" FAIL [Phase 5 macros+LOOP] (${MACRO_PASSED} passed, ${MACRO_FAILED} failed)
"
fi
TOTAL=$((PASS+FAIL))
if [ $FAIL -eq 0 ]; then
echo "ok $PASS/$TOTAL lib/common-lisp tests passed"

View File

@@ -0,0 +1,334 @@
;; lib/common-lisp/tests/clos.sx — CLOS test suite
;;
;; Loaded after: spec/stdlib.sx, lib/common-lisp/runtime.sx, lib/common-lisp/clos.sx
(define passed 0)
(define failed 0)
(define failures (list))
(define
assert-equal
(fn
(label got expected)
(if
(= got expected)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str
"FAIL ["
label
"]: got="
(inspect got)
" expected="
(inspect expected)))))))))
(define
assert-true
(fn
(label got)
(if
got
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str "FAIL [" label "]: expected true, got " (inspect got)))))))))
(define
assert-nil
(fn
(label got)
(if
(nil? got)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list (str "FAIL [" label "]: expected nil, got " (inspect got)))))))))
;; ── 1. class-of for built-in types ────────────────────────────────────────
(assert-equal "class-of integer" (clos-class-of 42) "integer")
(assert-equal "class-of float" (clos-class-of 3.14) "float")
(assert-equal "class-of string" (clos-class-of "hi") "string")
(assert-equal "class-of nil" (clos-class-of nil) "null")
(assert-equal "class-of list" (clos-class-of (list 1)) "cons")
(assert-equal "class-of empty" (clos-class-of (list)) "null")
;; ── 2. subclass-of? ───────────────────────────────────────────────────────
(assert-true "integer subclass-of t" (clos-subclass-of? "integer" "t"))
(assert-true "float subclass-of t" (clos-subclass-of? "float" "t"))
(assert-true "t subclass-of t" (clos-subclass-of? "t" "t"))
(assert-equal
"integer not subclass-of float"
(clos-subclass-of? "integer" "float")
false)
;; ── 3. defclass + make-instance ───────────────────────────────────────────
(clos-defclass "point" (list "t") (list {:initform 0 :initarg ":x" :reader nil :writer nil :accessor "point-x" :name "x"} {:initform 0 :initarg ":y" :reader nil :writer nil :accessor "point-y" :name "y"}))
(let
((p (clos-make-instance "point" ":x" 3 ":y" 4)))
(begin
(assert-equal "make-instance slot x" (clos-slot-value p "x") 3)
(assert-equal "make-instance slot y" (clos-slot-value p "y") 4)
(assert-equal "class-of instance" (clos-class-of p) "point")
(assert-true "instance-of? point" (clos-instance-of? p "point"))
(assert-true "instance-of? t" (clos-instance-of? p "t"))
(assert-equal "instance-of? string" (clos-instance-of? p "string") false)))
;; initform defaults
(let
((p0 (clos-make-instance "point")))
(begin
(assert-equal "initform default x=0" (clos-slot-value p0 "x") 0)
(assert-equal "initform default y=0" (clos-slot-value p0 "y") 0)))
;; ── 4. slot-value / set-slot-value! ──────────────────────────────────────
(let
((p (clos-make-instance "point" ":x" 10 ":y" 20)))
(begin
(clos-set-slot-value! p "x" 99)
(assert-equal "set-slot-value! x" (clos-slot-value p "x") 99)
(assert-equal "slot-value y unchanged" (clos-slot-value p "y") 20)))
;; ── 5. slot-boundp ────────────────────────────────────────────────────────
(let
((p (clos-make-instance "point" ":x" 5)))
(begin
(assert-true "slot-boundp x" (clos-slot-boundp p "x"))
(assert-true "slot-boundp y (initform 0)" (clos-slot-boundp p "y"))))
;; ── 6. find-class ─────────────────────────────────────────────────────────
(assert-equal
"find-class point"
(get (clos-find-class "point") "name")
"point")
(assert-nil "find-class missing" (clos-find-class "no-such-class"))
;; ── 7. inheritance ────────────────────────────────────────────────────────
(clos-defclass "colored-point" (list "point") (list {:initform "white" :initarg ":color" :reader nil :writer nil :accessor nil :name "color"}))
(let
((cp (clos-make-instance "colored-point" ":x" 1 ":y" 2 ":color" "red")))
(begin
(assert-equal "inherited slot x" (clos-slot-value cp "x") 1)
(assert-equal "inherited slot y" (clos-slot-value cp "y") 2)
(assert-equal "own slot color" (clos-slot-value cp "color") "red")
(assert-true
"instance-of? colored-point"
(clos-instance-of? cp "colored-point"))
(assert-true "instance-of? point (parent)" (clos-instance-of? cp "point"))
(assert-true "instance-of? t (root)" (clos-instance-of? cp "t"))))
;; ── 8. defgeneric + primary method ───────────────────────────────────────
(clos-defgeneric "describe-obj" {})
(clos-defmethod
"describe-obj"
(list)
(list "point")
(fn
(args next-fn)
(let
((p (first args)))
(str "(" (clos-slot-value p "x") "," (clos-slot-value p "y") ")"))))
(clos-defmethod
"describe-obj"
(list)
(list "t")
(fn (args next-fn) (str "object:" (inspect (first args)))))
(let
((p (clos-make-instance "point" ":x" 3 ":y" 4)))
(begin
(assert-equal
"primary method for point"
(clos-call-generic "describe-obj" (list p))
"(3,4)")
(assert-equal
"fallback t method"
(clos-call-generic "describe-obj" (list 42))
"object:42")))
;; ── 9. method inheritance + specificity ───────────────────────────────────
(clos-defmethod
"describe-obj"
(list)
(list "colored-point")
(fn
(args next-fn)
(let
((cp (first args)))
(str
(clos-slot-value cp "color")
"@("
(clos-slot-value cp "x")
","
(clos-slot-value cp "y")
")"))))
(let
((cp (clos-make-instance "colored-point" ":x" 5 ":y" 6 ":color" "blue")))
(assert-equal
"most specific method wins"
(clos-call-generic "describe-obj" (list cp))
"blue@(5,6)"))
;; ── 10. :before / :after / :around qualifiers ─────────────────────────────
(clos-defgeneric "logged-action" {})
(clos-defmethod
"logged-action"
(list "before")
(list "t")
(fn (args next-fn) (set! action-log (append action-log (list "before")))))
(clos-defmethod
"logged-action"
(list)
(list "t")
(fn
(args next-fn)
(set! action-log (append action-log (list "primary")))
"result"))
(clos-defmethod
"logged-action"
(list "after")
(list "t")
(fn (args next-fn) (set! action-log (append action-log (list "after")))))
(define action-log (list))
(clos-call-generic "logged-action" (list 1))
(assert-equal
":before/:after order"
action-log
(list "before" "primary" "after"))
;; :around
(define around-log (list))
(clos-defgeneric "wrapped-action" {})
(clos-defmethod
"wrapped-action"
(list "around")
(list "t")
(fn
(args next-fn)
(set! around-log (append around-log (list "around-enter")))
(let
((r (next-fn)))
(set! around-log (append around-log (list "around-exit")))
r)))
(clos-defmethod
"wrapped-action"
(list)
(list "t")
(fn
(args next-fn)
(set! around-log (append around-log (list "primary")))
42))
(let
((r (clos-call-generic "wrapped-action" (list nil))))
(begin
(assert-equal ":around result" r 42)
(assert-equal
":around log"
around-log
(list "around-enter" "primary" "around-exit"))))
;; ── 11. call-next-method ─────────────────────────────────────────────────
(clos-defgeneric "chain-test" {})
(clos-defmethod
"chain-test"
(list)
(list "colored-point")
(fn (args next-fn) (str "colored:" (clos-call-next-method next-fn))))
(clos-defmethod
"chain-test"
(list)
(list "point")
(fn (args next-fn) "point-base"))
(let
((cp (clos-make-instance "colored-point" ":x" 0 ":y" 0 ":color" "green")))
(assert-equal
"call-next-method chains"
(clos-call-generic "chain-test" (list cp))
"colored:point-base"))
;; ── 12. accessor methods ──────────────────────────────────────────────────
(let
((p (clos-make-instance "point" ":x" 7 ":y" 8)))
(begin
(assert-equal
"accessor point-x"
(clos-call-generic "point-x" (list p))
7)
(assert-equal
"accessor point-y"
(clos-call-generic "point-y" (list p))
8)))
;; ── 13. with-slots ────────────────────────────────────────────────────────
(let
((p (clos-make-instance "point" ":x" 3 ":y" 4)))
(assert-equal
"with-slots"
(clos-with-slots p (list "x" "y") (fn (x y) (* x y)))
12))
;; ── 14. change-class ─────────────────────────────────────────────────────
(clos-defclass "special-point" (list "point") (list {:initform "" :initarg ":label" :reader nil :writer nil :accessor nil :name "label"}))
(let
((p (clos-make-instance "point" ":x" 1 ":y" 2)))
(begin
(clos-change-class! p "special-point")
(assert-equal
"change-class updates class"
(clos-class-of p)
"special-point")))
;; ── summary ────────────────────────────────────────────────────────────────
(if
(= failed 0)
(print (str "ok " passed "/" (+ passed failed) " CLOS tests passed"))
(begin
(for-each (fn (f) (print f)) failures)
(print
(str "FAIL " passed "/" (+ passed failed) " passed, " failed " failed"))))

View File

@@ -0,0 +1,478 @@
;; lib/common-lisp/tests/conditions.sx — Phase 3 condition system tests
;;
;; Loaded by lib/common-lisp/test.sh after:
;; (load "spec/stdlib.sx")
;; (load "lib/common-lisp/runtime.sx")
;;
;; Each test resets the handler/restart stacks to ensure isolation.
(define
reset-stacks!
(fn () (set! cl-handler-stack (list)) (set! cl-restart-stack (list))))
;; ── helpers ────────────────────────────────────────────────────────────────
(define passed 0)
(define failed 0)
(define failures (list))
(define
assert-equal
(fn
(label got expected)
(if
(= got expected)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str
"FAIL ["
label
"]: got="
(inspect got)
" expected="
(inspect expected)))))))))
(define
assert-true
(fn
(label got)
(if
got
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str "FAIL [" label "]: expected true, got " (inspect got)))))))))
(define
assert-nil
(fn
(label got)
(if
(nil? got)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list (str "FAIL [" label "]: expected nil, got " (inspect got)))))))))
;; ── 1. condition predicates ────────────────────────────────────────────────
(reset-stacks!)
(let
((c (cl-make-condition "simple-error" "format-control" "oops")))
(begin
(assert-true "cl-condition? on condition" (cl-condition? c))
(assert-equal "cl-condition? on string" (cl-condition? "hello") false)
(assert-equal "cl-condition? on number" (cl-condition? 42) false)
(assert-equal "cl-condition? on nil" (cl-condition? nil) false)))
;; ── 2. cl-make-condition + slot access ────────────────────────────────────
(reset-stacks!)
(let
((c (cl-make-condition "simple-error" "format-control" "msg" "format-arguments" (list 1 2))))
(begin
(assert-equal "class field" (get c "class") "simple-error")
(assert-equal "cl-type field" (get c "cl-type") "cl-condition")
(assert-equal
"format-control slot"
(cl-condition-slot c "format-control")
"msg")
(assert-equal
"format-arguments slot"
(cl-condition-slot c "format-arguments")
(list 1 2))
(assert-nil "missing slot is nil" (cl-condition-slot c "no-such-slot"))
(assert-equal "condition-message" (cl-condition-message c) "msg")))
;; ── 3. cl-condition-of-type? — hierarchy walking ─────────────────────────
(reset-stacks!)
(let
((se (cl-make-condition "simple-error" "format-control" "x"))
(w (cl-make-condition "simple-warning" "format-control" "y"))
(te
(cl-make-condition
"type-error"
"datum"
5
"expected-type"
"string"))
(dz (cl-make-condition "division-by-zero")))
(begin
(assert-true
"se isa simple-error"
(cl-condition-of-type? se "simple-error"))
(assert-true "se isa error" (cl-condition-of-type? se "error"))
(assert-true
"se isa serious-condition"
(cl-condition-of-type? se "serious-condition"))
(assert-true "se isa condition" (cl-condition-of-type? se "condition"))
(assert-equal
"se not isa warning"
(cl-condition-of-type? se "warning")
false)
(assert-true
"w isa simple-warning"
(cl-condition-of-type? w "simple-warning"))
(assert-true "w isa warning" (cl-condition-of-type? w "warning"))
(assert-true "w isa condition" (cl-condition-of-type? w "condition"))
(assert-equal "w not isa error" (cl-condition-of-type? w "error") false)
(assert-true "te isa type-error" (cl-condition-of-type? te "type-error"))
(assert-true "te isa error" (cl-condition-of-type? te "error"))
(assert-true
"dz isa division-by-zero"
(cl-condition-of-type? dz "division-by-zero"))
(assert-true
"dz isa arithmetic-error"
(cl-condition-of-type? dz "arithmetic-error"))
(assert-true "dz isa error" (cl-condition-of-type? dz "error"))
(assert-equal
"non-condition not isa anything"
(cl-condition-of-type? 42 "error")
false)))
;; ── 4. cl-define-condition ────────────────────────────────────────────────
(reset-stacks!)
(begin
(cl-define-condition "my-app-error" (list "error") (list "code" "detail"))
(let
((c (cl-make-condition "my-app-error" "code" 404 "detail" "not found")))
(begin
(assert-true "user condition: cl-condition?" (cl-condition? c))
(assert-true
"user condition isa my-app-error"
(cl-condition-of-type? c "my-app-error"))
(assert-true
"user condition isa error"
(cl-condition-of-type? c "error"))
(assert-true
"user condition isa condition"
(cl-condition-of-type? c "condition"))
(assert-equal
"user condition slot code"
(cl-condition-slot c "code")
404)
(assert-equal
"user condition slot detail"
(cl-condition-slot c "detail")
"not found"))))
;; ── 5. cl-handler-bind (non-unwinding) ───────────────────────────────────
(reset-stacks!)
(let
((log (list)))
(begin
(cl-handler-bind
(list
(list
"error"
(fn (c) (set! log (append log (list (cl-condition-message c)))))))
(fn
()
(cl-signal (cl-make-condition "simple-error" "format-control" "oops"))))
(assert-equal "handler-bind: handler fired" log (list "oops"))))
(reset-stacks!)
;; Non-unwinding: body continues after signal
(let
((body-ran false))
(begin
(cl-handler-bind
(list (list "error" (fn (c) nil)))
(fn
()
(cl-signal (cl-make-condition "simple-error" "format-control" "x"))
(set! body-ran true)))
(assert-true "handler-bind: body continues after signal" body-ran)))
(reset-stacks!)
;; Type filtering: warning handler does not fire for error
(let
((w-fired false))
(begin
(cl-handler-bind
(list (list "warning" (fn (c) (set! w-fired true))))
(fn
()
(cl-signal (cl-make-condition "simple-error" "format-control" "e"))))
(assert-equal
"handler-bind: type filter (warning ignores error)"
w-fired
false)))
(reset-stacks!)
;; Multiple handlers: both matching handlers fire
(let
((log (list)))
(begin
(cl-handler-bind
(list
(list "error" (fn (c) (set! log (append log (list "e1")))))
(list "condition" (fn (c) (set! log (append log (list "e2"))))))
(fn
()
(cl-signal (cl-make-condition "simple-error" "format-control" "x"))))
(assert-equal "handler-bind: both handlers fire" log (list "e1" "e2"))))
(reset-stacks!)
;; ── 6. cl-handler-case (unwinding) ───────────────────────────────────────
;; Catches error, returns handler result
(let
((result (cl-handler-case (fn () (cl-error "boom") 99) (list "error" (fn (c) (str "caught: " (cl-condition-message c)))))))
(assert-equal "handler-case: catches error" result "caught: boom"))
(reset-stacks!)
;; Returns body result when no signal
(let
((result (cl-handler-case (fn () 42) (list "error" (fn (c) -1)))))
(assert-equal "handler-case: body result" result 42))
(reset-stacks!)
;; Only first matching handler runs (unwinding)
(let
((result (cl-handler-case (fn () (cl-error "x")) (list "simple-error" (fn (c) "simple")) (list "error" (fn (c) "error")))))
(assert-equal "handler-case: most specific wins" result "simple"))
(reset-stacks!)
;; ── 7. cl-warn ────────────────────────────────────────────────────────────
(let
((warned false))
(begin
(cl-handler-bind
(list (list "warning" (fn (c) (set! warned true))))
(fn () (cl-warn "be careful")))
(assert-true "cl-warn: fires warning handler" warned)))
(reset-stacks!)
;; Warn with condition object
(let
((msg ""))
(begin
(cl-handler-bind
(list (list "warning" (fn (c) (set! msg (cl-condition-message c)))))
(fn
()
(cl-warn
(cl-make-condition "simple-warning" "format-control" "take care"))))
(assert-equal "cl-warn: condition object" msg "take care")))
(reset-stacks!)
;; ── 8. cl-restart-case + cl-invoke-restart ───────────────────────────────
;; Basic restart invocation
(let
((result (cl-restart-case (fn () (cl-invoke-restart "use-zero")) (list "use-zero" (list) (fn () 0)))))
(assert-equal "restart-case: invoke-restart use-zero" result 0))
(reset-stacks!)
;; Restart with argument
(let
((result (cl-restart-case (fn () (cl-invoke-restart "use-value" 77)) (list "use-value" (list "v") (fn (v) v)))))
(assert-equal "restart-case: invoke-restart with arg" result 77))
(reset-stacks!)
;; Body returns normally when restart not invoked
(let
((result (cl-restart-case (fn () 42) (list "never-used" (list) (fn () -1)))))
(assert-equal "restart-case: body result" result 42))
(reset-stacks!)
;; ── 9. cl-with-simple-restart ─────────────────────────────────────────────
(let
((result (cl-with-simple-restart "skip" "Skip this step" (fn () (cl-invoke-restart "skip") 99))))
(assert-nil "with-simple-restart: invoke returns nil" result))
(reset-stacks!)
;; ── 10. cl-find-restart ───────────────────────────────────────────────────
(let
((found (cl-restart-case (fn () (cl-find-restart "retry")) (list "retry" (list) (fn () nil)))))
(assert-true "find-restart: finds active restart" (not (nil? found))))
(reset-stacks!)
(let
((not-found (cl-restart-case (fn () (cl-find-restart "nonexistent")) (list "retry" (list) (fn () nil)))))
(assert-nil "find-restart: nil for inactive restart" not-found))
(reset-stacks!)
;; ── 11. cl-compute-restarts ───────────────────────────────────────────────
(let
((names (cl-restart-case (fn () (cl-restart-case (fn () (cl-compute-restarts)) (list "inner" (list) (fn () nil)))) (list "outer" (list) (fn () nil)))))
(assert-equal
"compute-restarts: both restarts"
names
(list "inner" "outer")))
(reset-stacks!)
;; ── 12. handler-bind + restart-case interop ───────────────────────────────
;; Classic CL pattern: error handler invokes a restart
(let
((result (cl-restart-case (fn () (cl-handler-bind (list (list "error" (fn (c) (cl-invoke-restart "use-zero")))) (fn () (cl-error "divide by zero")))) (list "use-zero" (list) (fn () 0)))))
(assert-equal "interop: handler invokes restart" result 0))
(reset-stacks!)
;; ── 13. cl-cerror ─────────────────────────────────────────────────────────
;; When "continue" restart is invoked, cerror returns nil
(let
((result (cl-restart-case (fn () (cl-cerror "continue anyway" "something bad") 42) (list "continue" (list) (fn () "resumed")))))
(assert-true
"cerror: returns"
(or (nil? result) (= result 42) (= result "resumed"))))
(reset-stacks!)
;; ── 14. slot accessor helpers ─────────────────────────────────────────────
(let
((c (cl-make-condition "simple-error" "format-control" "msg" "format-arguments" (list 1 2))))
(begin
(assert-equal
"simple-condition-format-control"
(cl-simple-condition-format-control c)
"msg")
(assert-equal
"simple-condition-format-arguments"
(cl-simple-condition-format-arguments c)
(list 1 2))))
(let
((c (cl-make-condition "type-error" "datum" 42 "expected-type" "string")))
(begin
(assert-equal "type-error-datum" (cl-type-error-datum c) 42)
(assert-equal
"type-error-expected-type"
(cl-type-error-expected-type c)
"string")))
(let
((c (cl-make-condition "arithmetic-error" "operation" "/" "operands" (list 1 0))))
(begin
(assert-equal
"arithmetic-error-operation"
(cl-arithmetic-error-operation c)
"/")
(assert-equal
"arithmetic-error-operands"
(cl-arithmetic-error-operands c)
(list 1 0))))
;; ── 15. *debugger-hook* ───────────────────────────────────────────────────
(reset-stacks!)
(let ((received nil))
(begin
(set! cl-debugger-hook
(fn (c h)
(set! received (cl-condition-message c))
(cl-invoke-restart "escape")))
(cl-restart-case
(fn () (cl-error "debugger test"))
(list "escape" (list) (fn () nil)))
(set! cl-debugger-hook nil)
(assert-equal "debugger-hook receives condition" received "debugger test")))
(reset-stacks!)
;; ── 16. *break-on-signals* ────────────────────────────────────────────────
(reset-stacks!)
(let ((triggered false))
(begin
(set! cl-break-on-signals "error")
(set! cl-debugger-hook
(fn (c h)
(set! triggered true)
(cl-invoke-restart "abort")))
(cl-restart-case
(fn ()
(cl-signal (cl-make-condition "simple-error" "format-control" "x")))
(list "abort" (list) (fn () nil)))
(set! cl-break-on-signals nil)
(set! cl-debugger-hook nil)
(assert-true "break-on-signals fires hook" triggered)))
(reset-stacks!)
;; break-on-signals: non-matching type does NOT fire hook
(let ((triggered false))
(begin
(set! cl-break-on-signals "error")
(set! cl-debugger-hook
(fn (c h) (set! triggered true) nil))
(cl-handler-bind
(list (list "warning" (fn (c) nil)))
(fn ()
(cl-signal (cl-make-condition "simple-warning" "format-control" "w"))))
(set! cl-break-on-signals nil)
(set! cl-debugger-hook nil)
(assert-equal "break-on-signals: type mismatch not triggered" triggered false)))
(reset-stacks!)
;; ── 17. cl-invoke-restart-interactively ──────────────────────────────────
(let ((result
(cl-restart-case
(fn () (cl-invoke-restart-interactively "use-default"))
(list "use-default" (list) (fn () 99)))))
(assert-equal "invoke-restart-interactively: returns restart value" result 99))
(reset-stacks!)
;; ── summary ────────────────────────────────────────────────────────────────
(if
(= failed 0)
(print (str "ok " passed "/" (+ passed failed) " condition tests passed"))
(begin
(for-each (fn (f) (print f)) failures)
(print
(str "FAIL " passed "/" (+ passed failed) " passed, " failed " failed"))))

View File

@@ -0,0 +1,466 @@
;; CL evaluator tests
(define cl-test-pass 0)
(define cl-test-fail 0)
(define cl-test-fails (list))
(define
cl-deep=
(fn
(a b)
(cond
((= a b) true)
((and (dict? a) (dict? b))
(let
((ak (keys a)) (bk (keys b)))
(if
(not (= (len ak) (len bk)))
false
(every?
(fn (k) (and (has-key? b k) (cl-deep= (get a k) (get b k))))
ak))))
((and (list? a) (list? b))
(if
(not (= (len a) (len b)))
false
(let
((i 0) (ok true))
(define
chk
(fn
()
(when
(and ok (< i (len a)))
(do
(when
(not (cl-deep= (nth a i) (nth b i)))
(set! ok false))
(set! i (+ i 1))
(chk)))))
(chk)
ok)))
(:else false))))
(define
cl-test
(fn
(name actual expected)
(if
(cl-deep= actual expected)
(set! cl-test-pass (+ cl-test-pass 1))
(do
(set! cl-test-fail (+ cl-test-fail 1))
(append! cl-test-fails {:name name :expected expected :actual actual})))))
;; Convenience: evaluate CL string with fresh env each time
(define ev (fn (src) (cl-eval-str src (cl-make-env))))
(define evall (fn (src) (cl-eval-all-str src (cl-make-env))))
;; ── self-evaluating literals ──────────────────────────────────────
(cl-test "lit: nil" (ev "nil") nil)
(cl-test "lit: t" (ev "t") true)
(cl-test "lit: integer" (ev "42") 42)
(cl-test "lit: negative" (ev "-7") -7)
(cl-test "lit: zero" (ev "0") 0)
(cl-test "lit: string" (ev "\"hello\"") "hello")
(cl-test "lit: empty string" (ev "\"\"") "")
(cl-test "lit: keyword type" (get (ev ":foo") "cl-type") "keyword")
(cl-test "lit: keyword name" (get (ev ":foo") "name") "FOO")
(cl-test "lit: float type" (get (ev "3.14") "cl-type") "float")
;; ── QUOTE ─────────────────────────────────────────────────────────
(cl-test "quote: symbol" (ev "'x") "X")
(cl-test "quote: list" (ev "'(a b c)") (list "A" "B" "C"))
(cl-test "quote: nil" (ev "'nil") nil)
(cl-test "quote: integer" (ev "'42") 42)
(cl-test "quote: nested" (ev "'(a (b c))") (list "A" (list "B" "C")))
;; ── IF ────────────────────────────────────────────────────────────
(cl-test "if: true branch" (ev "(if t 1 2)") 1)
(cl-test "if: false branch" (ev "(if nil 1 2)") 2)
(cl-test "if: no else nil" (ev "(if nil 99)") nil)
(cl-test "if: number truthy" (ev "(if 0 'yes 'no)") "YES")
(cl-test "if: empty string truthy" (ev "(if \"\" 'yes 'no)") "YES")
(cl-test "if: nested" (ev "(if t (if nil 1 2) 3)") 2)
;; ── PROGN ────────────────────────────────────────────────────────
(cl-test "progn: single" (ev "(progn 42)") 42)
(cl-test "progn: multiple" (ev "(progn 1 2 3)") 3)
(cl-test "progn: nil last" (ev "(progn 1 nil)") nil)
;; ── AND / OR ─────────────────────────────────────────────────────
(cl-test "and: empty" (ev "(and)") true)
(cl-test "and: all true" (ev "(and 1 2 3)") 3)
(cl-test "and: short-circuit" (ev "(and nil 99)") nil)
(cl-test "and: returns last" (ev "(and 1 2)") 2)
(cl-test "or: empty" (ev "(or)") nil)
(cl-test "or: first truthy" (ev "(or 1 2)") 1)
(cl-test "or: all nil" (ev "(or nil nil)") nil)
(cl-test "or: short-circuit" (ev "(or nil 42)") 42)
;; ── COND ─────────────────────────────────────────────────────────
(cl-test "cond: first match" (ev "(cond (t 1) (t 2))") 1)
(cl-test "cond: second match" (ev "(cond (nil 1) (t 2))") 2)
(cl-test "cond: no match" (ev "(cond (nil 1) (nil 2))") nil)
(cl-test "cond: returns test value" (ev "(cond (42))") 42)
;; ── WHEN / UNLESS ─────────────────────────────────────────────────
(cl-test "when: true" (ev "(when t 1 2 3)") 3)
(cl-test "when: nil" (ev "(when nil 99)") nil)
(cl-test "unless: nil runs" (ev "(unless nil 42)") 42)
(cl-test "unless: true skips" (ev "(unless t 99)") nil)
;; ── LET ──────────────────────────────────────────────────────────
(cl-test "let: empty bindings" (ev "(let () 42)") 42)
(cl-test "let: single binding" (ev "(let ((x 5)) x)") 5)
(cl-test "let: two bindings" (ev "(let ((x 3) (y 4)) (+ x y))") 7)
(cl-test "let: parallel" (ev "(let ((x 1)) (let ((x 2) (y x)) y))") 1)
(cl-test "let: nested" (ev "(let ((x 1)) (let ((y 2)) (+ x y)))") 3)
(cl-test "let: progn body" (ev "(let ((x 5)) (+ x 1) (* x 2))") 10)
(cl-test "let: bare name nil" (ev "(let (x) x)") nil)
;; ── LET* ─────────────────────────────────────────────────────────
(cl-test "let*: sequential" (ev "(let* ((x 1) (y (+ x 1))) y)") 2)
(cl-test "let*: chain" (ev "(let* ((a 2) (b (* a 3)) (c (+ b 1))) c)") 7)
(cl-test "let*: shadow" (ev "(let ((x 1)) (let* ((x 2) (y x)) y))") 2)
;; ── SETQ / SETF ──────────────────────────────────────────────────
(cl-test "setq: basic" (ev "(let ((x 0)) (setq x 5) x)") 5)
(cl-test "setq: returns value" (ev "(let ((x 0)) (setq x 99))") 99)
(cl-test "setf: basic" (ev "(let ((x 0)) (setf x 7) x)") 7)
;; ── LAMBDA ────────────────────────────────────────────────────────
(cl-test "lambda: call" (ev "((lambda (x) x) 42)") 42)
(cl-test "lambda: multi-arg" (ev "((lambda (x y) (+ x y)) 3 4)") 7)
(cl-test "lambda: closure" (ev "(let ((n 10)) ((lambda (x) (+ x n)) 5))") 15)
(cl-test "lambda: rest arg"
(ev "((lambda (x &rest xs) (cons x xs)) 1 2 3)")
{:cl-type "cons" :car 1 :cdr (list 2 3)})
(cl-test "lambda: optional no default"
(ev "((lambda (&optional x) x))")
nil)
(cl-test "lambda: optional with arg"
(ev "((lambda (&optional (x 99)) x) 42)")
42)
(cl-test "lambda: optional default used"
(ev "((lambda (&optional (x 7)) x))")
7)
;; ── FUNCTION ─────────────────────────────────────────────────────
(cl-test "function: lambda" (get (ev "(function (lambda (x) x))") "cl-type") "function")
;; ── DEFUN ────────────────────────────────────────────────────────
(cl-test "defun: returns name" (evall "(defun sq (x) (* x x))") "SQ")
(cl-test "defun: call" (evall "(defun sq (x) (* x x)) (sq 5)") 25)
(cl-test "defun: multi-arg" (evall "(defun add (x y) (+ x y)) (add 3 4)") 7)
(cl-test "defun: recursive factorial"
(evall "(defun fact (n) (if (<= n 1) 1 (* n (fact (- n 1))))) (fact 5)")
120)
(cl-test "defun: multiple calls"
(evall "(defun double (x) (* x 2)) (+ (double 3) (double 5))")
16)
;; ── FLET ─────────────────────────────────────────────────────────
(cl-test "flet: basic"
(ev "(flet ((double (x) (* x 2))) (double 5))")
10)
(cl-test "flet: sees outer vars"
(ev "(let ((n 3)) (flet ((add-n (x) (+ x n))) (add-n 7)))")
10)
(cl-test "flet: non-recursive"
(ev "(flet ((f (x) (+ x 1))) (flet ((f (x) (f (f x)))) (f 5)))")
7)
;; ── LABELS ────────────────────────────────────────────────────────
(cl-test "labels: basic"
(ev "(labels ((greet (x) x)) (greet 42))")
42)
(cl-test "labels: recursive"
(ev "(labels ((count (n) (if (<= n 0) 0 (+ 1 (count (- n 1)))))) (count 5))")
5)
(cl-test "labels: mutual recursion"
(ev "(labels
((even? (n) (if (= n 0) t (odd? (- n 1))))
(odd? (n) (if (= n 0) nil (even? (- n 1)))))
(list (even? 4) (odd? 3)))")
(list true true))
;; ── THE / LOCALLY / EVAL-WHEN ────────────────────────────────────
(cl-test "the: passthrough" (ev "(the integer 42)") 42)
(cl-test "the: string" (ev "(the string \"hi\")") "hi")
(cl-test "locally: body" (ev "(locally 1 2 3)") 3)
(cl-test "eval-when: execute" (ev "(eval-when (:execute) 99)") 99)
(cl-test "eval-when: no execute" (ev "(eval-when (:compile-toplevel) 99)") nil)
;; ── DEFVAR / DEFPARAMETER ────────────────────────────────────────
(cl-test "defvar: returns name" (evall "(defvar *x* 10)") "*X*")
(cl-test "defparameter: sets value" (evall "(defparameter *y* 42) *y*") 42)
(cl-test "defvar: no reinit" (evall "(defvar *z* 1) (defvar *z* 99) *z*") 1)
;; ── built-in arithmetic ───────────────────────────────────────────
(cl-test "arith: +" (ev "(+ 1 2 3)") 6)
(cl-test "arith: + zero" (ev "(+)") 0)
(cl-test "arith: -" (ev "(- 10 3 2)") 5)
(cl-test "arith: - negate" (ev "(- 5)") -5)
(cl-test "arith: *" (ev "(* 2 3 4)") 24)
(cl-test "arith: * one" (ev "(*)") 1)
(cl-test "arith: /" (ev "(/ 12 3)") 4)
(cl-test "arith: max" (ev "(max 3 1 4 1 5)") 5)
(cl-test "arith: min" (ev "(min 3 1 4 1 5)") 1)
(cl-test "arith: abs neg" (ev "(abs -7)") 7)
(cl-test "arith: abs pos" (ev "(abs 7)") 7)
;; ── built-in comparisons ──────────────────────────────────────────
(cl-test "cmp: = true" (ev "(= 3 3)") true)
(cl-test "cmp: = false" (ev "(= 3 4)") nil)
(cl-test "cmp: /=" (ev "(/= 3 4)") true)
(cl-test "cmp: <" (ev "(< 1 2)") true)
(cl-test "cmp: > false" (ev "(> 1 2)") nil)
(cl-test "cmp: <=" (ev "(<= 2 2)") true)
;; ── built-in predicates ───────────────────────────────────────────
(cl-test "pred: null nil" (ev "(null nil)") true)
(cl-test "pred: null non-nil" (ev "(null 5)") nil)
(cl-test "pred: not nil" (ev "(not nil)") true)
(cl-test "pred: not truthy" (ev "(not 5)") nil)
(cl-test "pred: numberp" (ev "(numberp 5)") true)
(cl-test "pred: numberp str" (ev "(numberp \"x\")") nil)
(cl-test "pred: stringp" (ev "(stringp \"hello\")") true)
(cl-test "pred: listp list" (ev "(listp '(1))") true)
(cl-test "pred: listp nil" (ev "(listp nil)") true)
(cl-test "pred: zerop" (ev "(zerop 0)") true)
(cl-test "pred: plusp" (ev "(plusp 3)") true)
(cl-test "pred: evenp" (ev "(evenp 4)") true)
(cl-test "pred: oddp" (ev "(oddp 3)") true)
;; ── built-in list ops ─────────────────────────────────────────────
(cl-test "list: car" (ev "(car '(1 2 3))") 1)
(cl-test "list: cdr" (ev "(cdr '(1 2 3))") (list 2 3))
(cl-test "list: cons" (get (ev "(cons 1 2)") "car") 1)
(cl-test "list: list fn" (ev "(list 1 2 3)") (list 1 2 3))
(cl-test "list: length" (ev "(length '(a b c))") 3)
(cl-test "list: length nil" (ev "(length nil)") 0)
(cl-test "list: append" (ev "(append '(1 2) '(3 4))") (list 1 2 3 4))
(cl-test "list: first" (ev "(first '(10 20 30))") 10)
(cl-test "list: second" (ev "(second '(10 20 30))") 20)
(cl-test "list: third" (ev "(third '(10 20 30))") 30)
(cl-test "list: rest" (ev "(rest '(1 2 3))") (list 2 3))
(cl-test "list: nth" (ev "(nth 1 '(a b c))") "B")
(cl-test "list: reverse" (ev "(reverse '(1 2 3))") (list 3 2 1))
;; ── FUNCALL / APPLY / MAPCAR ─────────────────────────────────────
(cl-test "funcall: lambda"
(ev "(funcall (lambda (x) (* x x)) 5)")
25)
(cl-test "apply: basic"
(ev "(apply #'+ '(1 2 3))")
6)
(cl-test "apply: leading args"
(ev "(apply #'+ 1 2 '(3 4))")
10)
(cl-test "mapcar: basic"
(ev "(mapcar (lambda (x) (* x 2)) '(1 2 3))")
(list 2 4 6))
;; ── BLOCK / RETURN-FROM / RETURN ─────────────────────────────────
(cl-test "block: last form value"
(ev "(block done 1 2 3)")
3)
(cl-test "block: empty body"
(ev "(block done)")
nil)
(cl-test "block: single form"
(ev "(block foo 42)")
42)
(cl-test "block: return-from"
(ev "(block done 1 (return-from done 99) 2)")
99)
(cl-test "block: return-from nil block"
(ev "(block nil 1 (return-from nil 42) 3)")
42)
(cl-test "block: return-from no value"
(ev "(block done (return-from done))")
nil)
(cl-test "block: nested inner return stays inner"
(ev "(block outer (block inner (return-from inner 1) 2) 3)")
3)
(cl-test "block: nested outer return"
(ev "(block outer (block inner 1 2) (return-from outer 99) 3)")
99)
(cl-test "return: shorthand for nil block"
(ev "(block nil (return 77))")
77)
(cl-test "return: no value"
(ev "(block nil 1 (return) 2)")
nil)
(cl-test "block: return-from inside let"
(ev "(block done (let ((x 5)) (when (> x 3) (return-from done x))) 0)")
5)
(cl-test "block: return-from inside progn"
(ev "(block done (progn (return-from done 7) 99))")
7)
(cl-test "block: return-from through function"
(ev "(block done (flet ((f () (return-from done 42))) (f)) nil)")
42)
;; ── TAGBODY / GO ─────────────────────────────────────────────────
(cl-test "tagbody: empty returns nil"
(ev "(tagbody)")
nil)
(cl-test "tagbody: forms only, returns nil"
(ev "(let ((x 0)) (tagbody (setq x 1) (setq x 2)) x)")
2)
(cl-test "tagbody: tag only, returns nil"
(ev "(tagbody done)")
nil)
(cl-test "tagbody: go skips forms"
(ev "(let ((x 0)) (tagbody (go done) (setq x 99) done) x)")
0)
(cl-test "tagbody: go to later tag"
(ev "(let ((x 0)) (tagbody start (setq x (+ x 1)) (go done) (setq x 99) done) x)")
1)
(cl-test "tagbody: loop with counter"
(ev "(let ((n 0)) (tagbody loop (when (>= n 3) (go done)) (setq n (+ n 1)) (go loop) done) n)")
3)
(cl-test "tagbody: go inside when"
(ev "(let ((x 0)) (tagbody (setq x 1) (when t (go done)) (setq x 99) done) x)")
1)
(cl-test "tagbody: go inside progn"
(ev "(let ((x 0)) (tagbody (progn (setq x 1) (go done)) (setq x 99) done) x)")
1)
(cl-test "tagbody: go inside let"
(ev "(let ((acc 0)) (tagbody (let ((y 5)) (when (> y 3) (go done))) (setq acc 99) done) acc)")
0)
(cl-test "tagbody: integer tags"
(ev "(let ((x 0)) (tagbody (go 2) 1 (setq x 1) (go 3) 2 (setq x 2) (go 3) 3) x)")
2)
(cl-test "tagbody: block-return propagates out"
(ev "(block done (tagbody (return-from done 42)) nil)")
42)
;; ── UNWIND-PROTECT ───────────────────────────────────────────────
(cl-test "unwind-protect: normal returns protected"
(ev "(unwind-protect 42 nil)")
42)
(cl-test "unwind-protect: cleanup runs"
(ev "(let ((x 0)) (unwind-protect 1 (setq x 99)) x)")
99)
(cl-test "unwind-protect: cleanup result ignored"
(ev "(unwind-protect 42 777)")
42)
(cl-test "unwind-protect: multiple cleanup forms"
(ev "(let ((x 0)) (unwind-protect 1 (setq x (+ x 1)) (setq x (+ x 1))) x)")
2)
(cl-test "unwind-protect: cleanup on return-from"
(ev "(let ((x 0)) (block done (unwind-protect (return-from done 7) (setq x 99))) x)")
99)
(cl-test "unwind-protect: return-from still propagates"
(ev "(block done (unwind-protect (return-from done 42) nil))")
42)
(cl-test "unwind-protect: cleanup on go"
(ev "(let ((x 0)) (tagbody (unwind-protect (go done) (setq x 1)) done) x)")
1)
(cl-test "unwind-protect: nested, inner cleanup first"
(ev "(let ((n 0)) (unwind-protect (unwind-protect 1 (setq n (+ n 10))) (setq n (+ n 1))) n)")
11)
;; ── VALUES / MULTIPLE-VALUE-BIND / NTH-VALUE ────────────────────
(cl-test "values: single returns plain"
(ev "(values 42)")
42)
(cl-test "values: zero returns nil"
(ev "(values)")
nil)
(cl-test "values: multi — primary via funcall"
(ev "(car (list (values 1 2)))")
1)
(cl-test "multiple-value-bind: basic"
(ev "(multiple-value-bind (a b) (values 1 2) (+ a b))")
3)
(cl-test "multiple-value-bind: extra vars get nil"
(ev "(multiple-value-bind (a b c) (values 10 20) (list a b c))")
(list 10 20 nil))
(cl-test "multiple-value-bind: extra values ignored"
(ev "(multiple-value-bind (a) (values 1 2 3) a)")
1)
(cl-test "multiple-value-bind: single value source"
(ev "(multiple-value-bind (a b) 42 (list a b))")
(list 42 nil))
(cl-test "nth-value: 0"
(ev "(nth-value 0 (values 10 20 30))")
10)
(cl-test "nth-value: 1"
(ev "(nth-value 1 (values 10 20 30))")
20)
(cl-test "nth-value: out of range"
(ev "(nth-value 5 (values 10 20))")
nil)
(cl-test "multiple-value-call: basic"
(ev "(multiple-value-call #'+ (values 1 2) (values 3 4))")
10)
(cl-test "multiple-value-prog1: returns first"
(ev "(multiple-value-prog1 1 2 3)")
1)
(cl-test "multiple-value-prog1: side effects run"
(ev "(let ((x 0)) (multiple-value-prog1 99 (setq x 7)) x)")
7)
(cl-test "values: nil primary in if"
(ev "(if (values nil t) 'yes 'no)")
"NO")
(cl-test "values: truthy primary in if"
(ev "(if (values 42 nil) 'yes 'no)")
"YES")
;; --- Dynamic variables ---
(cl-test "defvar marks special"
(do (ev "(defvar *dv* 10)")
(cl-special? "*DV*"))
true)
(cl-test "defvar: let rebinds dynamically"
(ev "(progn (defvar *x* 1) (defun get-x () *x*) (let ((*x* 99)) (get-x)))")
99)
(cl-test "defvar: binding restores after let"
(ev "(progn (defvar *yrst* 5) (let ((*yrst* 42)) *yrst*) *yrst*)")
5)
(cl-test "defparameter marks special"
(do (ev "(defparameter *dp* 0)")
(cl-special? "*DP*"))
true)
(cl-test "defparameter: let rebinds dynamically"
(ev "(progn (defparameter *z* 10) (defun get-z () *z*) (let ((*z* 77)) (get-z)))")
77)
(cl-test "defparameter: always assigns"
(ev "(progn (defparameter *p* 1) (defparameter *p* 2) *p*)")
2)
(cl-test "dynamic binding: nested lets"
(ev "(progn (defvar *n* 0) (let ((*n* 1)) (let ((*n* 2)) *n*)))")
2)
(cl-test "dynamic binding: restores across nesting"
(ev "(progn (defvar *m* 10) (let ((*m* 20)) (let ((*m* 30)) nil)) *m*)")
10)

View File

@@ -0,0 +1,204 @@
;; Lambda list parser tests
(define cl-test-pass 0)
(define cl-test-fail 0)
(define cl-test-fails (list))
;; Deep structural equality for dicts and lists
(define
cl-deep=
(fn
(a b)
(cond
((= a b) true)
((and (dict? a) (dict? b))
(let
((ak (keys a)) (bk (keys b)))
(if
(not (= (len ak) (len bk)))
false
(every?
(fn (k) (and (has-key? b k) (cl-deep= (get a k) (get b k))))
ak))))
((and (list? a) (list? b))
(if
(not (= (len a) (len b)))
false
(let
((i 0) (ok true))
(define
chk
(fn
()
(when
(and ok (< i (len a)))
(do
(when
(not (cl-deep= (nth a i) (nth b i)))
(set! ok false))
(set! i (+ i 1))
(chk)))))
(chk)
ok)))
(:else false))))
(define
cl-test
(fn
(name actual expected)
(if
(cl-deep= actual expected)
(set! cl-test-pass (+ cl-test-pass 1))
(do
(set! cl-test-fail (+ cl-test-fail 1))
(append! cl-test-fails {:name name :expected expected :actual actual})))))
;; Helper: parse lambda list from string "(x y ...)"
(define ll (fn (src) (cl-parse-lambda-list-str src)))
(define ll-req (fn (src) (get (ll src) "required")))
(define ll-opt (fn (src) (get (ll src) "optional")))
(define ll-rest (fn (src) (get (ll src) "rest")))
(define ll-key (fn (src) (get (ll src) "key")))
(define ll-aok (fn (src) (get (ll src) "allow-other-keys")))
(define ll-aux (fn (src) (get (ll src) "aux")))
;; ── required parameters ───────────────────────────────────────────
(cl-test "required: empty" (ll-req "()") (list))
(cl-test "required: one" (ll-req "(x)") (list "X"))
(cl-test "required: two" (ll-req "(x y)") (list "X" "Y"))
(cl-test "required: three" (ll-req "(a b c)") (list "A" "B" "C"))
(cl-test "required: upcased" (ll-req "(foo bar)") (list "FOO" "BAR"))
;; ── &optional ─────────────────────────────────────────────────────
(cl-test "optional: none" (ll-opt "(x)") (list))
(cl-test
"optional: bare symbol"
(ll-opt "(x &optional z)")
(list {:name "Z" :default nil :supplied nil}))
(cl-test
"optional: with default"
(ll-opt "(x &optional (z 0))")
(list {:name "Z" :default 0 :supplied nil}))
(cl-test
"optional: with supplied-p"
(ll-opt "(x &optional (z 0 z-p))")
(list {:name "Z" :default 0 :supplied "Z-P"}))
(cl-test
"optional: two params"
(ll-opt "(&optional a (b 1))")
(list {:name "A" :default nil :supplied nil} {:name "B" :default 1 :supplied nil}))
(cl-test
"optional: string default"
(ll-opt "(&optional (name \"world\"))")
(list {:name "NAME" :default {:cl-type "string" :value "world"} :supplied nil}))
;; ── &rest ─────────────────────────────────────────────────────────
(cl-test "rest: none" (ll-rest "(x)") nil)
(cl-test "rest: present" (ll-rest "(x &rest args)") "ARGS")
(cl-test "rest: with required" (ll-rest "(a b &rest tail)") "TAIL")
;; &body is an alias for &rest
(cl-test "body: alias for rest" (ll-rest "(&body forms)") "FORMS")
;; rest doesn't consume required params
(cl-test "rest: required still there" (ll-req "(a b &rest rest)") (list "A" "B"))
;; ── &key ──────────────────────────────────────────────────────────
(cl-test "key: none" (ll-key "(x)") (list))
(cl-test
"key: bare symbol"
(ll-key "(&key x)")
(list {:name "X" :keyword "X" :default nil :supplied nil}))
(cl-test
"key: with default"
(ll-key "(&key (x 42))")
(list {:name "X" :keyword "X" :default 42 :supplied nil}))
(cl-test
"key: with supplied-p"
(ll-key "(&key (x 42 x-p))")
(list {:name "X" :keyword "X" :default 42 :supplied "X-P"}))
(cl-test
"key: two params"
(ll-key "(&key a b)")
(list
{:name "A" :keyword "A" :default nil :supplied nil}
{:name "B" :keyword "B" :default nil :supplied nil}))
;; ── &allow-other-keys ─────────────────────────────────────────────
(cl-test "aok: absent" (ll-aok "(x)") false)
(cl-test "aok: present" (ll-aok "(&key x &allow-other-keys)") true)
;; ── &aux ──────────────────────────────────────────────────────────
(cl-test "aux: none" (ll-aux "(x)") (list))
(cl-test
"aux: bare symbol"
(ll-aux "(&aux temp)")
(list {:name "TEMP" :init nil}))
(cl-test
"aux: with init"
(ll-aux "(&aux (count 0))")
(list {:name "COUNT" :init 0}))
(cl-test
"aux: two vars"
(ll-aux "(&aux a (b 1))")
(list {:name "A" :init nil} {:name "B" :init 1}))
;; ── combined ──────────────────────────────────────────────────────
(cl-test
"combined: full lambda list"
(let
((parsed (ll "(x y &optional (z 0 z-p) &rest args &key a (b nil b-p) &aux temp)")))
(list
(get parsed "required")
(get (nth (get parsed "optional") 0) "name")
(get (nth (get parsed "optional") 0) "default")
(get (nth (get parsed "optional") 0) "supplied")
(get parsed "rest")
(get (nth (get parsed "key") 0) "name")
(get (nth (get parsed "key") 1) "supplied")
(get (nth (get parsed "aux") 0) "name")))
(list
(list "X" "Y")
"Z"
0
"Z-P"
"ARGS"
"A"
"B-P"
"TEMP"))
(cl-test
"combined: required only stops before &"
(ll-req "(a b &optional c)")
(list "A" "B"))
(cl-test
"combined: required only with &key"
(ll-req "(x &key y)")
(list "X"))
(cl-test
"combined: &rest and &key together"
(let
((parsed (ll "(&rest args &key verbose)")))
(list (get parsed "rest") (get (nth (get parsed "key") 0) "name")))
(list "ARGS" "VERBOSE"))

View File

@@ -0,0 +1,204 @@
;; lib/common-lisp/tests/macros.sx — Phase 5: defmacro, gensym, LOOP tests
;;
;; Depends on: runtime.sx, eval.sx, loop.sx already loaded.
;; Tests via (ev "...") using the CL evaluator.
(define ev (fn (src) (cl-eval-str src (cl-make-env))))
(define evall (fn (src) (cl-eval-all-str src (cl-make-env))))
(define passed 0)
(define failed 0)
(define failures (list))
(define
check
(fn
(label got expected)
(if
(= got expected)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str
"FAIL ["
label
"]: got="
(inspect got)
" expected="
(inspect expected)))))))))
;; ── defmacro basics ──────────────────────────────────────────────────────────
(check
"defmacro returns name"
(ev "(defmacro my-or (a b) (list 'if a a b))")
"MY-OR")
(check
"defmacro expansion works"
(ev "(progn (defmacro my-inc (x) (list '+ x 1)) (my-inc 5))")
6)
(check
"defmacro with &rest"
(ev "(progn (defmacro my-list (&rest xs) (cons 'list xs)) (my-list 1 2 3))")
(list 1 2 3))
(check
"nested macro expansion"
(ev "(progn (defmacro sq (x) (list '* x x)) (sq 7))")
49)
(check
"macro in conditional"
(ev
"(progn (defmacro my-when (c &rest body) (list 'if c (cons 'progn body) nil)) (my-when t 10 20))")
20)
(check
"macro returns nil branch"
(ev
"(progn (defmacro my-when (c &rest body) (list 'if c (cons 'progn body) nil)) (my-when nil 42))")
nil)
;; ── macroexpand ───────────────────────────────────────────────────────────────
(check
"macroexpand returns expanded form"
(ev "(progn (defmacro double (x) (list '+ x x)) (macroexpand '(double 5)))")
(list "+" 5 5))
;; ── gensym ────────────────────────────────────────────────────────────────────
(check "gensym returns string" (ev "(stringp (gensym))") true)
(check
"gensym prefix"
(ev "(let ((g (gensym \"MY\"))) (not (= g nil)))")
true)
(check "gensyms are unique" (ev "(not (= (gensym) (gensym)))") true)
;; ── swap! macro with gensym ───────────────────────────────────────────────────
(check
"swap! macro"
(evall
"(defmacro swap! (a b) (let ((tmp (gensym))) (list 'let (list (list tmp a)) (list 'setq a b) (list 'setq b tmp)))) (defvar *a* 10) (defvar *b* 20) (swap! *a* *b*) (list *a* *b*)")
(list 20 10))
;; ── LOOP: basic repeat and collect ────────────────────────────────────────────
(check
"loop repeat collect"
(ev "(loop repeat 3 collect 99)")
(list 99 99 99))
(check
"loop for-in collect"
(ev "(loop for x in '(1 2 3) collect (* x x))")
(list 1 4 9))
(check
"loop for-from-to collect"
(ev "(loop for i from 1 to 5 collect i)")
(list 1 2 3 4 5))
(check
"loop for-from-below collect"
(ev "(loop for i from 0 below 4 collect i)")
(list 0 1 2 3))
(check
"loop for-downto collect"
(ev "(loop for i from 5 downto 1 collect i)")
(list 5 4 3 2 1))
(check
"loop for-by collect"
(ev "(loop for i from 0 to 10 by 2 collect i)")
(list 0 2 4 6 8 10))
;; ── LOOP: sum, count, maximize, minimize ─────────────────────────────────────
(check "loop sum" (ev "(loop for i from 1 to 5 sum i)") 15)
(check
"loop count"
(ev "(loop for x in '(1 2 3 4 5) count (> x 3))")
2)
(check
"loop maximize"
(ev "(loop for x in '(3 1 4 1 5 9 2 6) maximize x)")
9)
(check
"loop minimize"
(ev "(loop for x in '(3 1 4 1 5 9 2 6) minimize x)")
1)
;; ── LOOP: while and until ─────────────────────────────────────────────────────
(check
"loop while"
(ev "(loop for i from 1 to 10 while (< i 5) collect i)")
(list 1 2 3 4))
(check
"loop until"
(ev "(loop for i from 1 to 10 until (= i 5) collect i)")
(list 1 2 3 4))
;; ── LOOP: when / unless ───────────────────────────────────────────────────────
(check
"loop when filter"
(ev "(loop for i from 0 below 8 when (evenp i) collect i)")
(list 0 2 4 6))
(check
"loop unless filter"
(ev "(loop for i from 0 below 8 unless (evenp i) collect i)")
(list 1 3 5 7))
;; ── LOOP: append ─────────────────────────────────────────────────────────────
(check
"loop append"
(ev "(loop for x in '((1 2) (3 4) (5 6)) append x)")
(list 1 2 3 4 5 6))
;; ── LOOP: always, never, thereis ─────────────────────────────────────────────
(check
"loop always true"
(ev "(loop for x in '(2 4 6) always (evenp x))")
true)
(check
"loop always false"
(ev "(loop for x in '(2 3 6) always (evenp x))")
false)
(check "loop never" (ev "(loop for x in '(1 3 5) never (evenp x))") true)
(check "loop thereis" (ev "(loop for x in '(1 2 3) thereis (> x 2))") true)
;; ── LOOP: for = then (general iteration) ─────────────────────────────────────
(check
"loop for = then doubling"
(ev "(loop repeat 5 for x = 1 then (* x 2) collect x)")
(list 1 2 4 8 16))
;; ── summary ────────────────────────────────────────────────────────────────
(define macro-passed passed)
(define macro-failed failed)
(define macro-failures failures)

View File

@@ -0,0 +1,160 @@
;; Common Lisp reader/parser tests
(define cl-test-pass 0)
(define cl-test-fail 0)
(define cl-test-fails (list))
(define
cl-deep=
(fn
(a b)
(cond
((= a b) true)
((and (dict? a) (dict? b))
(let
((ak (keys a)) (bk (keys b)))
(if
(not (= (len ak) (len bk)))
false
(every?
(fn (k) (and (has-key? b k) (cl-deep= (get a k) (get b k))))
ak))))
((and (list? a) (list? b))
(if
(not (= (len a) (len b)))
false
(let
((i 0) (ok true))
(define
chk
(fn
()
(when
(and ok (< i (len a)))
(do
(when
(not (cl-deep= (nth a i) (nth b i)))
(set! ok false))
(set! i (+ i 1))
(chk)))))
(chk)
ok)))
(:else false))))
(define
cl-test
(fn
(name actual expected)
(if
(cl-deep= actual expected)
(set! cl-test-pass (+ cl-test-pass 1))
(do
(set! cl-test-fail (+ cl-test-fail 1))
(append! cl-test-fails {:name name :expected expected :actual actual})))))
;; ── atoms ─────────────────────────────────────────────────────────
(cl-test "integer: 42" (cl-read "42") 42)
(cl-test "integer: 0" (cl-read "0") 0)
(cl-test "integer: negative" (cl-read "-5") -5)
(cl-test "integer: positive sign" (cl-read "+3") 3)
(cl-test "integer: hex #xFF" (cl-read "#xFF") 255)
(cl-test "integer: hex #xAB" (cl-read "#xAB") 171)
(cl-test "integer: binary #b1010" (cl-read "#b1010") 10)
(cl-test "integer: octal #o17" (cl-read "#o17") 15)
(cl-test "float: type" (get (cl-read "3.14") "cl-type") "float")
(cl-test "float: value" (get (cl-read "3.14") "value") "3.14")
(cl-test "float: neg" (get (cl-read "-2.5") "value") "-2.5")
(cl-test "float: exp" (get (cl-read "1.0e10") "value") "1.0e10")
(cl-test "ratio: type" (get (cl-read "1/3") "cl-type") "ratio")
(cl-test "ratio: value" (get (cl-read "1/3") "value") "1/3")
(cl-test "ratio: 22/7" (get (cl-read "22/7") "value") "22/7")
(cl-test "string: basic" (cl-read "\"hello\"") {:cl-type "string" :value "hello"})
(cl-test "string: empty" (cl-read "\"\"") {:cl-type "string" :value ""})
(cl-test "string: with escape" (cl-read "\"a\\nb\"") {:cl-type "string" :value "a\nb"})
(cl-test "symbol: foo" (cl-read "foo") "FOO")
(cl-test "symbol: BAR" (cl-read "BAR") "BAR")
(cl-test "symbol: pkg:sym" (cl-read "cl:car") "CL:CAR")
(cl-test "symbol: pkg::sym" (cl-read "pkg::foo") "PKG::FOO")
(cl-test "nil: symbol" (cl-read "nil") nil)
(cl-test "nil: uppercase" (cl-read "NIL") nil)
(cl-test "t: symbol" (cl-read "t") true)
(cl-test "t: uppercase" (cl-read "T") true)
(cl-test "keyword: type" (get (cl-read ":foo") "cl-type") "keyword")
(cl-test "keyword: name" (get (cl-read ":foo") "name") "FOO")
(cl-test "keyword: :test" (get (cl-read ":test") "name") "TEST")
(cl-test "char: type" (get (cl-read "#\\a") "cl-type") "char")
(cl-test "char: value" (get (cl-read "#\\a") "value") "a")
(cl-test "char: Space" (get (cl-read "#\\Space") "value") " ")
(cl-test "char: Newline" (get (cl-read "#\\Newline") "value") "\n")
(cl-test "uninterned: type" (get (cl-read "#:foo") "cl-type") "uninterned")
(cl-test "uninterned: name" (get (cl-read "#:foo") "name") "FOO")
;; ── lists ─────────────────────────────────────────────────────────
(cl-test "list: empty" (cl-read "()") (list))
(cl-test "list: one element" (cl-read "(foo)") (list "FOO"))
(cl-test "list: two elements" (cl-read "(foo bar)") (list "FOO" "BAR"))
(cl-test "list: nested" (cl-read "((a b) c)") (list (list "A" "B") "C"))
(cl-test "list: with integer" (cl-read "(+ 1 2)") (list "+" 1 2))
(cl-test "list: with string" (cl-read "(print \"hi\")") (list "PRINT" {:cl-type "string" :value "hi"}))
(cl-test "list: nil element" (cl-read "(a nil b)") (list "A" nil "B"))
(cl-test "list: t element" (cl-read "(a t b)") (list "A" true "B"))
;; ── dotted pairs ──────────────────────────────────────────────<E29480><E29480>──
(cl-test "dotted: type" (get (cl-read "(a . b)") "cl-type") "cons")
(cl-test "dotted: car" (get (cl-read "(a . b)") "car") "A")
(cl-test "dotted: cdr" (get (cl-read "(a . b)") "cdr") "B")
(cl-test "dotted: number cdr" (get (cl-read "(x . 42)") "cdr") 42)
;; ── reader macros ────────────────────────────────────────────────<E29480><E29480>
(cl-test "quote: form" (cl-read "'x") (list "QUOTE" "X"))
(cl-test "quote: list" (cl-read "'(a b)") (list "QUOTE" (list "A" "B")))
(cl-test "backquote: form" (cl-read "`x") (list "QUASIQUOTE" "X"))
(cl-test "unquote: form" (cl-read ",x") (list "UNQUOTE" "X"))
(cl-test "comma-at: form" (cl-read ",@x") (list "UNQUOTE-SPLICING" "X"))
(cl-test "function: form" (cl-read "#'foo") (list "FUNCTION" "FOO"))
;; ── vector ────────────────────────────────────────────────────────
(cl-test "vector: type" (get (cl-read "#(1 2 3)") "cl-type") "vector")
(cl-test "vector: elements" (get (cl-read "#(1 2 3)") "elements") (list 1 2 3))
(cl-test "vector: empty" (get (cl-read "#()") "elements") (list))
(cl-test "vector: mixed" (get (cl-read "#(a 1 \"s\")") "elements") (list "A" 1 {:cl-type "string" :value "s"}))
;; ── cl-read-all ───────────────────────────────────────────────────
(cl-test
"read-all: empty"
(cl-read-all "")
(list))
(cl-test
"read-all: two forms"
(cl-read-all "42 foo")
(list 42 "FOO"))
(cl-test
"read-all: three forms"
(cl-read-all "(+ 1 2) (+ 3 4) hello")
(list (list "+" 1 2) (list "+" 3 4) "HELLO"))
(cl-test
"read-all: with comments"
(cl-read-all "; this is a comment\n42 ; inline\nfoo")
(list 42 "FOO"))
(cl-test
"read-all: defun form"
(nth (cl-read-all "(defun square (x) (* x x))") 0)
(list "DEFUN" "SQUARE" (list "X") (list "*" "X" "X")))

View File

@@ -0,0 +1,291 @@
;; geometry.sx — Multiple dispatch with CLOS
;;
;; Demonstrates generic functions dispatching on combinations of
;; geometric types: point, line, plane.
;;
;; Depends on: lib/common-lisp/runtime.sx, lib/common-lisp/clos.sx
;; ── geometric classes ──────────────────────────────────────────────────────
(clos-defclass "geo-point" (list "t") (list {:initform 0 :initarg ":px" :reader nil :writer nil :accessor nil :name "px"} {:initform 0 :initarg ":py" :reader nil :writer nil :accessor nil :name "py"}))
(clos-defclass "geo-line" (list "t") (list {:initform nil :initarg ":p1" :reader nil :writer nil :accessor nil :name "p1"} {:initform nil :initarg ":p2" :reader nil :writer nil :accessor nil :name "p2"}))
(clos-defclass "geo-plane" (list "t") (list {:initform nil :initarg ":normal" :reader nil :writer nil :accessor nil :name "normal"} {:initform 0 :initarg ":d" :reader nil :writer nil :accessor nil :name "d"}))
;; ── helpers ────────────────────────────────────────────────────────────────
(define geo-point-x (fn (p) (clos-slot-value p "px")))
(define geo-point-y (fn (p) (clos-slot-value p "py")))
(define
geo-make-point
(fn (x y) (clos-make-instance "geo-point" ":px" x ":py" y)))
(define
geo-make-line
(fn (p1 p2) (clos-make-instance "geo-line" ":p1" p1 ":p2" p2)))
(define
geo-make-plane
(fn
(nx ny d)
(clos-make-instance "geo-plane" ":normal" (list nx ny) ":d" d)))
;; ── describe generic ───────────────────────────────────────────────────────
(clos-defgeneric "geo-describe" {})
(clos-defmethod
"geo-describe"
(list)
(list "geo-point")
(fn
(args next-fn)
(let
((p (first args)))
(str "P(" (geo-point-x p) "," (geo-point-y p) ")"))))
(clos-defmethod
"geo-describe"
(list)
(list "geo-line")
(fn
(args next-fn)
(let
((l (first args)))
(str
"L["
(clos-call-generic "geo-describe" (list (clos-slot-value l "p1")))
"-"
(clos-call-generic "geo-describe" (list (clos-slot-value l "p2")))
"]"))))
(clos-defmethod
"geo-describe"
(list)
(list "geo-plane")
(fn
(args next-fn)
(let
((pl (first args)))
(str "Plane(d=" (clos-slot-value pl "d") ")"))))
;; ── intersect: multi-dispatch generic ─────────────────────────────────────
;;
;; Returns a string description of the intersection result.
(clos-defgeneric "intersect" {})
;; point ∩ point: same if coordinates match
(clos-defmethod
"intersect"
(list)
(list "geo-point" "geo-point")
(fn
(args next-fn)
(let
((p1 (first args)) (p2 (first (rest args))))
(if
(and
(= (geo-point-x p1) (geo-point-x p2))
(= (geo-point-y p1) (geo-point-y p2)))
"point"
"empty"))))
;; point ∩ line: check if point lies on line (cross product = 0)
(clos-defmethod
"intersect"
(list)
(list "geo-point" "geo-line")
(fn
(args next-fn)
(let
((pt (first args)) (ln (first (rest args))))
(let
((lp1 (clos-slot-value ln "p1")) (lp2 (clos-slot-value ln "p2")))
(let
((dx (- (geo-point-x lp2) (geo-point-x lp1)))
(dy (- (geo-point-y lp2) (geo-point-y lp1)))
(ex (- (geo-point-x pt) (geo-point-x lp1)))
(ey (- (geo-point-y pt) (geo-point-y lp1))))
(if (= (- (* dx ey) (* dy ex)) 0) "point" "empty"))))))
;; line ∩ line: parallel (same slope = empty) or point
(clos-defmethod
"intersect"
(list)
(list "geo-line" "geo-line")
(fn
(args next-fn)
(let
((l1 (first args)) (l2 (first (rest args))))
(let
((p1 (clos-slot-value l1 "p1"))
(p2 (clos-slot-value l1 "p2"))
(p3 (clos-slot-value l2 "p1"))
(p4 (clos-slot-value l2 "p2")))
(let
((dx1 (- (geo-point-x p2) (geo-point-x p1)))
(dy1 (- (geo-point-y p2) (geo-point-y p1)))
(dx2 (- (geo-point-x p4) (geo-point-x p3)))
(dy2 (- (geo-point-y p4) (geo-point-y p3))))
(let
((cross (- (* dx1 dy2) (* dy1 dx2))))
(if (= cross 0) "parallel" "point")))))))
;; line ∩ plane: general case = point (or parallel if line ⊥ normal)
(clos-defmethod
"intersect"
(list)
(list "geo-line" "geo-plane")
(fn
(args next-fn)
(let
((ln (first args)) (pl (first (rest args))))
(let
((p1 (clos-slot-value ln "p1"))
(p2 (clos-slot-value ln "p2"))
(n (clos-slot-value pl "normal")))
(let
((dx (- (geo-point-x p2) (geo-point-x p1)))
(dy (- (geo-point-y p2) (geo-point-y p1)))
(nx (first n))
(ny (first (rest n))))
(let
((dot (+ (* dx nx) (* dy ny))))
(if (= dot 0) "parallel" "point")))))))
;; ── tests ─────────────────────────────────────────────────────────────────
(define passed 0)
(define failed 0)
(define failures (list))
(define
check
(fn
(label got expected)
(if
(= got expected)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str
"FAIL ["
label
"]: got="
(inspect got)
" expected="
(inspect expected)))))))))
;; describe
(check
"describe point"
(clos-call-generic
"geo-describe"
(list (geo-make-point 3 4)))
"P(3,4)")
(check
"describe line"
(clos-call-generic
"geo-describe"
(list
(geo-make-line
(geo-make-point 0 0)
(geo-make-point 1 1))))
"L[P(0,0)-P(1,1)]")
(check
"describe plane"
(clos-call-generic
"geo-describe"
(list (geo-make-plane 0 1 5)))
"Plane(d=5)")
;; intersect point×point
(check
"P∩P same"
(clos-call-generic
"intersect"
(list
(geo-make-point 2 3)
(geo-make-point 2 3)))
"point")
(check
"P∩P diff"
(clos-call-generic
"intersect"
(list
(geo-make-point 1 2)
(geo-make-point 3 4)))
"empty")
;; intersect point×line
(let
((origin (geo-make-point 0 0))
(p10 (geo-make-point 10 0))
(p55 (geo-make-point 5 5))
(l-x
(geo-make-line
(geo-make-point 0 0)
(geo-make-point 10 0))))
(begin
(check
"P∩L on line"
(clos-call-generic "intersect" (list p10 l-x))
"point")
(check
"P∩L on x-axis"
(clos-call-generic "intersect" (list origin l-x))
"point")
(check
"P∩L off line"
(clos-call-generic "intersect" (list p55 l-x))
"empty")))
;; intersect line×line
(let
((horiz (geo-make-line (geo-make-point 0 0) (geo-make-point 10 0)))
(vert
(geo-make-line
(geo-make-point 5 -5)
(geo-make-point 5 5)))
(horiz2
(geo-make-line
(geo-make-point 0 3)
(geo-make-point 10 3))))
(begin
(check
"L∩L crossing"
(clos-call-generic "intersect" (list horiz vert))
"point")
(check
"L∩L parallel"
(clos-call-generic "intersect" (list horiz horiz2))
"parallel")))
;; intersect line×plane
(let
((diag (geo-make-line (geo-make-point 0 0) (geo-make-point 1 1)))
(vert-plane (geo-make-plane 1 0 5))
(diag-plane (geo-make-plane -1 1 0)))
(begin
(check
"L∩Plane cross"
(clos-call-generic "intersect" (list diag vert-plane))
"point")
(check
"L∩Plane parallel"
(clos-call-generic "intersect" (list diag diag-plane))
"parallel")))
;; ── summary ────────────────────────────────────────────────────────────────
(define geo-passed passed)
(define geo-failed failed)
(define geo-failures failures)

View File

@@ -0,0 +1,196 @@
;; interactive-debugger.sx — Condition debugger using *debugger-hook*
;;
;; Demonstrates the classic CL debugger pattern:
;; - *debugger-hook* is invoked when an unhandled error reaches the top level
;; - The hook receives the condition and a reference to itself
;; - It can offer restarts interactively (here simulated with a policy fn)
;;
;; In real CL the debugger reads from the terminal. Here we simulate
;; the "user input" via a policy function passed in at call time.
;;
;; Depends on: lib/common-lisp/runtime.sx already loaded.
;; ── *debugger-hook* global ────────────────────────────────────────────────
;;
;; CL: when error is unhandled, invoke *debugger-hook* with (condition hook).
;; A nil hook means use the system default (which we simulate as re-raise).
(define cl-debugger-hook nil)
;; ── invoke-debugger ────────────────────────────────────────────────────────
;;
;; Called when cl-error finds no handler. Tries cl-debugger-hook first;
;; falls back to a simple error report.
(define
cl-invoke-debugger
(fn
(c)
(if
(nil? cl-debugger-hook)
(error (str "Debugger: " (cl-condition-message c)))
(begin
(let
((hook cl-debugger-hook))
(set! cl-debugger-hook nil)
(let
((result (hook c hook)))
(set! cl-debugger-hook hook)
result))))))
;; ── cl-error/debugger — error that routes through invoke-debugger ─────────
(define
cl-error-with-debugger
(fn
(c &rest args)
(let
((obj (cond ((cl-condition? c) c) ((string? c) (cl-make-condition "simple-error" "format-control" c "format-arguments" args)) (:else (cl-make-condition "simple-error" "format-control" (str c))))))
(cl-signal-obj obj cl-handler-stack)
(cl-invoke-debugger obj))))
;; ── simulated debugger session ────────────────────────────────────────────
;;
;; A debugger hook takes (condition hook) and "reads" user commands.
;; We simulate this with a policy function: (fn (c restarts) restart-name)
;; that picks a restart given the condition and available restarts.
(define
make-policy-debugger
(fn
(policy)
(fn
(c hook)
(let
((available (cl-compute-restarts)))
(let
((choice (policy c available)))
(if
(and choice (not (nil? (cl-find-restart choice))))
(cl-invoke-restart choice)
(error
(str
"Debugger: no restart chosen for: "
(cl-condition-message c)))))))))
;; ── tests ─────────────────────────────────────────────────────────────────
(define passed 0)
(define failed 0)
(define failures (list))
(define
check
(fn
(label got expected)
(if
(= got expected)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str
"FAIL ["
label
"]: got="
(inspect got)
" expected="
(inspect expected)))))))))
(define
reset-stacks!
(fn
()
(set! cl-handler-stack (list))
(set! cl-restart-stack (list))
(set! cl-debugger-hook nil)))
;; Test 1: debugger hook receives condition
(reset-stacks!)
(let
((received-msg ""))
(begin
(set!
cl-debugger-hook
(fn (c hook) (set! received-msg (cl-condition-message c)) nil))
(cl-restart-case
(fn () (cl-error-with-debugger "something broke"))
(list "abort" (list) (fn () nil)))
(check "debugger hook receives condition" received-msg "something broke")))
;; Test 2: policy-driven restart selection (use-zero)
(reset-stacks!)
(let
((result (begin (set! cl-debugger-hook (make-policy-debugger (fn (c restarts) "use-zero"))) (cl-restart-case (fn () (cl-error-with-debugger (cl-make-condition "division-by-zero")) 999) (list "use-zero" (list) (fn () 0))))))
(check "policy debugger: use-zero restart" result 0))
;; Test 3: policy selects abort
(reset-stacks!)
(let
((result (begin (set! cl-debugger-hook (make-policy-debugger (fn (c restarts) "abort"))) (cl-restart-case (fn () (cl-error-with-debugger "aborting error") 999) (list "abort" (list) (fn () "aborted"))))))
(check "policy debugger: abort restart" result "aborted"))
;; Test 4: compute-restarts inside debugger hook
(reset-stacks!)
(let
((seen-restarts (list)))
(begin
(set!
cl-debugger-hook
(fn
(c hook)
(set! seen-restarts (cl-compute-restarts))
(cl-invoke-restart "continue")))
(cl-restart-case
(fn () (cl-error-with-debugger "test") 42)
(list "continue" (list) (fn () "ok"))
(list "abort" (list) (fn () "no")))
(check
"debugger: compute-restarts visible"
(= (len seen-restarts) 2)
true)))
;; Test 5: hook not invoked when handler catches first
(reset-stacks!)
(let
((hook-called false)
(result
(begin
(set! cl-debugger-hook (fn (c hook) (set! hook-called true) nil))
(cl-handler-case
(fn () (cl-error-with-debugger "handled"))
(list "error" (fn (c) "handler-won"))))))
(check "handler wins; hook not called" hook-called false)
(check "handler result returned" result "handler-won"))
;; Test 6: debugger-hook nil after re-raise guard
(reset-stacks!)
(let
((hook-calls 0))
(begin
(set!
cl-debugger-hook
(fn
(c hook)
(set! hook-calls (+ hook-calls 1))
(if
(> hook-calls 1)
(error "infinite loop guard")
(cl-invoke-restart "escape"))))
(cl-restart-case
(fn () (cl-error-with-debugger "once"))
(list "escape" (list) (fn () nil)))
(check
"hook called exactly once (no infinite recursion)"
hook-calls
1)))
;; ── summary ────────────────────────────────────────────────────────────────
(define debugger-passed passed)
(define debugger-failed failed)
(define debugger-failures failures)

View File

@@ -0,0 +1,228 @@
;; mop-trace.sx — :before/:after method tracing with CLOS
;;
;; Classic CLOS pattern: instrument generic functions with :before and :after
;; qualifiers to print call/return traces without modifying the primary method.
;;
;; Depends on: lib/common-lisp/runtime.sx, lib/common-lisp/clos.sx
;; ── trace log (mutable accumulator) ───────────────────────────────────────
(define trace-log (list))
(define
trace-push
(fn (msg) (set! trace-log (append trace-log (list msg)))))
(define trace-clear (fn () (set! trace-log (list))))
;; ── domain classes ─────────────────────────────────────────────────────────
(clos-defclass "shape" (list "t") (list {:initform "white" :initarg ":color" :reader nil :writer nil :accessor nil :name "color"}))
(clos-defclass "circle" (list "shape") (list {:initform 1 :initarg ":radius" :reader nil :writer nil :accessor nil :name "radius"}))
(clos-defclass "rect" (list "shape") (list {:initform 1 :initarg ":width" :reader nil :writer nil :accessor nil :name "width"} {:initform 1 :initarg ":height" :reader nil :writer nil :accessor nil :name "height"}))
;; ── generic function: area ─────────────────────────────────────────────────
(clos-defgeneric "area" {})
;; primary methods
(clos-defmethod
"area"
(list)
(list "circle")
(fn
(args next-fn)
(let
((c (first args)))
(let ((r (clos-slot-value c "radius"))) (* r r)))))
(clos-defmethod
"area"
(list)
(list "rect")
(fn
(args next-fn)
(let
((r (first args)))
(* (clos-slot-value r "width") (clos-slot-value r "height")))))
;; :before tracing
(clos-defmethod
"area"
(list "before")
(list "shape")
(fn
(args next-fn)
(trace-push (str "BEFORE area(" (clos-class-of (first args)) ")"))))
;; :after tracing
(clos-defmethod
"area"
(list "after")
(list "shape")
(fn
(args next-fn)
(trace-push (str "AFTER area(" (clos-class-of (first args)) ")"))))
;; ── generic function: describe-shape ──────────────────────────────────────
(clos-defgeneric "describe-shape" {})
(clos-defmethod
"describe-shape"
(list)
(list "shape")
(fn
(args next-fn)
(let
((s (first args)))
(str "shape[" (clos-slot-value s "color") "]"))))
(clos-defmethod
"describe-shape"
(list)
(list "circle")
(fn
(args next-fn)
(let
((c (first args)))
(str
"circle[r="
(clos-slot-value c "radius")
" "
(clos-call-next-method next-fn)
"]"))))
(clos-defmethod
"describe-shape"
(list)
(list "rect")
(fn
(args next-fn)
(let
((r (first args)))
(str
"rect["
(clos-slot-value r "width")
"x"
(clos-slot-value r "height")
" "
(clos-call-next-method next-fn)
"]"))))
;; :before on base shape (fires for all subclasses too)
(clos-defmethod
"describe-shape"
(list "before")
(list "shape")
(fn
(args next-fn)
(trace-push
(str "BEFORE describe-shape(" (clos-class-of (first args)) ")"))))
;; ── tests ─────────────────────────────────────────────────────────────────
(define passed 0)
(define failed 0)
(define failures (list))
(define
check
(fn
(label got expected)
(if
(= got expected)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str
"FAIL ["
label
"]: got="
(inspect got)
" expected="
(inspect expected)))))))))
;; ── area tests ────────────────────────────────────────────────────────────
;; circle area = r*r (no pi — integer arithmetic for predictability)
(let
((c (clos-make-instance "circle" ":radius" 5 ":color" "red")))
(do
(trace-clear)
(check "circle area" (clos-call-generic "area" (list c)) 25)
(check
":before fired for circle"
(= (first trace-log) "BEFORE area(circle)")
true)
(check
":after fired for circle"
(= (first (rest trace-log)) "AFTER area(circle)")
true)
(check "trace length 2" (len trace-log) 2)))
;; rect area = w*h
(let
((r (clos-make-instance "rect" ":width" 4 ":height" 6 ":color" "blue")))
(do
(trace-clear)
(check "rect area" (clos-call-generic "area" (list r)) 24)
(check
":before fired for rect"
(= (first trace-log) "BEFORE area(rect)")
true)
(check
":after fired for rect"
(= (first (rest trace-log)) "AFTER area(rect)")
true)
(check "trace length 2 (rect)" (len trace-log) 2)))
;; ── describe-shape tests ───────────────────────────────────────────────────
(let
((c (clos-make-instance "circle" ":radius" 3 ":color" "green")))
(do
(trace-clear)
(check
"circle describe"
(clos-call-generic "describe-shape" (list c))
"circle[r=3 shape[green]]")
(check
":before fired for describe circle"
(= (first trace-log) "BEFORE describe-shape(circle)")
true)))
(let
((r (clos-make-instance "rect" ":width" 2 ":height" 7 ":color" "black")))
(do
(trace-clear)
(check
"rect describe"
(clos-call-generic "describe-shape" (list r))
"rect[2x7 shape[black]]")
(check
":before fired for describe rect"
(= (first trace-log) "BEFORE describe-shape(rect)")
true)))
;; ── call-next-method: circle -> shape ─────────────────────────────────────
(let
((c (clos-make-instance "circle" ":radius" 1 ":color" "purple")))
(check
"call-next-method result in describe"
(clos-call-generic "describe-shape" (list c))
"circle[r=1 shape[purple]]"))
;; ── summary ────────────────────────────────────────────────────────────────
(define mop-passed passed)
(define mop-failed failed)
(define mop-failures failures)

View File

@@ -0,0 +1,163 @@
;; parse-recover.sx — Parser with skipped-token restart
;;
;; Classic CL pattern: a simple token parser that signals a condition
;; when it encounters an unexpected token. The :skip-token restart
;; allows the parser to continue past the offending token.
;;
;; Depends on: lib/common-lisp/runtime.sx already loaded.
;; ── condition type ─────────────────────────────────────────────────────────
(cl-define-condition "parse-error" (list "error") (list "token" "position"))
;; ── simple token parser ────────────────────────────────────────────────────
;;
;; parse-numbers: given a list of tokens (strings), parse integers.
;; Non-integer tokens signal parse-error with two restarts:
;; skip-token — skip the bad token and continue
;; use-zero — use 0 in place of the bad token
(define
parse-numbers
(fn
(tokens)
(define result (list))
(define
process
(fn
(toks)
(if
(empty? toks)
result
(let
((tok (first toks)) (rest-toks (rest toks)))
(let
((n (string->number tok 10)))
(if
n
(begin
(set! result (append result (list n)))
(process rest-toks))
(cl-restart-case
(fn
()
(cl-signal
(cl-make-condition
"parse-error"
"token"
tok
"position"
(len result)))
(set! result (append result (list 0)))
(process rest-toks))
(list "skip-token" (list) (fn () (process rest-toks)))
(list
"use-zero"
(list)
(fn
()
(begin
(set! result (append result (list 0)))
(process rest-toks)))))))))))
(process tokens)
result))
;; ── tests ─────────────────────────────────────────────────────────────────
(define passed 0)
(define failed 0)
(define failures (list))
(define
check
(fn
(label got expected)
(if
(= got expected)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str
"FAIL ["
label
"]: got="
(inspect got)
" expected="
(inspect expected)))))))))
(define
reset-stacks!
(fn () (set! cl-handler-stack (list)) (set! cl-restart-stack (list))))
;; All valid tokens
(reset-stacks!)
(check
"all valid: 1 2 3"
(cl-handler-bind
(list (list "parse-error" (fn (c) (cl-invoke-restart "skip-token"))))
(fn () (parse-numbers (list "1" "2" "3"))))
(list 1 2 3))
;; Skip bad token
(reset-stacks!)
(check
"skip bad token: 1 x 3 -> (1 3)"
(cl-handler-bind
(list (list "parse-error" (fn (c) (cl-invoke-restart "skip-token"))))
(fn () (parse-numbers (list "1" "x" "3"))))
(list 1 3))
;; Use zero for bad token
(reset-stacks!)
(check
"use-zero for bad: 1 x 3 -> (1 0 3)"
(cl-handler-bind
(list (list "parse-error" (fn (c) (cl-invoke-restart "use-zero"))))
(fn () (parse-numbers (list "1" "x" "3"))))
(list 1 0 3))
;; Multiple bad tokens, all skipped
(reset-stacks!)
(check
"skip multiple bad: a 2 b 4 -> (2 4)"
(cl-handler-bind
(list (list "parse-error" (fn (c) (cl-invoke-restart "skip-token"))))
(fn () (parse-numbers (list "a" "2" "b" "4"))))
(list 2 4))
;; handler-case: abort on first bad token
(reset-stacks!)
(check
"handler-case: abort on first bad"
(cl-handler-case
(fn () (parse-numbers (list "1" "bad" "3")))
(list
"parse-error"
(fn
(c)
(str
"parse error at position "
(cl-condition-slot c "position")
": "
(cl-condition-slot c "token")))))
"parse error at position 1: bad")
;; Verify condition type hierarchy
(reset-stacks!)
(check
"parse-error isa error"
(cl-condition-of-type?
(cl-make-condition "parse-error" "token" "x" "position" 0)
"error")
true)
;; ── summary ────────────────────────────────────────────────────────────────
(define parse-passed passed)
(define parse-failed failed)
(define parse-failures failures)

View File

@@ -0,0 +1,141 @@
;; restart-demo.sx — Classic CL condition system demo
;;
;; Demonstrates resumable exceptions via restarts.
;; The `safe-divide` function signals a division-by-zero condition
;; and offers two restarts:
;; :use-zero — return 0 as the result
;; :retry — call safe-divide again with a corrected divisor
;;
;; Depends on: lib/common-lisp/runtime.sx already loaded.
;; ── safe-divide ────────────────────────────────────────────────────────────
;;
;; Divides numerator by denominator.
;; When denominator is 0, signals division-by-zero with two restarts.
(define
safe-divide
(fn
(n d)
(if
(= d 0)
(cl-restart-case
(fn
()
(cl-signal
(cl-make-condition
"division-by-zero"
"operation"
"/"
"operands"
(list n d)))
(error "division by zero — no restart invoked"))
(list "use-zero" (list) (fn () 0))
(list "retry" (list "d") (fn (d2) (safe-divide n d2))))
(/ n d))))
;; ── tests ─────────────────────────────────────────────────────────────────
(define passed 0)
(define failed 0)
(define failures (list))
(define
check
(fn
(label got expected)
(if
(= got expected)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str
"FAIL ["
label
"]: got="
(inspect got)
" expected="
(inspect expected)))))))))
(define
reset-stacks!
(fn () (set! cl-handler-stack (list)) (set! cl-restart-stack (list))))
;; Normal division
(reset-stacks!)
(check "10 / 2 = 5" (safe-divide 10 2) 5)
;; Invoke use-zero restart
(reset-stacks!)
(check
"10 / 0 -> use-zero"
(cl-handler-bind
(list
(list "division-by-zero" (fn (c) (cl-invoke-restart "use-zero"))))
(fn () (safe-divide 10 0)))
0)
;; Invoke retry restart with a corrected denominator
(reset-stacks!)
(check
"10 / 0 -> retry with 2"
(cl-handler-bind
(list
(list
"division-by-zero"
(fn (c) (cl-invoke-restart "retry" 2))))
(fn () (safe-divide 10 0)))
5)
;; Nested calls: outer handles the inner divide-by-zero
(reset-stacks!)
(check
"nested: 20 / (0->4) = 5"
(cl-handler-bind
(list
(list
"division-by-zero"
(fn (c) (cl-invoke-restart "retry" 4))))
(fn () (let ((r1 (safe-divide 20 0))) r1)))
5)
;; handler-case — unwinding version
(reset-stacks!)
(check
"handler-case: catches division-by-zero"
(cl-handler-case
(fn () (safe-divide 9 0))
(list "division-by-zero" (fn (c) "caught!")))
"caught!")
;; Verify use-zero is idempotent (two uses)
(reset-stacks!)
(check
"two use-zero invocations"
(cl-handler-bind
(list
(list "division-by-zero" (fn (c) (cl-invoke-restart "use-zero"))))
(fn
()
(+
(safe-divide 10 0)
(safe-divide 3 0))))
0)
;; No restart needed for normal division
(reset-stacks!)
(check
"no restart needed for 8/4"
(safe-divide 8 4)
2)
;; ── summary ────────────────────────────────────────────────────────────────
(define demo-passed passed)
(define demo-failed failed)
(define demo-failures failures)

View File

@@ -0,0 +1,180 @@
;; Common Lisp tokenizer tests
(define cl-test-pass 0)
(define cl-test-fail 0)
(define cl-test-fails (list))
(define
cl-test
(fn
(name actual expected)
(if
(= actual expected)
(set! cl-test-pass (+ cl-test-pass 1))
(do
(set! cl-test-fail (+ cl-test-fail 1))
(append! cl-test-fails {:name name :expected expected :actual actual})))))
;; Helpers: extract types and values from token stream (drops eof)
(define
cl-tok-types
(fn
(src)
(map
(fn (t) (get t "type"))
(filter (fn (t) (not (= (get t "type") "eof"))) (cl-tokenize src)))))
(define
cl-tok-values
(fn
(src)
(map
(fn (t) (get t "value"))
(filter (fn (t) (not (= (get t "type") "eof"))) (cl-tokenize src)))))
(define
cl-tok-first
(fn (src) (nth (cl-tokenize src) 0)))
;; ── symbols ───────────────────────────────────────────────────────
(cl-test "symbol: bare lowercase" (cl-tok-values "foo") (list "FOO"))
(cl-test "symbol: uppercase" (cl-tok-values "BAR") (list "BAR"))
(cl-test "symbol: mixed case folded" (cl-tok-values "FooBar") (list "FOOBAR"))
(cl-test "symbol: with hyphen" (cl-tok-values "foo-bar") (list "FOO-BAR"))
(cl-test "symbol: with star" (cl-tok-values "*special*") (list "*SPECIAL*"))
(cl-test "symbol: with question" (cl-tok-values "null?") (list "NULL?"))
(cl-test "symbol: with exclamation" (cl-tok-values "set!") (list "SET!"))
(cl-test "symbol: plus sign alone" (cl-tok-values "+") (list "+"))
(cl-test "symbol: minus sign alone" (cl-tok-values "-") (list "-"))
(cl-test "symbol: type is symbol" (cl-tok-types "foo") (list "symbol"))
;; ── package-qualified symbols ─────────────────────────────────────
(cl-test "symbol: pkg:sym external" (cl-tok-values "cl:car") (list "CL:CAR"))
(cl-test "symbol: pkg::sym internal" (cl-tok-values "pkg::foo") (list "PKG::FOO"))
(cl-test "symbol: cl:car type" (cl-tok-types "cl:car") (list "symbol"))
;; ── keywords ──────────────────────────────────────────────────────
(cl-test "keyword: basic" (cl-tok-values ":foo") (list "FOO"))
(cl-test "keyword: type" (cl-tok-types ":foo") (list "keyword"))
(cl-test "keyword: upcase" (cl-tok-values ":hello-world") (list "HELLO-WORLD"))
(cl-test "keyword: multiple" (cl-tok-types ":a :b :c") (list "keyword" "keyword" "keyword"))
;; ── integers ──────────────────────────────────────────────────────
(cl-test "integer: zero" (cl-tok-values "0") (list "0"))
(cl-test "integer: positive" (cl-tok-values "42") (list "42"))
(cl-test "integer: negative" (cl-tok-values "-5") (list "-5"))
(cl-test "integer: positive-sign" (cl-tok-values "+3") (list "+3"))
(cl-test "integer: type" (cl-tok-types "42") (list "integer"))
(cl-test "integer: multi-digit" (cl-tok-values "12345678") (list "12345678"))
;; ── hex, binary, octal ───────────────────────────────────────────
(cl-test "hex: lowercase x" (cl-tok-values "#xFF") (list "#xFF"))
(cl-test "hex: uppercase X" (cl-tok-values "#XFF") (list "#XFF"))
(cl-test "hex: type" (cl-tok-types "#xFF") (list "integer"))
(cl-test "hex: zero" (cl-tok-values "#x0") (list "#x0"))
(cl-test "binary: #b" (cl-tok-values "#b1010") (list "#b1010"))
(cl-test "binary: type" (cl-tok-types "#b1010") (list "integer"))
(cl-test "octal: #o" (cl-tok-values "#o17") (list "#o17"))
(cl-test "octal: type" (cl-tok-types "#o17") (list "integer"))
;; ── floats ────────────────────────────────────────────────────────
(cl-test "float: basic" (cl-tok-values "3.14") (list "3.14"))
(cl-test "float: type" (cl-tok-types "3.14") (list "float"))
(cl-test "float: negative" (cl-tok-values "-2.5") (list "-2.5"))
(cl-test "float: exponent" (cl-tok-values "1.0e10") (list "1.0e10"))
(cl-test "float: neg exponent" (cl-tok-values "1.5e-3") (list "1.5e-3"))
(cl-test "float: leading dot" (cl-tok-values ".5") (list "0.5"))
(cl-test "float: exp only" (cl-tok-values "1e5") (list "1e5"))
;; ── ratios ────────────────────────────────────────────────────────
(cl-test "ratio: 1/3" (cl-tok-values "1/3") (list "1/3"))
(cl-test "ratio: type" (cl-tok-types "1/3") (list "ratio"))
(cl-test "ratio: 22/7" (cl-tok-values "22/7") (list "22/7"))
(cl-test "ratio: negative" (cl-tok-values "-1/2") (list "-1/2"))
;; ── strings ───────────────────────────────────────────────────────
(cl-test "string: empty" (cl-tok-values "\"\"") (list ""))
(cl-test "string: basic" (cl-tok-values "\"hello\"") (list "hello"))
(cl-test "string: type" (cl-tok-types "\"hello\"") (list "string"))
(cl-test "string: with space" (cl-tok-values "\"hello world\"") (list "hello world"))
(cl-test "string: escaped quote" (cl-tok-values "\"say \\\"hi\\\"\"") (list "say \"hi\""))
(cl-test "string: escaped backslash" (cl-tok-values "\"a\\\\b\"") (list "a\\b"))
(cl-test "string: newline escape" (cl-tok-values "\"a\\nb\"") (list "a\nb"))
(cl-test "string: tab escape" (cl-tok-values "\"a\\tb\"") (list "a\tb"))
;; ── characters ────────────────────────────────────────────────────
(cl-test "char: lowercase a" (cl-tok-values "#\\a") (list "a"))
(cl-test "char: uppercase A" (cl-tok-values "#\\A") (list "A"))
(cl-test "char: digit" (cl-tok-values "#\\1") (list "1"))
(cl-test "char: type" (cl-tok-types "#\\a") (list "char"))
(cl-test "char: Space" (cl-tok-values "#\\Space") (list " "))
(cl-test "char: Newline" (cl-tok-values "#\\Newline") (list "\n"))
(cl-test "char: Tab" (cl-tok-values "#\\Tab") (list "\t"))
(cl-test "char: Return" (cl-tok-values "#\\Return") (list "\r"))
;; ── reader macros ─────────────────────────────────────────────────
(cl-test "quote: type" (cl-tok-types "'x") (list "quote" "symbol"))
(cl-test "backquote: type" (cl-tok-types "`x") (list "backquote" "symbol"))
(cl-test "comma: type" (cl-tok-types ",x") (list "comma" "symbol"))
(cl-test "comma-at: type" (cl-tok-types ",@x") (list "comma-at" "symbol"))
(cl-test "hash-quote: type" (cl-tok-types "#'foo") (list "hash-quote" "symbol"))
(cl-test "hash-paren: type" (cl-tok-types "#(1 2)") (list "hash-paren" "integer" "integer" "rparen"))
;; ── uninterned ────────────────────────────────────────────────────
(cl-test "uninterned: type" (cl-tok-types "#:foo") (list "uninterned"))
(cl-test "uninterned: value upcase" (cl-tok-values "#:foo") (list "FOO"))
(cl-test "uninterned: compound" (cl-tok-values "#:my-sym") (list "MY-SYM"))
;; ── parens and structure ──────────────────────────────────────────
(cl-test "paren: empty list" (cl-tok-types "()") (list "lparen" "rparen"))
(cl-test "paren: nested" (cl-tok-types "((a))") (list "lparen" "lparen" "symbol" "rparen" "rparen"))
(cl-test "dot: standalone" (cl-tok-types "(a . b)") (list "lparen" "symbol" "dot" "symbol" "rparen"))
;; ── comments ──────────────────────────────────────────────────────
(cl-test "comment: line" (cl-tok-types "; comment\nfoo") (list "symbol"))
(cl-test "comment: inline" (cl-tok-values "foo ; bar\nbaz") (list "FOO" "BAZ"))
(cl-test "block-comment: basic" (cl-tok-types "#| hello |# foo") (list "symbol"))
(cl-test "block-comment: nested" (cl-tok-types "#| a #| b |# c |# x") (list "symbol"))
;; ── combined ──────────────────────────────────────────────────────
(cl-test
"combined: defun skeleton"
(cl-tok-types "(defun foo (x) x)")
(list "lparen" "symbol" "symbol" "lparen" "symbol" "rparen" "symbol" "rparen"))
(cl-test
"combined: let form"
(cl-tok-types "(let ((x 1)) x)")
(list
"lparen"
"symbol"
"lparen"
"lparen"
"symbol"
"integer"
"rparen"
"rparen"
"symbol"
"rparen"))
(cl-test
"combined: whitespace skip"
(cl-tok-values " foo bar baz ")
(list "FOO" "BAR" "BAZ"))
(cl-test "eof: present" (get (nth (cl-tokenize "") 0) "type") "eof")
(cl-test "eof: at end of tokens" (get (nth (cl-tokenize "x") 1) "type") "eof")

View File

@@ -0,0 +1,285 @@
;; lib/common-lisp/tests/stdlib.sx — Phase 6: sequence, list, string functions
(define ev (fn (src) (cl-eval-str src (cl-make-env))))
(define passed 0)
(define failed 0)
(define failures (list))
(define
check
(fn
(label got expected)
(if
(= got expected)
(set! passed (+ passed 1))
(begin
(set! failed (+ failed 1))
(set!
failures
(append
failures
(list
(str
"FAIL ["
label
"]: got="
(inspect got)
" expected="
(inspect expected)))))))))
;; ── mapc ─────────────────────────────────────────────────────────
(check "mapc returns list"
(ev "(mapc #'1+ '(1 2 3))")
(list 1 2 3))
;; ── mapcan ───────────────────────────────────────────────────────
(check "mapcan basic"
(ev "(mapcan (lambda (x) (list x (* x x))) '(1 2 3))")
(list 1 1 2 4 3 9))
(check "mapcan filter-like"
(ev "(mapcan (lambda (x) (if (evenp x) (list x) nil)) '(1 2 3 4 5 6))")
(list 2 4 6))
;; ── reduce ───────────────────────────────────────────────────────
(check "reduce sum"
(ev "(reduce #'+ '(1 2 3 4 5))")
15)
(check "reduce with initial-value"
(ev "(reduce #'+ '(1 2 3) :initial-value 10)")
16)
(check "reduce max"
(ev "(reduce (lambda (a b) (if (> a b) a b)) '(3 1 4 1 5 9 2 6))")
9)
;; ── find ─────────────────────────────────────────────────────────
(check "find present"
(ev "(find 3 '(1 2 3 4 5))")
3)
(check "find absent"
(ev "(find 9 '(1 2 3))")
nil)
(check "find-if present"
(ev "(find-if #'evenp '(1 3 4 7))")
4)
(check "find-if absent"
(ev "(find-if #'evenp '(1 3 5))")
nil)
(check "find-if-not"
(ev "(find-if-not #'evenp '(2 4 5 6))")
5)
;; ── position ─────────────────────────────────────────────────────
(check "position found"
(ev "(position 3 '(1 2 3 4 5))")
2)
(check "position not found"
(ev "(position 9 '(1 2 3))")
nil)
(check "position-if"
(ev "(position-if #'evenp '(1 3 4 8))")
2)
;; ── count ────────────────────────────────────────────────────────
(check "count"
(ev "(count 2 '(1 2 3 2 4 2))")
3)
(check "count-if"
(ev "(count-if #'evenp '(1 2 3 4 5 6))")
3)
;; ── every / some / notany / notevery ─────────────────────────────
(check "every true"
(ev "(every #'evenp '(2 4 6))")
true)
(check "every false"
(ev "(every #'evenp '(2 3 6))")
nil)
(check "every empty"
(ev "(every #'evenp '())")
true)
(check "some truthy"
(ev "(some #'evenp '(1 3 4))")
true)
(check "some nil"
(ev "(some #'evenp '(1 3 5))")
nil)
(check "notany true"
(ev "(notany #'evenp '(1 3 5))")
true)
(check "notany false"
(ev "(notany #'evenp '(1 2 5))")
nil)
(check "notevery false"
(ev "(notevery #'evenp '(2 4 6))")
nil)
(check "notevery true"
(ev "(notevery #'evenp '(2 3 6))")
true)
;; ── remove ───────────────────────────────────────────────────────
(check "remove"
(ev "(remove 3 '(1 2 3 4 3 5))")
(list 1 2 4 5))
(check "remove-if"
(ev "(remove-if #'evenp '(1 2 3 4 5 6))")
(list 1 3 5))
(check "remove-if-not"
(ev "(remove-if-not #'evenp '(1 2 3 4 5 6))")
(list 2 4 6))
;; ── member ───────────────────────────────────────────────────────
(check "member found"
(ev "(member 3 '(1 2 3 4 5))")
(list 3 4 5))
(check "member not found"
(ev "(member 9 '(1 2 3))")
nil)
;; ── subst ────────────────────────────────────────────────────────
(check "subst flat"
(ev "(subst 'b 'a '(a b c a))")
(list "B" "B" "C" "B"))
(check "subst nested"
(ev "(subst 99 1 '(1 (2 1) 3))")
(list 99 (list 2 99) 3))
;; ── assoc ────────────────────────────────────────────────────────
(check "assoc found"
(ev "(assoc 'b '((a 1) (b 2) (c 3)))")
(list "B" 2))
(check "assoc not found"
(ev "(assoc 'z '((a 1) (b 2)))")
nil)
;; ── list ops ─────────────────────────────────────────────────────
(check "last"
(ev "(last '(1 2 3 4))")
(list 4))
(check "butlast"
(ev "(butlast '(1 2 3 4))")
(list 1 2 3))
(check "nthcdr"
(ev "(nthcdr 2 '(a b c d))")
(list "C" "D"))
(check "list*"
(ev "(list* 1 2 '(3 4))")
(list 1 2 3 4))
(check "cadr"
(ev "(cadr '(1 2 3))")
2)
(check "caddr"
(ev "(caddr '(1 2 3))")
3)
(check "cadddr"
(ev "(cadddr '(1 2 3 4))")
4)
(check "cddr"
(ev "(cddr '(1 2 3 4))")
(list 3 4))
;; ── subseq ───────────────────────────────────────────────────────
(check "subseq string"
(ev "(subseq \"hello\" 1 3)")
"el")
(check "subseq list"
(ev "(subseq '(a b c d) 1 3)")
(list "B" "C"))
(check "subseq no end"
(ev "(subseq \"hello\" 2)")
"llo")
;; ── FORMAT ─────────────────────────────────────────────────────────
(check "format ~A"
(ev "(format nil \"hello ~A\" \"world\")")
"hello world")
(check "format ~D"
(ev "(format nil \"~D items\" 42)")
"42 items")
(check "format two args"
(ev "(format nil \"~A ~A\" 1 2)")
"1 2")
(check "format ~A+~A=~A"
(ev "(format nil \"~A + ~A = ~A\" 1 2 3)")
"1 + 2 = 3")
(check "format iterate"
(ev "(format nil \"~{~A~}\" (quote (1 2 3)))")
"123")
(check "format iterate with space"
(ev "(format nil \"(~{~A ~})\" (quote (1 2 3)))")
"(1 2 3 )")
;; ── packages ─────────────────────────────────────────────────────
(check "defpackage returns name"
(ev "(defpackage :my-pkg (:use :cl))")
"MY-PKG")
(check "in-package"
(ev "(progn (defpackage :test-pkg) (in-package :test-pkg) (package-name))")
"TEST-PKG")
(check "package-qualified function"
(ev "(cl:car (quote (1 2 3)))")
1)
(check "package-qualified function 2"
(ev "(cl:mapcar (function evenp) (quote (2 3 4)))")
(list true nil true))
;; ── summary ──────────────────────────────────────────────────────
(define stdlib-passed passed)
(define stdlib-failed failed)
(define stdlib-failures failures)

View File

@@ -50,65 +50,65 @@ Core mapping:
## Roadmap
### Phase 1 — reader + parser
- [ ] Tokenizer: symbols (with package qualification `pkg:sym` / `pkg::sym`), numbers (int, float, ratio `1/3`, `#xFF`, `#b1010`, `#o17`), strings `"…"` with `\` escapes, characters `#\Space` `#\Newline` `#\a`, comments `;`, block comments `#| … |#`
- [ ] Reader: list, dotted pair, quote `'`, function `#'`, quasiquote `` ` ``, unquote `,`, splice `,@`, vector `#(…)`, uninterned `#:foo`, nil/t literals
- [ ] Parser: lambda lists with `&optional` `&rest` `&key` `&aux` `&allow-other-keys`, defaults, supplied-p variables
- [ ] Unit tests in `lib/common-lisp/tests/read.sx`
- [x] Tokenizer: symbols (with package qualification `pkg:sym` / `pkg::sym`), numbers (int, float, ratio `1/3`, `#xFF`, `#b1010`, `#o17`), strings `"…"` with `\` escapes, characters `#\Space` `#\Newline` `#\a`, comments `;`, block comments `#| … |#`
- [x] Reader: list, dotted pair, quote `'`, function `#'`, quasiquote `` ` ``, unquote `,`, splice `,@`, vector `#(…)`, uninterned `#:foo`, nil/t literals
- [x] Parser: lambda lists with `&optional` `&rest` `&key` `&aux` `&allow-other-keys`, defaults, supplied-p variables
- [x] Unit tests in `lib/common-lisp/tests/read.sx`
### Phase 2 — sequential eval + special forms
- [ ] `cl-eval-ast`: `quote`, `if`, `progn`, `let`, `let*`, `flet`, `labels`, `setq`, `setf` (subset), `function`, `lambda`, `the`, `locally`, `eval-when`
- [ ] `block` + `return-from` via captured continuation
- [ ] `tagbody` + `go` via per-tag continuations
- [ ] `unwind-protect` cleanup frame
- [ ] `multiple-value-bind`, `multiple-value-call`, `multiple-value-prog1`, `values`, `nth-value`
- [ ] `defun`, `defparameter`, `defvar`, `defconstant`, `declaim`, `proclaim` (no-op)
- [ ] Dynamic variables — `defvar`/`defparameter` produce specials; `let` rebinds via parameterize-style scope
- [ ] 60+ tests in `lib/common-lisp/tests/eval.sx`
- [x] `cl-eval-ast`: `quote`, `if`, `progn`, `let`, `let*`, `flet`, `labels`, `setq`, `setf` (subset), `function`, `lambda`, `the`, `locally`, `eval-when`
- [x] `block` + `return-from` via captured continuation
- [x] `tagbody` + `go` via per-tag continuations
- [x] `unwind-protect` cleanup frame
- [x] `multiple-value-bind`, `multiple-value-call`, `multiple-value-prog1`, `values`, `nth-value`
- [x] `defun`, `defparameter`, `defvar`, `defconstant`, `declaim`, `proclaim` (no-op)
- [x] Dynamic variables — `defvar`/`defparameter` produce specials; `let` rebinds via parameterize-style scope
- [x] 182 tests in `lib/common-lisp/tests/eval.sx`
### Phase 3 — conditions + restarts (THE SHOWCASE)
- [ ] `define-condition` — class hierarchy rooted at `condition`/`error`/`warning`/`simple-error`/`simple-warning`/`type-error`/`arithmetic-error`/`division-by-zero`
- [ ] `signal`, `error`, `cerror`, `warn` — all walk the handler chain
- [ ] `handler-bind` — non-unwinding handlers, may decline by returning normally
- [ ] `handler-case` — unwinding handlers (delcc abort)
- [ ] `restart-case`, `with-simple-restart`, `restart-bind`
- [ ] `find-restart`, `invoke-restart`, `invoke-restart-interactively`, `compute-restarts`
- [ ] `with-condition-restarts` — associate restarts with a specific condition
- [ ] `*break-on-signals*`, `*debugger-hook*` (basic)
- [ ] Classic programs in `lib/common-lisp/tests/programs/`:
- [ ] `restart-demo.lisp` — division with `:use-zero` and `:retry` restarts
- [ ] `parse-recover.lisp` — parser with skipped-token restart
- [ ] `interactive-debugger.lisp`ASCII REPL using `:debugger-hook`
- [ ] `lib/common-lisp/conformance.sh` + runner, `scoreboard.json` + `scoreboard.md`
- [x] `define-condition` — class hierarchy rooted at `condition`/`error`/`warning`/`simple-error`/`simple-warning`/`type-error`/`arithmetic-error`/`division-by-zero`
- [x] `signal`, `error`, `cerror`, `warn` — all walk the handler chain
- [x] `handler-bind` — non-unwinding handlers, may decline by returning normally
- [x] `handler-case` — unwinding handlers (call/cc escape)
- [x] `restart-case`, `with-simple-restart`, `restart-bind`
- [x] `find-restart`, `invoke-restart`, `compute-restarts`
- [x] `with-condition-restarts` — associate restarts with a specific condition
- [x] `invoke-restart-interactively`, `*break-on-signals*`, `*debugger-hook*` (basic)
- [x] Classic programs in `lib/common-lisp/tests/programs/`:
- [x] `restart-demo.sx` — division with `use-zero` and `retry` restarts (7 tests)
- [x] `parse-recover.sx` — parser with skipped-token restart (6 tests)
- [x] `interactive-debugger.sx`policy-driven debugger hook, *debugger-hook* global (7 tests)
- [x] `lib/common-lisp/conformance.sh` + runner, `scoreboard.json` + `scoreboard.md` (363 total tests)
### Phase 4 — CLOS
- [ ] `defclass` with `:initarg`/`:initform`/`:accessor`/`:reader`/`:writer`/`:allocation`
- [ ] `make-instance`, `slot-value`, `(setf slot-value)`, `with-slots`, `with-accessors`
- [ ] `defgeneric` with `:method-combination` (standard, plus `+`, `and`, `or`)
- [ ] `defmethod` with `:before` / `:after` / `:around` qualifiers
- [ ] `call-next-method` (continuation), `next-method-p`
- [ ] `class-of`, `find-class`, `slot-boundp`, `change-class` (basic)
- [ ] Multiple dispatch — method specificity by argument-class precedence list
- [ ] Built-in classes registered for tagged values (`integer`, `float`, `string`, `symbol`, `cons`, `null`, `t`)
- [ ] Classic programs:
- [ ] `geometry.lisp``intersect` generic dispatching on (point line), (line line), (line plane)
- [ ] `mop-trace.lisp``:before` + `:after` printing call trace
- [x] `defclass` with `:initarg`/`:initform`/`:accessor`/`:reader`/`:writer`/`:allocation`
- [x] `make-instance`, `slot-value`, `(setf slot-value)`, `with-slots`, `with-accessors`
- [x] `defgeneric` with `:method-combination` (standard, plus `+`, `and`, `or`)
- [x] `defmethod` with `:before` / `:after` / `:around` qualifiers
- [x] `call-next-method` (continuation), `next-method-p`
- [x] `class-of`, `find-class`, `slot-boundp`, `change-class` (basic)
- [x] Multiple dispatch — method specificity by argument-class precedence list
- [x] Built-in classes registered for tagged values (`integer`, `float`, `string`, `symbol`, `cons`, `null`, `t`)
- [x] Classic programs:
- [x] `geometry.sx``intersect` generic dispatching on (point line), (line line), (line plane) — 12 tests
- [x] `mop-trace.sx``:before` + `:after` printing call trace — 13 tests
### Phase 5 — macros + LOOP + reader macros
- [ ] `defmacro`, `macrolet`, `symbol-macrolet`, `macroexpand-1`, `macroexpand`
- [ ] `gensym`, `gentemp`
- [ ] `set-macro-character`, `set-dispatch-macro-character`, `get-macro-character`
- [ ] **The LOOP macro** — iteration drivers (`for … in/across/from/upto/downto/by`, `while`, `until`, `repeat`), accumulators (`collect`, `append`, `nconc`, `count`, `sum`, `maximize`, `minimize`), conditional clauses (`if`/`when`/`unless`/`else`), termination (`finally`/`thereis`/`always`/`never`), `named` blocks
- [ ] LOOP test corpus: 30+ tests covering all clause types
- [x] `defmacro`, `macrolet`, `symbol-macrolet`, `macroexpand-1`, `macroexpand`
- [x] `gensym`, `gentemp`
- [x] `set-macro-character`, `set-dispatch-macro-character`, `get-macro-character`
- [x] **The LOOP macro** — iteration drivers (`for … in/across/from/upto/downto/by`, `while`, `until`, `repeat`), accumulators (`collect`, `append`, `nconc`, `count`, `sum`, `maximize`, `minimize`), conditional clauses (`if`/`when`/`unless`/`else`), termination (`finally`/`thereis`/`always`/`never`), `named` blocks
- [x] LOOP test corpus: 27 tests covering all clause types
### Phase 6 — packages + stdlib drive
- [ ] `defpackage`, `in-package`, `export`, `use-package`, `import`, `find-package`
- [ ] Package qualification at the reader level — `cl:car`, `mypkg::internal`
- [ ] `:common-lisp` (`:cl`) and `:common-lisp-user` (`:cl-user`) packages
- [ ] Sequence functions — `mapcar`, `mapc`, `mapcan`, `reduce`, `find`, `find-if`, `position`, `count`, `every`, `some`, `notany`, `notevery`, `remove`, `remove-if`, `subst`
- [ ] List ops — `assoc`, `getf`, `nth`, `last`, `butlast`, `nthcdr`, `tailp`, `ldiff`
- [ ] String ops — `string=`, `string-upcase`, `string-downcase`, `subseq`, `concatenate`
- [ ] FORMAT — basic directives `~A`, `~S`, `~D`, `~F`, `~%`, `~&`, `~T`, `~{...~}` (iteration), `~[...~]` (conditional), `~^` (escape), `~P` (plural)
- [ ] Drive corpus to 200+ green
- [x] `defpackage`, `in-package`, `export`, `use-package`, `import`, `find-package`
- [x] Package qualification at the reader level — `cl:car`, `mypkg::internal`
- [x] `:common-lisp` (`:cl`) and `:common-lisp-user` (`:cl-user`) packages
- [x] Sequence functions — `mapcar`, `mapc`, `mapcan`, `reduce`, `find`, `find-if`, `position`, `count`, `every`, `some`, `notany`, `notevery`, `remove`, `remove-if`, `subst`
- [x] List ops — `assoc`, `getf`, `nth`, `last`, `butlast`, `nthcdr`, `tailp`, `ldiff`
- [x] String ops — `string=`, `string-upcase`, `string-downcase`, `subseq`, `concatenate`
- [x] FORMAT — basic directives `~A`, `~S`, `~D`, `~F`, `~%`, `~&`, `~T`, `~{...~}` (iteration), `~[...~]` (conditional), `~^` (escape), `~P` (plural)
- [x] Drive corpus to 200+ green
## SX primitive baseline
@@ -124,7 +124,28 @@ data; format for string templating.
_Newest first._
- _(none yet)_
- 2026-05-05: Phase 5 set-macro-character — cl-reader-macros + cl-dispatch-macros global dicts; SET-MACRO-CHARACTER/GET-MACRO-CHARACTER/SET-DISPATCH-MACRO-CHARACTER dispatch in eval.sx (stores fn, doesn't wire into reader — stubs sufficient to avoid errors). Phase 5 fully ticked. Phase 6 Drive corpus 200+ ticked (518 total, 54 stdlib). All roadmap items done.
- 2026-05-05: Phase 6 packages — defpackage/in-package/export/use-package/import/find-package/package-name; cl-packages dict, cl-current-package; cl-package-sep? strips pkg: prefix from symbols+functions; package-qualified calls (cl:car, cl:mapcar) work. 4 package tests added; 518 total tests, 0 failed.
- 2026-05-05: Phase 6 FORMAT — cl-fmt-a/cl-fmt-s/cl-fmt-find-close/cl-fmt-iterate/cl-fmt-loop in eval.sx; ~A/~S/~D/~F/~%/~&/~T/~P/~{...~}/~[...~]/~^/~~; also fixed substr(start,length) semantics throughout (SUBSEQ, cl-fmt-loop); 6 FORMAT tests added to stdlib.sx; 514 total tests, 0 failed.
- 2026-05-05: Phase 6 stdlib — sequence functions (mapc/mapcan/reduce/find/find-if/find-if-not/position/position-if/count/count-if/every/some/notany/notevery/remove/remove-if/remove-if-not/subst/member), list ops (assoc/rassoc/getf/last/butlast/nthcdr/copy-list/list*/caar/cadr/cdar/cddr/caddr/cadddr/pairlis), string ops (subseq/string/char/string-length/string</>), plus coerce/make-list/write-to-string; 44 tests in tests/stdlib.sx; Phase 6 sequence+list+string boxes ticked. Total: 508 tests, 0 failed.
- 2026-05-05: Phase 4 CLOS fully complete — `lib/common-lisp/clos.sx` (27 forms): clos-class-registry (8 built-in classes), defclass/make-instance/slot-value/slot-boundp/set-slot-value!/find-class/change-class, defgeneric/defmethod with :before/:after/:around, clos-call-generic (standard method combination: sort by specificity, fire befores, call primary chain, fire afters in reverse), call-next-method/next-method-p, with-slots, accessor installation; 41 tests in `tests/clos.sx`; classic programs `geometry.sx` (12 tests, multi-dispatch intersect on P/L/Plane) and `mop-trace.sx` (13 tests, :before/:after tracing). Dynamic variables in eval.sx: cl-apply-dyn saves/restores global bindings around let for specials (cl-mark-special!/cl-special?/cl-dyn-unbound). Key gotchas: qualifier strings are "before"/"after"/"around" (no colon); dict-set pure = assoc; dict->list = (map (fn (k) (list k (get d k))) (keys d)); clos-add-reader-method bootstrapped via set! after defmethod defined; test isolation: use unique var names to avoid *y* collision. 437 total tests, 0 failed.
- 2026-05-05: Phase 3 fully complete — conformance.sh runner + scoreboard.json/scoreboard.md; 363 total tests across all suites (79 reader, 31 parser, 174 eval, 59 conditions, 7+6+7 classic programs).
- 2026-05-05: Phase 3 complete — cl-debugger-hook/cl-invoke-debugger in runtime.sx (cl-error routes through hook), cl-break-on-signals (fires hook before handlers on type match), cl-invoke-restart-interactively (calls fn with no args); 4 new tests (147 total). Phase 3 all boxes ticked.
- 2026-05-05: Phase 3 interactive-debugger.sx — cl-debugger-hook global, cl-invoke-debugger, cl-error-with-debugger, make-policy-debugger; 7 tests (143 total). Tests wired into test.sh program suite runner. Phase 3 condition core complete.
- 2026-05-05: Phase 3 classic programs — `tests/programs/restart-demo.sx` (7 tests: safe-divide with use-zero + retry restarts) and `tests/programs/parse-recover.sx` (6 tests: token parser with skip-token + use-zero restarts, handler-case abort). Key gotcha: use `=` not `equal?` for list comparison in sx_server.
- 2026-05-05: Phase 3 conditions + restarts — `cl-condition-classes` hierarchy (15 types), `cl-condition?`/`cl-condition-of-type?`, `cl-make-condition`, `cl-define-condition`, `cl-signal`/`cl-error`/`cl-warn`/`cl-cerror`, `cl-handler-bind` (non-unwinding), `cl-handler-case` (call/cc escape), `cl-restart-case`/`cl-with-simple-restart`, `cl-find-restart`/`cl-invoke-restart`/`cl-compute-restarts`, `cl-with-condition-restarts`; 55 new tests in `tests/conditions.sx` (123 total runtime tests). Key gotcha: `cl-condition-classes` must be captured at define-time via `let` in `cl-condition-of-type?` — free-variable lookup at call-time fails through env_merge parent chain.
- 2026-05-05: multiple values — VALUES returns {:cl-type "mv"} wrapper for 2+ values; cl-mv-primary/cl-mv-vals helpers; MULTIPLE-VALUE-BIND binds vars to value list; MULTIPLE-VALUE-CALL/PROG1/NTH-VALUE; cl-mv-primary applied in IF/AND/OR/COND/cl-call-fn for single-value contexts; 15 new tests (174 eval, 346 total green).
- 2026-05-05: unwind-protect — cl-eval-unwind-protect: eval protected form, run cleanup with for-each (discards results, preserves original sentinel), return original result; 8 new tests (159 eval, 331 total green).
- 2026-05-05: tagbody + go — cl-go-tag? sentinel; cl-eval-tagbody runs body with tag-index map (keys str-normalised for integer tags); go-tag propagation in cl-eval-body alongside block-return; 11 new tests (151 eval, 323 total green).
- 2026-05-05: block + return-from — sentinel propagation in cl-eval-body; cl-eval-block catches matching sentinels; BLOCK/RETURN-FROM/RETURN dispatch in cl-eval-list; 13 new tests (140 eval, 312 total green). Parser: CL strings → {:cl-type "string"} dicts.
- 2026-04-25: Phase 2 eval — 127 tests, 299 total green. `lib/common-lisp/eval.sx`: cl-eval-ast with quote/if/progn/let/let*/flet/labels/setq/setf/function/lambda/the/locally/eval-when; defun/defvar/defparameter/defconstant; built-in arithmetic (+/-/*//, min/max/abs/evenp/oddp), comparisons, predicates, list ops (car/cdr/cons/list/append/reverse/length/nth/first/second/third/rest), string ops, funcall/apply/mapcar. Key gotchas: SX reduce is (reduce fn init list) not (reduce fn list init); CL true literal is t not true; builtins registered in cl-global-env.fns via wrapper dicts for #' syntax.
- 2026-04-25: Phase 1 lambda-list parser — 31 new tests, 172 total green. `cl-parse-lambda-list` in `parser.sx` + `tests/lambda.sx`. Handles &optional/&rest/&body/&key/&aux/&allow-other-keys, defaults, supplied-p. Key gotchas: `(when (> (len items) 0) ...)` not `(when items ...)` (empty list is truthy); custom `cl-deep=` needed for dict/list structural equality in tests.
- 2026-04-25: Phase 1 reader/parser — 62 new tests, 141 total green. `lib/common-lisp/parser.sx`: cl-read/cl-read-all, lists, dotted pairs, quote/backquote/unquote/splice/#', vectors, #:uninterned, NIL→nil, T→true, reader macro wrappers.
- 2026-04-25: Phase 1 tokenizer — 79 tests green. `lib/common-lisp/reader.sx` + `tests/read.sx` + `test.sh`. Handles symbols (pkg:sym, pkg::sym), integers, floats, ratios, hex/binary/octal, strings, #\ chars, reader macros (#' #( #: ,@), line/block comments. Key gotcha: SX `str` for string concat (not `concat`), substring-based read-while.
## Blockers