Size/lookahead tradeoff for LL(k)-grammars

For a family of languages a precise tradeoff relationship between the size of LL(k) grammars and the length k of lookahead is demonstrated.

[1]  Daniel J. Rosenkrantz,et al.  Deterministic Left Corner Parsing (Extended Abstract) , 1970, SWAT.

[2]  Hing Leung,et al.  On the size of parsers and LR(k)-grammars , 2000, Theor. Comput. Sci..

[3]  Professor Seppo Sippu,et al.  Parsing Theory , 1988, EATCS Monographs on Theoretical Computer Science.