Claim FPRD-D09

Exact statement

A finite conventional context-free grammar has finite disjoint terminal and nonterminal sets, finitely many productions, and a distinguished start nonterminal; its canonical relational translation maps terminals to relational terminal actions, nonterminal occurrences to uniquely labeled calls, concatenation to sequence, alternatives to commutative union, epsilon to identity, and an absent production set to failure.

Statusdefinition

External reviewNo documented external or specialist review of this FPRD result is recorded.

Context

This row is imported exactly from the governed FPRD claims ledger. The matrix assignment records normalized inventory coverage; it is not a new proof or a promotion of the ledger status.

Proof or evidence

The ledger points to docs/specs/m13-cfg-relational-lift.md. The matrix has not yet rewritten that source into a self-contained public proof summary.

docs/specs/m13-cfg-relational-lift.md →

Verification notes

Reviewed on 2026-08-25 for identifier, status, provenance, evidence-link presence, and dependency import only. Mathematical proof audit remains the next action unless separately documented.

Limitations

Canonical labels are relative to the ordered grammar presentation. Production order does not affect the commutative-union suffix semantics, and this definition does not preserve parse trees or ambiguity counts.

Open work

Add a self-contained definition page with examples, nonexamples, and dependency boundaries.

Notes

Canonical labels are relative to the ordered grammar presentation. Production order does not affect the commutative-union suffix semantics, and this definition does not preserve parse trees or ambiguity counts.