4 votes 4 votes Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production. The number of entries have multiple productions in LL(1) table are ________. Compiler Design compiler-design parsing made-easy-test-series + – Mizuki asked Aug 19, 2018 • edited Mar 4, 2019 by Aditi Singh Mizuki 2.6k views answer comment Share Follow See all 24 Comments See all 24 24 Comments reply Show 21 previous comments Shaik Masthan commented Dec 16, 2018 reply Follow Share a small correction needed ! let take A -> α | ϵ if A -> α also lead to empty string, then you have to keep both A -> α and A -> ϵ productions in Follow(A). in simple terms, First separate the productions like A --> α | β ===========> A -> α and A --> β then take each production, apply first of RHS but not LHS. keep A -> α in First(α) , if First(α) contains ϵ, then keep A -> α in Follow(A) 4 votes 4 votes Gate Fever commented Dec 16, 2018 reply Follow Share thanku very much sir!! i got it yess, first of RHS not LHS, edited my comment! 0 votes 0 votes choudhury031 commented Jul 9, 2019 reply Follow Share @Shaik Masthan sir, Here B -> S first(s) = { a, b, € } So for each terminal t (excluding €) we will put B -> S IE: M[B, a] = B -> S And M[B, b] = B -> S Now as first(s) contains €, so will put B -> S for each terminal t in follow(B). Follow(B) = { a, b, $ } So M[B, $] also contains B -> S Is it correct?? 0 votes 0 votes Please log in or register to add a comment.