This serializer consumes the prepared model in prepare. It chooses JavaScript grouping, lexical names, helper syntax and token marks. Source logical operators have already become single-evaluation conditional regions. The prepared serializer emits their conditional spelling; it contains no logical/nullish tag handling or source-operator recovery. EDAG reachability, shared-value ownership, lazy memo lifetimes, loop slots and simultaneous transfers have already been decided by the common passes.

render emits marked text and stringify removes those same marks. Their module, expression and factory forms share one spelling. renderModule preserves named exports. Both modes can establish literal captures through a capture factory; runtime mode also supports repeated capture values and labels general loops and transfers with their exact targets. Source mode (runtime = false) emits bare break and continue; the source coordinator must first admit their nearest-loop targets and regions. The renderer performs no transfer-admission analysis. Code-only functionStringify treats capture slots as external values with positional names, omitting the module wrapper and captured values. The public compatibility APIs live in compiler/serializer.

An empty alternative has no else clause in either output mode. The condition still appears once, and nonempty alternatives retain their braced scope. A prepared terminating branch therefore uses the existing FJS guard spelling; the renderer adds no join or completion analysis.

Binding and loop identities determine names; diagnostic indices are not keys. Source functions with several captures name them in signature order before the body, so parsing the output preserves that order even if body reads differ. Literal captures use factory parameters in capture order. A wide source factory receives one private array and establishes its slots in that same order, keeping its parameter count within the source limit. A source function retaining self is declared and returned inside the factory, where the parser recognizes its direct recursive const-arrow initializer. External function text keeps its positional capture names. Scalar loops retain the source grammar's paired let and while, including a loop whose transition keeps its parameter unchanged. Ordinary prepared memo instructions render one lexical memo cell and demand function.

A prepared terminal-loop exit uses the same loop syntax and target identities as a loop statement. It ends its containing region with the loop itself; the renderer adds no normal result, fallback return or synthetic throw.

Syntax scans, ordinary expression rendering and chain continuation rendering use explicit immutable work stacks. Final result blocks are flattened into the same lexical region, retaining their required definitions and final exit. The proofs exercise 20,000-node unary, binary, property and result-block trees, including result blocks with required definitions. This is a prepared-model depth guarantee; it does not expand the separate raw graph admission domain.