Design Parsing Boundaries for Interdependent Message Types

You are building the parsing subsystem for a binary serialisation format's interface definition language (similar in spirit to Protocol Buffers). Schema files declare message types that can reference other messages as field types, even if the referenced type appears later in the same source. Your task is to describe a design that cleanly separates low‑level syntax analysis from name and type resolution, so that arbitrary forward references and recursive definitions are…