#>literal_parser
real parser browser-local lossless check

Literal Spw Parser

This is the parser, running in your browser. Change the source and watch Spw become tokens, an abstract syntax tree, diagnostics, and an exact reconstruction.

This tool ships the portable parser kernel from spw-workbench. The public page does not imitate a parse or infer braces with display-only rules: the same parser package used by the CLI and language tooling produces the result below. Load practices, language-sync, film, and year-mix as public specimens — plus the beans garden (<beans>, beans.<, <beans>#) — so demand comes from work already on the site, not private theory.

@parse

Source → evidence

Parser build: spw-workbench

Try:

Literal source

editable literal

Waiting for the parser.

!load[source_into_app]

The first action creates an app-safe URL containing this exact source. The installed Spw app opens that URL at this parser; registered .spw files can open here directly on supporting systems.

Tokenslexer order + source positions
    ASTparser-owned node types + spans 
    null
    Diagnosticserrors and warnings are not hidden
      #>v04_designer_specimens

      Next-version language specimens (v0.4)

      These specimens test candidate v0.4 grammar constructs against the live browser parser kernel. Workbench designers can click any specimen to load it into the editor, check token spans, verify AST depth, and falsify proposed grammar changes.

      Claims & Probes (load)

      owner_claim and ^"synthesis" blocks declare hypotheses, specification citations, and falsification probes. Pillar: claim-probe syntax.

      File Profiles (load)

      !:profile "convention" headers declare expected file anatomy and enforce required structural blocks across the corpus. Pillar: profiles & validator.

      Dot-Crawl Joins (load)

      Crawl traverses complete braces across boundaries ({a}.{b}.{c}), distinct from comma-separated lists and arrow paths. Pillar: joins.

      Stem Projections (load)

      >stem[name]{...} projects one semantic root into copy, design tokens, runtime datasets, and inspection handles without forking truth.

      Combinatoric Genre (load)

      Tests pantry transforms and combinatoric genre expressions (boonhonk[genre]{...}) against the parser to verify lossless AST generation.

      ^proof_boundary

      What this proves

      Literal structure

      Source positions, token kinds, and AST spans remain inspectable. When the parser emits diagnostics they stay visible; permissive input remains accepted exactly as the parser reports.

      Portable kernel

      The parser has no DOM dependency. This page imports a browser bundle generated from the mounted workbench parser entrypoint.

      Lossless evidence

      The token stream is concatenated and compared with the original source. “Exact” means every emitted token reconstructs the literal input.

      Honest boundary

      This proves parsing and source geometry. It does not claim evaluation, canonical normalization, runtime effects, or semantic correctness for every possible program.