Transform the following left recursive EBNF grammar into an equivalent non-left recursive grammer (S and A are nonterminal symbols; S is the start symbol; a and b are terminal symbols):
S--> aSb|baS
A-->AaA|bAA|AAa|bA
Transform the following left recursive EBNF grammar into an equivalent non-left recursive grammer (S and A are nonterminal symbols; S is the start symbol; a and b are terminal symbols): S--> aSb|baS