FA-4057 / Parsing / Member archive
A subtraction chain builds a right-associated tree · case 02
A subtraction chain builds a right-associated tree.
Case contract
Parse a valid alternating operand/minus token list with left associativity.
Why this case matters
A local executable model for consumers of structured text; oracle values are authored literals, not outputs copied from the repaired implementation.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| boundary 1 | ["-", "a", ["-", "b", "c"]] | ["-", ["-", "a", "b"], "c"] | Failed |
MEMBER ARCHIVE
The complete case is available to members.
This record includes three runnable implementations, regression fixtures, execution results, and source hashes.
Member access is invitation-based. Sign in with your invited account to inspect the sources.
Sign in to the archive ↗