|
|
aaabe370d6
|
apl: bracket indexing A[I] → (I⌷A) (+7 tests, 415/415)
Test, Build, and Deploy / test-build-deploy (push) Failing after 1m29s
Parser: maybe-bracket helper wraps any value followed by [expr]
into (:dyad (:fn-glyph ⌷) idx val). Wired into :name and :lparen
branches of collect-segments-loop.
apl-run "(10 20 30)[2]" → 20
apl-run "A ← 100 200 300 ⋄ A[2]" → 200
apl-run "(⍳5)[3] × 7" → 21
Multi-axis A[I;J] deferred — needs semicolon-split parsing.
|
2026-05-07 14:07:05 +00:00 |
|
|
|
637ba4102f
|
apl: ⎕ quad-names end-to-end (+8 tests, 408/408)
Test, Build, and Deploy / test-build-deploy (push) Failing after 1m4s
Parser: apl-quad-fn-names list; is-fn-tok? + :name clause
in collect-segments-loop now route ⎕FMT through fn pipeline.
Eval-ast: :name branch dispatches ⎕IO/⎕ML/⎕FR/⎕TS to apl-quad-*
niladics; apl-monadic-fn handles ⎕FMT.
⎕← (print) deferred — tokenizer splits ⎕← into name + :assign.
|
2026-05-07 13:49:35 +00:00 |
|
|
|
da8ba104a6
|
apl: right-to-left parser + 44 tests (Phase 1, step 2)
Test, Build, and Deploy / test-build-deploy (push) Failing after 17s
Implement lib/apl/parser.sx — APL expression parser:
- Segment-based algorithm: scan L→R collecting {fn,val} segments
- build-tree constructs AST with leftmost-fn = root (right-to-left semantics)
- Handles: monadic/dyadic fns, strands (:vec), assignment (:assign)
- Operators: derived-fn (:derived-fn op fn), inner product (:derived-fn2)
- Outer product ∘.f (:outer), dfns {:dfn stmt...}, guards (:guard cond expr)
- split-statements is bracket-aware (depth tracking prevents splitting inside {})
44 new parser tests + 46 existing tokenizer = 90/90 green.
Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
|
2026-04-26 14:05:43 +00:00 |
|
