info@avatto.com
+91-9920808017
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?
5
4
3
2
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login