[Solved] COSC450/550 HW 3

1. Perform the pairwise disjointness test for the following grammar rules.a. A aB | b | cBBb. B aB | bA | aBbc. C aaA | b | caB2. Show a trace of the recursive descent parser given in Section 4.4.1 for the string a + b * c3. Given the following grammar and the right sentential form, draw a parse tree and showthe phrases and simple phrases, as well as the handle for bBab.S aAb | bBAA ab | aABB aB | b4. Construct LR parsing table for the following grammar:S Aa | dAb |dca |cbA c5. Show a complete parse, including the parse stack contents, input string, and action forthe string id * ( id + id ), using the grammar and parse table in Section 4.5.3