PLEASE DONT ANSWER WITH SOMETHING THAT ISN'T A SOURCE CODE!

PLEASE DONT ANSWER WITH SOMETHING THAT ISN'T A SOURCE CODE!

Non-terminal S P(s): E S id := E; T E EOT o E T Terminal id Tid real integer ; 0 + real integer Please ONLY SOURCE 1. Please submit the source code (in any programming language) of your LL(1) parser, which should be runnable and give correct output for a given input: given an acceptable string, the LL(1) parser should output "accept"; while given an non-acceptable string, the LL(1) parser should output an error message; Please submit a report for your implementation, which should include the following information: a. The process of eliminating all left recursions; b. The First, Follow and Predict sets for all productions, and the final LL(1) Table; c. Sample execution of input string id:= id + real - integer, which should include both the detailed parsing process with a PDA and the LL(1) table (refer to LL1-example of L3.pdf), and the screenshots of the real executions