3. Using the syntax of C, write a recursive-descent subprogram named initializer that corresponds to the following rules (taken from the C99 standard); initializer: assignment-expression { initializer list ) { initializer-list , Note that { and ] are terminals, not metasymbols. Assume that recursive-descent subprograms named assignment-expression and initializer-list already exist. 4. Use the algorithm described in Section 4.4.2 of Sebesta to remove direct left recursion from the following grammar: S - as | Sa | aAb A - Aa | Ba | Ab B-b 5. Could the following grammar be parsed using an LI parser? If not, explain why not. S > Ab | bB A ra Ba B - CA | 5a