deifine production rules that are understandable. then make lmt and rmt parse trees for each part and then for each part state whether its unambiguous or not. do in detail

Design CFG for (Natural Language) interrogative and negative sentences Test for various sentences such as: - Who are you? - What is this? - You should not eat this food - Why didn't you report Required Deliverables - Complete CFG - Leftmost and rightmost trees to show that CFG is unambiguous