please help

2. Please design and implement an LL(1) parser for the following given grammar: P(S): Non-terminals Sid=E; EEOT ET Terminal Tid real integer 0+1 E T o id ; real integer (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; (30 marks) (2) Please submit a report for your implementation, which should include the following information: (a) The process of eliminating all left recursions; (10 marks) (b) The First, Follow and Predict sets for all productions; and the final LL(1) Table; (10 marks) (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 LLl-example of L3.pdf), and the screenshots of the real executions. (10 marks)