NEED HELP WITH PART C. CREATING A LEFT ASSOCIATIVE UNAMBIGUOUS GRAMMAR FOR THE LANGUAGE

A logical grammar defines logical expressions. You are given the following CGF for Boolean Logic. The terminal symbols are = { (, ), ^, v, 0, 1} (A) A 011 a) Generate by hand the parse tree for the following expressions 1 v 1A-1 ((-1 v 0) A O) v (0A (-1)) b) Show that the grammar is ambiguous by building two parse trees for the same string. c) Create a new grammar for the same language so that it is unambiguous. The operators are listed in ascending order of precedence in the above rules. The binary operators should be left- associative