Reserved_3. Write a set of BNF grammar rules that will parse a programming language that can have variable type declarations such where the variable has name and a type which can be either integer or boolean, and optionally has a constant default value:E.g.var i : integer;var j : integer = 6;var b : boolean;var b2 : boolean = true;var b3 : boolean = false;2.Show an example of why the following grammar is Ambiguous. ÿ ÿ ÿ ÿ ÿ -> ÿ ÿ ÿ ÿ ÿ ÿ ÿ -> ; | ÿ ÿ ÿ -> = ÿ ÿ ÿ ÿ ÿ ÿ ÿ ÿ ÿ -> a | b | c | d ÿ ÿ ÿ ÿ ÿ ÿ ÿ ÿ -> + | ÿ ÿ ÿ ÿ ÿ ÿ ÿ ÿ -> | const



15% off for this assignment.

Our Prices Start at $11.99. As Our First Client, Use Coupon Code GET15 to claim 15% Discount This Month!!

Why US?

100% Confidentiality

Information about customers is confidential and never disclosed to third parties.

Timely Delivery

No missed deadlines – 97% of assignments are completed in time.

Original Writing

We complete all papers from scratch. You can get a plagiarism report.

Money Back

If you are convinced that our writer has not followed your requirements, feel free to ask for a refund.