Validate the screenplay refinement tree against its script's flat beats, the structural gate a script with a tree must pass before commit.
Checks, all error severity:
Node ids are non-empty and unique.
Exactly one root (parent: null) exists and it is the intent: the tree refines one film-level thought; a rootless forest or a second root is two films in one script.
Every parent resolves, the refinement axis is acyclic, and each child's kind may refine its parent's kind (ALLOWED_PARENTS); a beat is always a leaf.
temporal and every interactsWith entry resolve to an existing node and never to the node itself.
Beat-kind nodes join the flat beats 1:1: every beat node names a real beat id, no two nodes claim one beat, and every beat is claimed: a tree that forgets a beat silently drops authored structure.
Dialogue anchors are finite and >= 0 when non-null.
Intent logline and theme are nonblank and exactly match the flat script header, so screenplay rendering cannot silently replace authored metadata.
Group rationales are nonblank prose, rather than empty bracketed headings.
The cross-edge semantics (feedback propagation up the refinement chain) are consumed later; this validator only guarantees the graph is well-formed.
Validate the screenplay refinement tree against its script's flat beats, the structural gate a script with a
treemust pass before commit.Checks, all
errorseverity:parent: null) exists and it is theintent: the tree refines one film-level thought; a rootless forest or a second root is two films in one script.parentresolves, the refinement axis is acyclic, and each child's kind may refine its parent's kind (ALLOWED_PARENTS); a beat is always a leaf.temporaland everyinteractsWithentry resolve to an existing node and never to the node itself.beats1:1: every beat node names a real beat id, no two nodes claim one beat, and every beat is claimed: a tree that forgets a beat silently drops authored structure.>= 0when non-null.The cross-edge semantics (feedback propagation up the refinement chain) are consumed later; this validator only guarantees the graph is well-formed.