1 votes 1 votes Consider a CFG that describes a language L(G) . G may have € productions. If a non empty string w of length n can be derived in m steps, what is the maximum number of nodes in the parse tree for w? Kaluti asked Dec 6, 2017 Kaluti 248 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Anu007 commented Dec 6, 2017 reply Follow Share lf leaf also taken as leaf then n+m 0 votes 0 votes Kaluti commented Dec 6, 2017 reply Follow Share how have u approach to n + m 0 votes 0 votes Anu007 commented Dec 6, 2017 reply Follow Share take n leaves and make internal = number of reduction(steps) . doing this you will get m+n 0 votes 0 votes Please log in or register to add a comment.