I have the following sample question for a compilers exam and wanted to check my solution.Convert the following grammar into an LL(1) grammar which recognises the same language:E -> E + T  E -> T  T -> id T -> id() T -> id(L) L -> E;L L -> EFor my answer I haveE  -> T E'  E' -> + T |   T  -> id T  -> id() T  -> id(L) L  -> E L' L' -> ;E | Can anybody verify the answer?EditOk so would it be similar to...E  -> T E'  E' -> + E |   T  -> id T  -> id() T  -> id(L) L  -> E L' L' -> ;E | 
Convert grammar into an LL(1) grammar which recognises the same language
compiler;grammar;ambiguity