---
title: "treeagree-dispute-answer-parser — Mova code model"
description: "Mova code model of tools/treeagree/src/dispute.rs: components with their labels, obernants and the model text."
url: "https://groupants.elamur.ai/free/en/mova/tools/treeagree/src/dispute.rs.groupant/answer-parser.groupant/"
---
Elamur: [Mova](https://md.mova.elamur.ai/free/en/) · [Dictionary](https://md.dictionary.elamur.ai/free/en/) · [Research](https://md.research.elamur.ai/free/en/) · **Groupants**

This page as HTML: <https://groupants.elamur.ai/free/en/mova/tools/treeagree/src/dispute.rs.groupant/answer-parser.groupant/>

# treeagree-dispute-answer-parser

The groupant beside tools/treeagree/src/dispute.rs in the Mova repository: what the code computes, what it never does, how to go back from its outputs, its invariants, cost and checks.

## Facts

- **kind:** groupant_fragment
- **status:** partial source bound model
- **source:** [`tools/treeagree/src/dispute.rs`](https://github.com/ElamurAI/mova-free/blob/main/tools/treeagree/src/dispute.rs)
- **source SHA-256:** `1c2bb1e172fd4dfc…`
- **covers:** answer-parser (bytes 3775–4315)
- **part of:** [treeagree-dispute](https://md.groupants.elamur.ai/free/en/mova/tools/treeagree/src/dispute.rs.groupant/)
- **repository folder:** [`tools/treeagree/src/dispute.rs.groupant/answer-parser.groupant`](https://github.com/ElamurAI/mova-free/tree/main/tools/treeagree/src/dispute.rs.groupant/answer-parser.groupant)
- **repository commit:** `855da7bd4a7b`

> **Implementation material.** A Mova code model describes this code at one source revision: partial models, finite checks and their stated scope. It is not a reviewed general exposition, and its labels are shown as written, never raised.

## Components

| component | label | where |
|---|---|---|
| **approximant** | partial | `model.md` |
| **ast** | partial | `../syntax.json` |
| **composition** | partial | [Composition](#composition) |
| **cost** | partial | [invariant-and-cost](#invariant-and-cost) |
| **descriptant** | present | [descriptant](#descriptant) |
| **invariant** | partial | [invariant-and-cost](#invariant-and-cost) |
| **tests** | bounded checks | [tests](#tests) |

## Obernants

The typed relations around the forward model: the behaviour complement (what the code never does), the reverse reconstruction (every input compatible with an output) and specialised views.

| id | type | label | where |
|---|---|---|---|
| `behavior_complement` | behavior_complement | partial source derived model | [behavior_complement](#behavior-complement) |
| `reverse_reconstruction` | reverse_reconstruction | partial source derived model | [reverse_reconstruction](#reverse-reconstruction) |
| `field_cardinality` | field_cardinality | partial source derived model | [field_cardinality](#field-cardinality) |
| `letter_prefix` | letter_prefix | partial source derived model | [letter_prefix](#letter-prefix) |
| `coordinate_zero` | coordinate_zero | partial source derived model | [coordinate_zero](#coordinate-zero) |
| `line_projection` | line_projection | partial source derived model | [line_projection](#line-projection) |

## Model text


### descriptant

#### Descriptant

lines split to exactly three whitespace fields; sentence strips all leading S, both integer parses must succeed, letter uses alphabetic-trimmed prefix match against A B C D.

##### Epoch 2026-10-31

Prospective source reading identified conditional input alignment, information loss and failure order before tests. Existing production code is retained; added tests use actual helpers. Finite results update this source-bound model, not all parser/corpus semantics.

No executable percentage surrogate has a justified observation metric for these categorical/effectful APIs. Future profiles require metric, domain and real-reference evidence at caps 1/2/5/10%; no higher cap. Syntax is partial lexical Rust projection without macro expansion or semantic resolution.

### approximant

## Forward approximant

lines split to exactly three whitespace fields; sentence strips all leading S, both integer parses must succeed, letter uses alphabetic-trimmed prefix match against A B C D.

### Composition

This fragment is the exact byte-scoped helper identified in the manifest; its relation is restricted to the operations above.

The containing source wires this scoped relation to its callers. Treeagree proposal→gate→commit and treebanks parse→match→collect→render are actual joins; parsecmp is an independent diagnostic path. The external group model distinguishes these tags.

### catalog

## Typed models for treeagree-dispute-answer-parser

Subject: source SHA-256 `1c2bb1e172fd4dfcc5ea465d577e94607347635f93f1deb0aae3e5e648a43ff2`; manifest supplies exact source/byte scope. Domain: admitted states in forward model, nonoverflow arithmetic and successful allocations. Observation: one terminating invocation, except explicitly described file trace. Source-derived partial relations; named finite tests constrain selected cases only. Each entry holds arguments and environment fixed except its stated intervention.

### behavior_complement

Four-field lines, nonnumeric coordinates, lowercase option starts, and OK are absent from returned triples.

Operator: inner exclusion on admitted domain. Evidence: source branch derivation plus tests.md; unexercised branches remain hypotheses. Oracle: evaluate the scoped actual helper on admissible fixtures and compare this observation. No universal proof.

### reverse_reconstruction

For each output triple, many whitespace/punctuation spellings and ignored lines are compatible; original answer text cannot be recovered.

Operator: compatible antecedent relation, retaining ambiguity. Evidence: source branch derivation plus tests.md; unexercised branches remain hypotheses. Oracle: evaluate the scoped actual helper on admissible fixtures and compare this observation. No universal proof.

### field_cardinality

Two or four fields reject before number parsing, preserving line order among accepted triples.

Operator: specialized observation relation under the stated fixed inputs. Evidence: source branch derivation plus tests.md; unexercised branches remain hypotheses. Oracle: evaluate the scoped actual helper on admissible fixtures and compare this observation. No universal proof.

### letter_prefix

Bextra starts with B and is accepted; this parser is not a strict one-letter grammar.

Operator: specialized observation relation under the stated fixed inputs. Evidence: source branch derivation plus tests.md; unexercised branches remain hypotheses. Oracle: evaluate the scoped actual helper on admissible fixtures and compare this observation. No universal proof.

### coordinate_zero

Zero sentence/word are parsed; downstream group lookup rejects sentence zero through wrapping subtraction.

Operator: specialized observation relation under the stated fixed inputs. Evidence: source branch derivation plus tests.md; unexercised branches remain hypotheses. Oracle: evaluate the scoped actual helper on admissible fixtures and compare this observation. No universal proof.

### line_projection

Every accepted triple carries no raw spelling; no deduplication occurs.

Operator: specialized observation relation under the stated fixed inputs. Evidence: source branch derivation plus tests.md; unexercised branches remain hypotheses. Oracle: evaluate the scoped actual helper on admissible fixtures and compare this observation. No universal proof.

### tests

#### Scoped evidence

Parent native slice and exact names are in `../tests.md`.

Only named finite assertions cover selected inputs; other branches and invalid-domain behavior remain source-derived.

This fragment has no independent full-coverage claim. Its byte range and source hash bind the source-derived relation; parent test success is evidence only where that helper is actually reached.

### invariant-and-cost

#### Invariant and cost

O(text bytes) plus line field and output allocations; integer parser bounded by usize.

Four-field lines, nonnumeric coordinates, lowercase option starts, and OK are absent from returned triples.

The complement and specialized catalog constrain preserved coordinates and effect boundaries. Empty/malformed domains are only guaranteed where explicitly admitted. No whole-program cost bound follows from a helper bound.