Exercises Exercises Start with the grammar G6, repeated here 1 Modify it in the following ways: a. Add subtraction and division operators (-and /) with the customary prece dence and associativity. b. Then add a left-associative operator t between + and in precedence Then add a right-associative operator- at lower precedence than any of the other operators Exencise 2 Give an EBNF grammar for each of the languages of Exercise 1. Use the EBNF extensions wherever possible to simplify the grammars. Include what- ever notes to the reader are required to make the associativity of the operators clear Exercise 3 Show that each of the following grammars is ambiguous.(To show grammar is ambiguous, you must demonstrate that it can generate two parse trees for the same string) a. The grammar G4, repeated here b. This grammar cuoman wilma | bettyemptys n fred barneympty> 8 grammar for strings of balanced parentheses. (A language of mbr of diffeent kinds of balanced parentheses is called a Dyck lan c. The following guage. This lenguages.) stype of language plays an interesting role in the theory of formal