0 votes 0 votes Design LALR parsing table for following grammar: S → aAd | bB A → Aa | ∈ B → Bb | ∈ LavTheRawkstar asked Jun 27, 2016 LavTheRawkstar 839 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments LavTheRawkstar commented Jun 27, 2016 reply Follow Share respected sir i liked your comment very much . ok sir i will study for 15 days whole ullman book and i will watch those standford university videos but then also i know i will not solve this because you have been taught the tricks by your teachers and coaching teachers. but still i will try my best sir :) thank you so much sir :) 0 votes 0 votes LeenSharma commented Jun 27, 2016 i edited by LeenSharma Jun 27, 2016 reply Follow Share First you read this all Topic related to this. i am sure you will be able to give answer of this Question. This very basic Question for every one who read this topic first time. and most of the student preparing for gate by self studies. So stop giving the logics that your teacher taught you the tricks . 2 votes 2 votes Arjun commented Jun 27, 2016 reply Follow Share yes, examples of this are given in Ullman and reading it and solving took most people 2-3 days at first. And that is how we learn- not by listening to tricks from coaching. 1 votes 1 votes Please log in or register to add a comment.