0 votes 0 votes Given the grammar $E->E+E/E^*E/a$ you are required to remove the ambiguity. Theory of Computation theory-of-computation + – Sourav_35 asked May 29, 2018 • retagged May 29, 2018 by Subarna Das Sourav_35 484 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Sourav_35 commented May 29, 2018 reply Follow Share S->T*F T->T+F/F F->a Is this the correct answer? 0 votes 0 votes abhishekmehta4u commented May 29, 2018 reply Follow Share ITs not correct .in given question grammar genrate string 'a'. But in this grammar it cant genrate string a 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Equvalent unambiguous grammar is S---->S+T/T T----->T*F/F F----->a abhishekmehta4u answered May 29, 2018 abhishekmehta4u comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments abhishekmehta4u commented May 29, 2018 reply Follow Share what is wrong in this grammar . it generate string a S------>T----->F----> a 0 votes 0 votes !KARAN commented May 29, 2018 reply Follow Share You check your grammar first (1) S->T*F (2) T->T+F/F (3) F->a From (1), you can't go for S -> T , if you want to then you should define it as S -> T * F / T then it will be correct –1 votes –1 votes abhishekmehta4u commented May 30, 2018 reply Follow Share I am already written this .s--->s*t/t What are you saying ??? Where is wrong ??Can u give the your solution?? 0 votes 0 votes Please log in or register to add a comment.
