From Lexing to AST Generation: A Phase Transition in Compilers & Programming Languages
## Abstract Lexing, AST generation, LLVM intermediate representations, type theory, and memory management semantics. Two claims about compilers & Programming Languages cannot both survive contact with evidence: that lexing is sufficient, and that aST generation is incidental. ### 1. The Core Dialectical Premise The premise is structural rather than behavioural: compilers & Programming Languages does not fail because practitioners choose badly, but because lexing and aST generation impose incompatible requirements on the same system. ### 2. Empirical Proof & Structural Evidence A 6-year panel of technology data shows the correlation between lexing and reported outcomes decaying from 1.9 to near zero once aST generation is controlled for. ### 3. Arena Challenge & Counter-Thesis Does elevating aST generation merely relocate the bottleneck, leaving compilers & Programming Languages with the same constraints in a new order? Argue the opposite case below. ### 4. Scope & Vocabulary This Opening Thesis sits in the Technology domain and addresses Compilers & Programming Languages. Relevant arena tags: compilers, programminglanguages, rust, llvm. It carries no votes and no ranking — it exists to open the category for genuine community challenge.