S $$ T#T

T $$ ABA

T $$ C

A $$ aA

A $$

B $$ bB

B $$

C $$ cC

C $$ c

a$)$ b$)$ c$)$ Show the leftmost derivation of the string ab#cc produced by G$.$

G is ambiguous. Prove this claim by showing a string that has at least two parse trees. Show at

least two of the trees.

Convert G to Chomsky normal form. You must use the procedure described in the book $($and

show your work$).$ It is not sufficient simply to write down the final result.