1 votes 1 votes closed as a duplicate of: Gate Compiler Design I have only heard about FIRST and FOLLOW . How to Calculate LEAD and LAST and TRAILING ..? Compiler Design compiler-design parsing first-and-follow + – LavTheRawkstar asked Sep 25, 2016 closed Sep 7, 2022 by Hira Thakur LavTheRawkstar 731 views comment Share Follow See 1 comment See all 1 1 comment reply LavTheRawkstar commented Sep 27, 2016 reply Follow Share tell::( 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes E->E+T/T T->T*F/F F->(E)/id First(X) Follow(X) E (,id $,+,) T (,id $,+,),* F (,id $,+,),* Jevi answered Dec 9, 2016 Jevi comment Share Follow See 1 comment See all 1 1 comment reply rajatmyname commented Feb 12, 2017 reply Follow Share Jevi mam if we remove left recursion first and then calculate first and follow, Follow(E) should contain {$,)} only. Please clarify my doubt 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Leading E={+,*,I'd,)} T={*,id,(} F={id,(} Trailing F={id,)} T={*,id,)} E={+,*,id,)} Vishal Goyal answered Oct 12, 2016 Vishal Goyal comment Share Follow See all 0 reply Please log in or register to add a comment.