LL(2) language that is not LL(1)

Question

In order to further my understanding of parsers and grammars, I\'m searching for a (hopefully simple) example of a language that is LL(2) but not LL(1). That is, a lang

Answer 1

The example mentioned in the book linked in Gunther's answer:

S -> a S A | epsilon
A -> a^k b S | c

is a grammar describing an LL(k+1) language that is not LL(k). In particular,

S -> a S A | epsilon
A -> a b S | c

is a grammar describing an LL(2) language that is not LL(1).