Syntax Analysis5

Consider the context free grammar
E → E + E
E → (E * E)
E → id
Where E is the starting symbol, the set of terminals is {id, (, + ,), *} and the set of non terminal is {E}.

0. For the terminal string with more than one parse tree obtained as solution to in above Question, how many parse trees are possible?

  • Option : A
  • Explanation :
    Total 5 different parse trees are there.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *