Nonstabilization of the Predictive Boolean Lookahead Hierarchy
Source: hexagonmath.org/abs/2611.00311v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00311
curl -X POST /api/v1/records/hexagon/2611.00311/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00311/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'