2 Commits

Author	SHA1	Message	Date
giles	46d0eb258e	ocaml: phase 5.1 baseline 8/8 — quicksort + exceptions + closures ... Added 3 baseline programs: - closures.ml — curried make_adder; verifies closure capture - quicksort.ml — recursive sort using List.filter + List.append, sums result - exception_handle.ml — exception NegArg of int + raise + try/with All 8/8 baseline programs pass through ocaml-run-program. Combined the suite exercises: let-rec, modules, refs, for-loops, pattern matching, exceptions, lambdas, list ops (map/filter/append/fold), arithmetic. run.sh streamlined to one sx_server invocation per program. End-to-end runtime ≈2 min.	2026-05-08 13:44:28 +00:00
giles	de7be332c8	ocaml: phase 5.1 baseline OCaml programs (5/5 pass) + lookahead boundary ... lib/ocaml/baseline/{factorial,list_ops,option_match,module_use,sum_squares}.ml exercised through ocaml-run-program (file-read F). lib/ocaml/baseline/ run.sh runs them and compares against expected.json — all 5 pass. To make module_use.ml (with nested let-in) parse, parser's skip-let-rhs-boundary! now uses has-matching-in? lookahead: a let at depth 0 in a let-decl rhs opens a nested block IFF a matching in exists before any decl-keyword. Without that in, the let is a new top-level decl (preserves test 274 'let x = 1 let y = 2'). This is the first piece of Phase 5.1 'vendor a slice of OCaml testsuite' — handcrafted fixtures for now, real testsuite TBD.	2026-05-08 13:33:24 +00:00