1 votes 1 votes Compiler Design compiler-design parsing lr-parser ace-test-series + – Kuldeep Pal asked Nov 5, 2017 • retagged Jun 22, 2022 by Lakshman Bhaiya Kuldeep Pal 433 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Rishabh Gupta 2 commented Nov 5, 2017 reply Follow Share B ... 0 votes 0 votes Kuldeep Pal commented Nov 5, 2017 reply Follow Share c... 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes First state of LR(1) DFA is : S -> .S | $\$$ S- > .Aa | $\$$ A- > .Ab | a,b A-> .c |a,b Hence C is answer Anu007 answered Nov 5, 2017 • selected Nov 5, 2017 by Kuldeep Pal Anu007 comment Share Follow See all 2 Comments See all 2 2 Comments reply Kuldeep Pal commented Nov 5, 2017 reply Follow Share How a,b came ? 0 votes 0 votes Anu007 commented Nov 5, 2017 reply Follow Share S -> .S | $\$$ S- > .Aa | $\$$ A- > .Ab | a for this A again we have to do A-> Ab A-> .c |a A- > .Ab | b A- > .c | b 2 votes 2 votes Please log in or register to add a comment.