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

Discussion

A grammar is LL(1) if

  • A.one token of lookahead suffices to choose the correct production
  • B.it has at most one production for each of its nonterminals
  • C.it can be parsed by some bottom-up parser without conflicts
  • D.every one of its productions has exactly one symbol on the right

Answer: A

Correct answer: one token of lookahead suffices to choose the correct production

The two Ls mean scanning left to right and producing a leftmost derivation, and the 1 is the tokens of lookahead. The condition is that for each nonterminal the FIRST sets of its alternatives are disjoint, and where an alternative can be empty, that its FIRST set is disjoint from the nonterminal’s FOLLOW set.

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

Post your comment

Please log in or register to post a comment.