---
title: "gparse-eisner-dynamic-program — Mova code model"
description: "Mova code model of gparse/src/eisner.rs: components with their labels, obernants and the model text."
url: "https://groupants.elamur.ai/free/en/mova/gparse/src/eisner.rs.groupant/dynamic-program.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/gparse/src/eisner.rs.groupant/dynamic-program.groupant/>

# gparse-eisner-dynamic-program

The groupant beside gparse/src/eisner.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:** [`gparse/src/eisner.rs`](https://github.com/ElamurAI/mova-free/blob/main/gparse/src/eisner.rs)
- **source SHA-256:** `10e4a00f4c14c913…`
- **covers:** Span filling uses rounded f32 max-plus, stores earliest split for strict improvements, and selects one root. Exact-real maximum-tree interpretation requires exact arithmetic or candidate-order preservation. (bytes 342–2300)
- **part of:** [gparse-eisner](https://md.groupants.elamur.ai/free/en/mova/gparse/src/eisner.rs.groupant/)
- **repository folder:** [`gparse/src/eisner.rs.groupant/dynamic-program.groupant`](https://github.com/ElamurAI/mova-free/tree/main/gparse/src/eisner.rs.groupant/dynamic-program.groupant)
- **repository commit:** `48f2e6f74146`

> **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 | [approximant](#approximant) |
| **ast** | partial | `../syntax.json` |
| **cost** | symbolic source derived | [invariant](#invariant) |
| **descriptant** | present | [descriptant](#descriptant) |
| **invariant** | partial | [invariant](#invariant) |
| **tests** | partial 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) |
| `chart_base` | chart_base | partial source derived model | [chart_base](#chart-base) |
| `incomplete_join` | incomplete_join | partial source derived model | [incomplete_join](#incomplete-join) |
| `root_constraint` | root_constraint | partial source derived model | [root_constraint](#root-constraint) |
| `tie_order` | tie_order | partial source derived model | [tie_order](#tie-order) |

## Model text


### descriptant

#### Source-bound description

Span filling uses rounded f32 max-plus, stores earliest split for strict improvements, and selects one root. Exact-real maximum-tree interpretation requires exact arithmetic or candidate-order preservation.

##### Epoch 2026-10-31

Prospective model was recorded before edits. Added tests use bounded synthetic fixtures; production algorithms unchanged. Coverage is partial, not proof. No trained corpus, live teacher or throughput experiment was executed.

### approximant

#### Forward approximant

Span filling uses rounded f32 max-plus, stores earliest split for strict improvements, and selects one root. Exact-real maximum-tree interpretation requires exact arithmetic or candidate-order preservation.

Domain: valid source-specific dimensions and resources stated in invariant; no automatic production substitution. Numerical observations are finite checks, not an end-to-end relative bound. Executable Rust surrogate: unsupported gap; existing exact tests are not surrogates. Future metric-specific caps may be 1/2/5/10%, never above 10%.

### invariant

#### Invariant and cost

Square scores with finite intermediates are needed for meaningful maximizing backpointers; f32 rounding can differ from real max-plus ordering.

##### Cost

O(n³) arithmetic, O(n²) charts/backpointers.

Allocation, finite arithmetic, platform dimensions and external failures are not universally certified.

### models

## Typed model catalog

### behavior_complement

A later equal candidate cannot replace earlier maximizing split/root.

### reverse_reconstruction

A chosen split is compatible with candidate vectors whose rounded f32 comparisons select it; real-score inequality cones are valid only with order preservation. All -infinity candidates preserve fallback indices, which need not be first ascending.

### chart_base

Complete singleton spans initialized0, others -infinity.

### incomplete_join

Best C_left(s,r)+C_right(r+1,t) receives edge in either direction.

### root_constraint

Only final root choice adds sc[0][r], ensuring one root child on admitted domain.

### tie_order

For representable finite candidates, strict > and ascending r retain first maximum. If all candidates are -infinity, default a1=t can survive instead.

### tests

#### Checks and limits

Selected parent checks relevant to this fragment (not exhaustive): eisner::tests::best_tree_with_one_root; eisner::wave30::empty_singleton_and_first_root_tie; decoder_accepts_no_words

Selected commands run twice debug and twice release; exact receipts and source-to-test mapping retained in wave30 gparse external run directory. Tests do not certify allocation failure, all NaN/overflow inputs, trained-model accuracy or corpus timing. Compiled mutants cover selected boundaries; per-source coverage is recorded in the external map, not presumed.