construct an equivalent essentially noncontracting grammar GL with a nonrecursive start symbol. Give a regular expression for the language of each grammar.

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 bSIBB — bb I C XC– cC ‘k2. G:S-ABCIXA – aA aB — bB AC– cC IX

"Looking for a Similar Assignment? Order now and Get 15% Discount! Use Code "FIRST15"