disambiguation-boundary-violation-is-universal-computational-constraint
IN derived (depth 3)
Created 2026-06-21T13:10:22+00:00 · Reviewed 2026-06-21T14:41:08+00:00
The need for semantic context to resolve disambiguation appears as a recurring pattern across processing hierarchies: both compilers (the C lexer hack requiring symbol table feedback across the lexer-parser boundary) and LLMs (prompt injection exploiting the inability to distinguish instructions from data) exhibit cases where lower-level processing cannot resolve meaning without higher-level semantic knowledge, suggesting that formal processing-level separations face inherent pressure from disambiguation demands that cross those boundaries.
Justifications
SL — Compiler lexer hacks and LLM prompt injection are instances of the same fundamental boundary violation — disambiguation demands semantic context that lower levels cannot provide
Antecedents (all must be IN):
- IN compiler-theory-illuminates-tokenizer-model-separation — The formal language hierarchy separating lexer-level processing (regular languages, finite-state machines) from parser-level processing (context-free languages, pushdown automata) has a structural analog in LLM architecture: subword tokenization (BPE/WordPiece) operates at the finite-state statistical level while attention provides the unbounded context-sensitivity that finite-state processing cannot, illuminating why tokenization remains a separate preprocessing stage rather than being absorbed into the model's core computation.
- IN disambiguation-requires-semantic-context-across-processing-paradigms — Both compiler lexers and LLM inference face the same fundamental disambiguation problem: the C lexer hack requires semantic feedback from the symbol table to distinguish typedef names from variable names, and prompt injection exploits the model's inability to distinguish developer instructions from user inputs — in both cases, a processing layer cannot disambiguate its inputs without higher-level semantic context that it structurally lacks.
Dependents
These beliefs depend on this one:
- IN disambiguation-underlies-prompt-security-architecture — The universal disambiguation constraint (requiring semantic context to cross processing boundaries) and the dual-use authority hierarchy (system prompts simultaneously enabling control and creating attack surfaces) are two manifestations of the same root limitation: LLMs cannot reliably maintain semantic boundaries between different types of input, whether instruction vs. data or system vs. user authority.
- IN formal-verification-impossibility-extends-to-disambiguation-layer — The craft discipline's formal verification impossibility (grounded in NLP's AI-complete classification) extends to the disambiguation layer where the most critical security vulnerability operates: since prompt injection exploits the universal disambiguation problem (semantic context crossing processing boundaries), the formal verification deficit is rooted at the most fundamental processing level — not merely at the surface of deployment complexity.