parseman 0.59.1 → 0.59.3

package/README.md

@@ -200,10 +200,11 @@ pnpm docs:dev     # this documentation site, locally
 Benchmark and chart tasks (`pnpm bench`, `bench:svg`, `bench:parseman`, …) are described in
 the [benchmarks guide](https://matthew-dean.github.io/parseman/guide/benchmarks#reproducing-the-numbers).
 
-The frozen 0.48 runtime architecture and release specification is
-[`docs/design/parseman-0.48.md`](./docs/design/parseman-0.48.md). Detailed measurements
-and rejected experiments remain in the linked evidence registers rather than being
-treated as current design.
+How the code fits together (the pipeline, the engines, the table format, macro builds
+and how performance is measured) is in
+[`docs/design/internals.md`](https://github.com/matthew-dean/parseman/blob/main/docs/design/internals.md). Start there before reading
+`src/`. The token and lexical-body specification is
+[`docs/design/parseman-0.48.md`](https://github.com/matthew-dean/parseman/blob/main/docs/design/parseman-0.48.md).
 
 ## License
 

package/dist/analysis/commitment.d.ts

@@ -99,7 +99,7 @@ export declare function hasNodeDef(p: Combinator<unknown>, seen?: Set<Combinator
  *
  * It belongs in THIS module for the reason stated at the top of it: both lowerings
  * must reach the same answer, and a stamp they disagree about is a driver that
- * accepts a host it should refuse. It previously lived in `compiler/codegen.ts`,
+ * accepts a host it should refuse. It previously lived in the source lowering,
  * which forced `table/compile-rule-map.ts` to import the engine the table replaced.
  *
  * The descent mirrors the source lowering's own `childrenOf` exactly — including a

package/dist/analysis/diagnostics.js

@@ -7463,8 +7463,8 @@ var Encoder = class {
   /**
    * The class of the follow set of term `i` in a sequence — the sync sentinel a
    * list nested in that term resyncs to, INFERRED from structure exactly as
-   * `sequence()` (combinators/sequence.ts:58) and `emitSeqValues`
-   * (compiler/codegen.ts:1756) infer it: the union of every LATER term's first
+   * `sequence()` (combinators/sequence.ts:58) and the source
+   * lowering's `emitSeqValues` infer it: the union of every LATER term's first
    * set, not merely up to the first non-nullable one, so a mandatory middle term
    * cannot hide a later close. −1 where there is no usable sentinel, which is the
    * same set of cases `firstSetSentinel` answers `null` for.
@@ -8255,7 +8255,7 @@ var Encoder = class {
       }
       // A LABEL IS A ROW — see `OP_LABEL`. It replaces the child's expected set,
       // which is the entire combinator.
-      // A LABEL IS CREDITED ON SUCCESS, as `codegen.ts:4530` credits it: its hook
+      // A LABEL IS CREDITED ON SUCCESS, as the source lowering credited it: its hook
       // is emitted AFTER the child's statements, where a failed child has already
       // broken out of the labelled block.
       case "label":
@@ -16383,7 +16383,7 @@ function tableRules(source, metadataOrEntry = {}) {
 }
 
 // src/version.ts
-var PARSEMAN_VERSION = "0.59.1";
+var PARSEMAN_VERSION = "0.59.3";
 
 // src/table/emit.ts
 var FACTORY_ARITY_GUARD = `if(arguments.length<${EMITTED_PARAMS.length})throw new Error(${JSON.stringify(`parseman: this parser was printed by parseman ${PARSEMAN_VERSION}; upgrade the parseman runtime to at least that version`)});`;