Machine-translated by Google. Questions are authored in English.
Top

Discussion

The number of lookahead tokens used by an LL(k) parser is

  • A.k, which may be greater than one
  • B.always exactly one regardless of the value of k
  • C.the number of nonterminals in the grammar
  • D.the length of the longest production right side

Answer: A

Larger k accepts more grammars, but the table grows roughly exponentially in k. Most practical tools use one token, sometimes with special handling for a few awkward constructs. The special cases are usually documented alongside the grammar itself.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.