0 votes 0 votes A grammar that has no epsilon productions and also free from unit productions. The maximum number of reduce moves that can be taken during bottom-up evaluation of 25 token string by performing bottom-up parsers is _______ Compiler Design compiler-design + – balchandar reddy san asked Jan 17, 2019 balchandar reddy san 420 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply kumar.dilip commented Jan 17, 2019 reply Follow Share $24$ 0 votes 0 votes kumar.dilip commented Jan 17, 2019 reply Follow Share https://gateoverflow.in/1418/gate2013-9 0 votes 0 votes balchandar reddy san commented Jan 17, 2019 reply Follow Share but the answer is given as 49 0 votes 0 votes newdreamz a1-z0 commented Jan 17, 2019 reply Follow Share if we consider the grammar as in chomsky normal form (CNF) as it is free from epsilon and unit productions A->BC/terrminal so if we do reverse of right most derivation we will get 2*|w|-1 number of reduced moves where |w| is the length of final string so for |w|=25 number of reduced moves= 2*25-1=49. 0 votes 0 votes Please log in or register to add a comment.