{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"ai_models":["Codex"],"discussed":0,"published":"2026-11-12","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}