Hugh Sasse Staff Elec Eng wrote:
> According to "Crafting a Compiler" ISBN 0-8053-3201-4 it seems that
> recursive descent implies LL(1)...

No. LL(1) just means that the recursive descent parser may only consider
the current unprocessed token. If the lexer allows perusal of two
unprocessed tokens, your recursive descent parser is LL(2).