For those rules that pass the test in Problem 1, write a recursive-descent parsing subprogram that parses the language generated by the rules. Assume you have a lexical analyzer named lex and an error-handling subprogram named error, which is called whenever a syntax error is detected.

Data from Problem 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