Skip to main content
NM-RFC-0013

Unified lexical and token frontend

Design document · English reading edition

RFCs record designs and changes. A proposal appearing here does not mean its feature is ready to use. Explore current language support

Status recorded in the original: Proposed

Bound original source · SHA-256
111442d48abcb140c2d83ce20191d28ae3227dd8f09d274f8992313579c2ec19

Reading edition reviewed: 2026-10-02

Purpose and scope

Aims to give the formatter and parser one lexical source. Replacing line/regex structural reading with a token frontend is an internal architecture change, distinct from introducing new language syntax.

Core design rules

  • Lossless CST tokens retain text, trivia, comments and UTF-16 locations.
  • A bounded structural reader identifies blocks from token ranges; semantic lowering produces the existing NMParseResult contract.
  • Shadow execution, independent semantic parity, controlled switching and legacy removal are separate stages.

Example from the original

This example illustrates the design recorded in the original. It is not by itself a claim of executable or stable support; check required options and the current version.

The original does not provide a short source example for this topic. Read its detailed data contracts, evaluation rules and review gates in the original-document view.

Limits and interpretation

  • Partial shadow coverage cannot be presented as parity over the complete mandatory corpus.
  • Production switching requires performance, OS/Node matrix, review and rollback evidence; silent legacy fallback is not accepted.

Status and implementation boundary

The original records proposed status and staged internal evidence. Local results in its revision history do not establish a changed production default; inspect current frontend selection separately.

Table 1
Review topicInformation to check
Source revisionSHA-256 digest bound to this reading edition
AvailabilityCurrent capability record and tool options
Evidence boundaryModel, size and interpretation limits above