Section 5.7 and Exercises 16 and 17 examine the efficiency of LL(1) parsers.
(a) Analyze the efficiency of operating a table-driven LL(k) parser, assuming an LL(k) table has already been constructed. Your answer should be formulated in terms of the length of the parsed input.
(b) Analyze the efficiency of constructing an LL(k) parse table. Your answer should be formulated in terms of the size of the grammar-its vocabularies and productions.
(c) Analyze the efficiency of operating a recursive-descent LL(k) parser.
Exercises 16
Section 5.7 argues that table-driven LL(1) parsers operate in linear time and space. Explain why this claim does or does not hold for recursive-descent LL(1) parsers.
Exercises 16
Explain why the number of nonterminals that can pop from an LL(1) parse stack is not bounded by a grammar-specific constant.