Talk:LL grammar

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Hierarchy of LL(k) language examples

In order to illustrate the hierarchy of LL(k) languages, could someone give a family of example languages (L_k)_k∈ℕ such that L_k is LL(k+1), but not LL(k)? Rosenkrantz and Stearns prove (on p.247) that { aⁿ (b^kd + b + cc)ⁿ | n≥1 } is not LL(k); however, it is not clear whether it is LL(k+1). Moreover, there may be easier language examples? - Jochen Burghardt (talk) 11:49, 25 February 2015 (UTC)[reply]