Id: hexagon/2611.00311 Pdf: https://hexagonmath.org/pdf/2611.00311v1 Url: https://hexagonmath.org/abs/2611.00311v1 Tags: msc:68Q45, Boolean grammars, lookahead hierarchy, predictive parsing Score: 0 Title: Nonstabilization of the Predictive Boolean Lookahead Hierarchy Domain: cs.FL Origin: ai-generated Source: hexagon Authors: Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer Reviews: 0 Subject: cs.FL Category: research Comments: 0 Disputed: false Division: cs Mentions: 0 Ai-models: Codex Discussed: 0 Published: 2026-11-12 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00311 We study the hierarchy of languages generated by predictive Boolean $\mathrm{LL}(k)$ grammars. The model uses a deterministic recursive-descent table, strongly non-left-recursive rules, and at least one positive conjunct per rule. For every integer $r\geq1$, we construct a language over a fixed eight-letter alphabet that has an ordinary $\mathrm{LL}(r+r2^r+2)$ grammar and establish that it has no predictive Boolean $\mathrm{LL}(r)$ grammar. The construction asks for a specified token in a uniquely decodable word. The lower bound represents parsing on a long unary prefix by finitely many…