0 votes 0 votes How to solve this problem ?? Is the given solution correct? Compiler Design made-easy-test-series compiler-design lr-parser parsing + – Kalpataru Bose asked Dec 20, 2017 edited Mar 7, 2019 by Aditi Singh Kalpataru Bose 627 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Ashwin Kulkarni commented Dec 20, 2017 reply Follow Share Yes this is correct. And solution is same as they have given. 0 votes 0 votes Kalpataru Bose commented Dec 20, 2017 reply Follow Share Can you explain how the look ahead are calculated ? 0 votes 0 votes mohitbawankar commented Dec 21, 2017 reply Follow Share only $ in first T production 0 votes 0 votes Kalpataru Bose commented Dec 21, 2017 reply Follow Share So the answer should be there is only one look ahead. Right? And that is $ 0 votes 0 votes mohitbawankar commented Dec 21, 2017 reply Follow Share how you get 4 look ahead on first T and look ahead of E is $ only 0 votes 0 votes mohitbawankar commented Dec 21, 2017 reply Follow Share i got $ i don't know how they find lookahead 0 votes 0 votes Kalpataru Bose commented Dec 21, 2017 reply Follow Share The answer I got is 1 only considering the look ahead to be $ . but in the solution of the test series they have given that there are 4 look aheads So which one is correct? 0 votes 0 votes mohitbawankar commented Dec 21, 2017 reply Follow Share 1 is the right ans if given ans is right then please explain ,how? 0 votes 0 votes Ashwin Kulkarni commented Dec 21, 2017 reply Follow Share There are 4 look-aheads. 1 from E->.T ($) next one is again we are calling E->.E+T hence again E->.T, but here first of next of E = + hence we got (+) from T->.T*E next time we can get (*) from T->.T-F next time we can get (-) 0 votes 0 votes Please log in or register to add a comment.