1. Consider the following grammar G: S ? BAB

A ? Aa | ?

B ? bB | b A.

Write G as a four-tuple (V, ?, S, R) where V is the set of variables, ? is the set of terminals, S is the start variable and R is the set of rules.

B. Is G a regular grammar? (Why/why not?)

C. Describe the language that G generates as a regular expression.

D. Write a regular grammar equivalent to G.