Don't copy from Chegg or any other website, Already given Answer is not Correct. Please attempt it yourself if you know the correct answer. Otherwise don't try to attempt.

please solve the above question according to the requirements given above and with correct method. I will give you thumbs up vote for this. Please solve as soon as possible.

Using the following parsing table list the moves made by a non-recursive predictive parser to parse the sentence int int. \begin{tabular}{|c|c|c|c|c|c|c|} \hline & int & & + & ( & ) & $ \\ \hlineE & ETX & & & ETX & & \\ \hlineX & & & X+E & X & & X \\ \hlineT & TintY & & & T(E) & & \\ \hlineY & & YT & Y & & Y & Y \\ \hline \end{tabular}