[vrenken]

Requested by Peter · project thread

Delivery 2b of etalii.adp spec 035 (specs/035-adp-tool-language/): tasks T164 and T165, added by the amendment of 2026-10-24 (research R9, etalii.adp #504). ATD's grammar and parser are now built on etalii-lark 0.4.0, which got the accessors this needs in vrenken/EtAlii.Lark#13.

What

adp-atd-grammar (T164)

• The notation reader keeps its refusals of what ATD's subset does not admit.
• The modules go to etalii-lark in LALR mode with the contextual lexer and strict mode. The tables, conflicts and terminal collisions are therefore Lark's own verdict, reported in the normalized tables' names: "x", $END.
• tables::to_json prints Lark's table, read through Lark::parse_table(), as the normalized ParseTables. atd tables equals atd.tables.json byte for byte.
• Lexer is now a thin wrapper over Lark's lexer.
• The crate's own LR(0) items, lookaheads, collision DFAs and regex lexer are removed.

adp-atd-syntax (T165)

• The grammar's modules are embedded at build time, and Lark builds the parser once per process. Nothing is read at run time; the WebAssembly build is unaffected.
• etalii-lark's interactive parser is fed one token at a time with next_token, each token lexed for its state.
• T039's recovery runs through the interactive parser, as before:
  • a missing } at the end of the file is fed in;
  • otherwise the text is skipped to the next construct start a state on the stack reads, and the stack is popped there with truncate.
• Popped and skipped text stays in the file as skipped tokens. The text between tokens is lexed as trivia, so the tree stays lossless.
• The tree is lowered from Lark's tree (keep_all_tokens, no placeholders).
• The crate's own table-driven parser and static tables are removed.

Startup. Lark's strict-mode checks take nine tenths of building the parser, so the run-time parser leaves them out. Its tables are the same, and strictness is checked where the tables are: the T032/T034 tests, atd tables, and etalii.adp's grammar job. The first parse then costs about 0.3 s instead of 2 s. etalii-lark and the regex crates it builds with are optimised in debug builds as well; unoptimised, building the grammar took 17 s.

Unchanged tests as the guard

• T032 (the notation, conflicts, collisions, lexer) and T034 (the tables against Lark's).
• T035 and T037: lossless examples, schema-valid trees, refused files' error positions, a broken file.
• The shell's .atd tests: the editor walk, drawing, and accessibility.
• atd check --corpus refused: all 22 refused files give exactly their findings, ATD1001's message included.

The workspace's fmt, clippy -D warnings and tests pass. So do the WebAssembly build of adp-atd-lsp, atd record --check, sync-etalii-adp.py --check, and cargo-deny's licence check of atd and the language server.

🤖 Generated with Claude Code