For Exercises 1 through 5, construct an equivalent essentially noncontracting grammar GL with a nonrecursive start symbol. Give a regular expression for the language of each grammar. 1. G:S–aS bSIB B — bb I C X C– cC ‘k 2. G:S-ABCIX A – aA a B — bB A C– cC IX
