0 votes 0 votes Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$ If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG has to be $LL(1).$ If the CFG is $LL(1)$ then $\text{FIRST(u)} \cap \text{FIRST(v)}$ has to be empty. Both $(A)$ and $(B)$ None of the above Compiler Design nielit2017oct-assistanta-cs compiler-design context-free-grammar first-and-follow + – admin asked Apr 1, 2020 • edited Aug 29, 2020 by soujanyareddy13 admin 3.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply val_pro20 commented Nov 14, 2020 reply Follow Share what if u and v are terminals? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes FIRST(u) ∩ FIRST(v) is empty iff the CFG has to be LL(1). Hence Option C should be correct. Gyanu answered Sep 23, 2020 Gyanu comment Share Follow See all 0 reply Please log in or register to add a comment.