Thanks in advance!

Prove the following grammar is Then, change the grammar to ambiguity. remove its term> term>+ kid> id> a blc Describe the following grammar expr> term2> a) Write a semantic mapping for switch in c++ Compute the weakest precondition for b b+3*a-4 1 b>2 s Prove the following program is correct While countn do end (sum-1+2+..+n I Problem sets for chapter 4 1 Perform the pairwise disjointness test for the following grammar rules C aCbl bAA A b(aB)l a B aBl a 2 Given the following grammar and the right sentential form, draw a pares tree and show the phrase, simple phrase, and handle C aAbl bBA A aABI ab right sentential form: bBalb 3 Show a complete parse tree, including the parse stack, input string and action for the string (id'id) tid using the grammar and parse table in section 4.5.3