420 views
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 _______

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
newdreamz a1-z0 asked Dec 8, 2018
338 views
in 2nd row of option B There is no non-terminal named ‘X ‘ either in L.H.S or R.H.S. .how can this answer be true?
0 votes
0 votes
1 answer
4
minal asked Jan 22, 2019
893 views
# of temporary variable required to create 3 address code in static single assignment form for the expression P+Q*R-S/(Q*R).