a) A Context Free Grammar defines the structure of some language. Design CFG for (Natural Language)...

Transcribed Image Text:

a) A Context Free Grammar defines the structure of some language. Design CFG for (Natural Language) interrogative and negative sentences b) Test for various sentences such as: Who are you? What is this? You should not eat this food Why didn't you report Design a DFA that describes the behavior of a vending machine which accepts Rupees and coins, and charges PKR 50.50 per soda. Once the machine receives at least PKR 50.50, it will allow the user to select a soda. Self-loops represent ignored input: the machine will not dispense a soda until at least PKR 50.50 has been deposited, and it will not accept more money once it has already received greater than or equal to PKR 50.50. Required Deliverables Complete CFG Leftmost, Rightmost trees to show that CFG is unambiguous In case of second part a complete description and analysis of the designed mealy model along with coding. a) A Context Free Grammar defines the structure of some language. Design CFG for (Natural Language) interrogative and negative sentences b) Test for various sentences such as: Who are you? What is this? You should not eat this food Why didn't you report Design a DFA that describes the behavior of a vending machine which accepts Rupees and coins, and charges PKR 50.50 per soda. Once the machine receives at least PKR 50.50, it will allow the user to select a soda. Self-loops represent ignored input: the machine will not dispense a soda until at least PKR 50.50 has been deposited, and it will not accept more money once it has already received greater than or equal to PKR 50.50. Required Deliverables Complete CFG Leftmost, Rightmost trees to show that CFG is unambiguous In case of second part a complete description and analysis of the designed mealy model along with coding.