Using the textbook: Concepts of Programming Languages 11th Edition will assist with these problems. Please be descriptive in your steps. Thanks!

1. Perform the pairwise disjointness test for the following grammar rules. a. A aB | b | cBB b. B aB | bA | aBb c. C aaA | b | caB

3. Show a trace of the recursive descent parser given in Section 4.4.1 for the string a + b * c.

5. Given the following grammar and the right sentential form, draw a parse tree and show the phrases and simple phrases, as well as the handle. S aAb | bBA A ab | aAB B aB | b a. aaAbb b. bBab

7. Show a complete parse, including the parse stack contents, input string, and action for the string id * (id + id), using the grammar and parse table in Section 4.5.3.