Formal Languages and Finite Automata

Answer question carefully & correctly for a thumbs up.

Some info which might help:

6. Show that the grammar below (written with BNF notation) is ambiguous. | ::= if Bool > then Bool> - true | false ::= I si l sa Parse trees can be used to give meaning to words in context free languages. Use your example to give two different meanings to a word in this grammar. The terminals (or token of the grammar are: and do else false fi if mod not od or read skip then true while write abcdefghijklm n opqrstu v wxyz ABCDEF GHIJKLMNOPQR STUVWX Y Z 012 3 456 789 The productions of the grammar are | ; | | | := Kif statement> Kread statement> :- if then else fi = while do od - skip := read ( ) :- write () ::- , := | or :: and := | ( ) | not ::= | boolean factor expression ter - * ::=1=-1 boolean atom> atom> Kidentifier> letter := | ( mo :=true | false := | |identifier> letter> | | |identifier digit> :- then else | sstunnitil stmt2 true | false Construct parses for the word