Parse a protobuf-like schema and answer queries

Problem Description

You are tasked with building a schema resolver for a custom configuration language. The schema is defined as a list of strings where each string is either a base type declaration or a nested type definition.

Input format:

• message Name { ... }: Defines a message type containing fields.
• field_type field_name: Defines a field within a message.
• Nested messages are allowed.

Your task is to implement a class SchemaParser that processes a list of schema lines and a method resolve_type(query) that returns the full path (e.g., "MsgA.SubMsg.Field") of a given field or returns "NOT_FOUND".

Signature

class SchemaParser:
    def __init__(self, schema_lines: List[str]):
        # Initialize and build symbol table
        pass

    def resolve_type(self, query: str) -> str:
        # Resolve query string to full path or return "NOT_FOUND"
        pass

Rules

1. A field inside MessageA can be accessed as MessageA.field_name.
2. A field inside a nested message MessageB within MessageA is accessed as MessageA.MessageB.field_name.
3. Assume no two messages share the same name within the same scope.

Example

Input lines:

message Outer {
  message Inner {
    int32 value
  }
  string name
}

Queries:

• resolve_type("Outer.name") -> "Outer.name"
• resolve_type("Outer.Inner.value") -> "Outer.Inner.value"

Constraints

• The input is a list of lines representing a valid schema structure.
• query will be a dot-separated string.
• Depth of nesting is at most 10.