Need help with Programming Language. Use Question 5 to help answerthe question
Question 5: A grammar is ambiguous when two different parse treescan be generated for the same string with that grammar.
II. Short answer/problems. er all questions. Long rambling answer will be marked as incorrect. t values in parenthsis. 20) Consider the following grammar: word» : :=