0 votes 0 votes Compiler Design compiler-design parsing ace-test-series + – Dheeraj Pant asked Nov 16, 2018 edited Mar 3, 2019 by I_am_winner Dheeraj Pant 2.6k views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments Dheeraj Pant commented Nov 17, 2018 reply Follow Share Actually this is my reasoning , i doesn't know the exact answer so please correct me if i am wrong... 0 votes 0 votes Dheeraj Pant commented Nov 17, 2018 reply Follow Share Left factored version for { S->A | B A--> aaaac B--> aaaab} should be {S->aaaaB B->c|b } 0 votes 0 votes Shivam Kasat commented Nov 17, 2018 reply Follow Share why isn't A left factored? 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Answer is D. First (AB) ⋂ First(ef) = phi then it is left factored... Aakash_ answered Nov 21, 2018 Aakash_ comment Share Follow See all 2 Comments See all 2 2 Comments reply Dheeraj Pant commented Nov 21, 2018 reply Follow Share @Aakash_ please tell correct answer for below question also : https://gateoverflow.in/262707/compiler-design-doubt#c262791 0 votes 0 votes Ashish Lakhmani commented Jul 22, 2019 reply Follow Share @Aakash_ Why are you using this approach? Intersection of FIRST of productions can also be !=phi when there is Left Recursion. In option B.) S -> Sa / b FIRST(Sa) ⋂ FIRST(b) != phi because of the presence of Left Recursion & I think you are assuming it's because of Non-Determinism. 0 votes 0 votes Please log in or register to add a comment.