0 votes 0 votes What about empty rules? Adiaspirant asked Jan 10, 2017 Adiaspirant 230 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Surajit commented Jan 10, 2017 reply Follow Share for that we need to find follow sets also and then check conflicts. But here they have not considered that. For LL(1) No ambiguity o No left recursion o A grammar G is LL(1) iff whenever A –> u | v are two distinct productions of G, the following conditions hold: o for no terminal a do both u and v derive strings beginning with a (i.e., first sets are disjoint) o at most one of u and v can derive the empty string o if v =>* ε then u does not derive any string beginning with a terminal in Follow(A) (i.e., first and follow must be disjoint if nullable) 0 votes 0 votes Adiaspirant commented Jan 10, 2017 reply Follow Share tnx...I got your point regarding empty rules but they haven't mentioned anything about empty rules so how we can assume empty rules won't make conflicts as follow(X) may conflict with any rule. 0 votes 0 votes Please log in or register to add a comment.