A grammar G is LL(1) if and only if
the following conditions hold for
two
distinct productions A →α| β
I. First (α) ∩First (β) ≠{a} where a
is some terminal symbol of the grammar.
II. First (α) ∩First (β) ≠λ
III. First (α) ∩Follow (A) = φ if λ∈First (β)
(A) I and II
(B) I and III
(C) II and III
(D) I, II and III
Answer D.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.