Consider the language L defined by these rewrite rules S->A | AX X->ABY | AB Y->ABCY | ABC BA -> AB CA -> AC CB -> BC A->a B->b C->c Question 1: (16) (a) Derive the string “a”. (b) Derive the string...

Consider the language L defined by these rewrite rules

S->A | AX

X->ABY | AB

Y->ABCY | ABC

BA -> AB

CA -> AC

CB -> BC

A->a

B->b

C->c

Question 1: (16)

(a) Derive the string “a”.

(b) Derive the string “aab“

(c ) Derive the string “aaabbc”

(d) Derive the string “aaaabbbcc”

(e) Describe the strings that are in L.