pls help
Final Assignment (due on Jan.10, 2021, 18:00) 1. Please design and implement a DFA, which can recognize the regular expression 1*(00|011")"00. Requirements: (1) Please submit the source code (in any programming language) of your DFA, which should be runnable and give correct output for a given input: given an acceptable string, the DFA should output" accept"; while given a non-acceptable string, the DFA should output an error message; (20 marks) (2) Please submit a report for your implementation, which should include the following information: (a) The entire process for constructing the DFA, such as the NFA generation from the regular expression, and the conversion from the NFA to its equivalent DFA. The final DFA should also be illustrated in both the transition table and the transition diagram; (10 marks) (b) Sample executions of at least two acceptable strings and two non- acceptable strings. Please demonstrate the executions in both the state transition sequences on your DFA transition diagram (for acceptable strings only), and the screenshots of the real executions (for both acceptable and non-acceptable strings). (10 marks) 2. Please design and implement an LL(1) parser for the following given grammar: Non-terminals E T 0 Terminal id real integer P(S): Sid:EE: E EOT ET (Pleiske submit the source code (in any intgsfogramming language) of your LL(1) o prsr, 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 LL1- example of L3.pdf), and the screenshots of the real executions. (10 marks) Final Assignment (due on Jan.10, 2021, 18:00) 1. Please design and implement a DFA, which can recognize the regular expression 1*(00|011")"00. Requirements: (1) Please submit the source code (in any programming language) of your DFA, which should be runnable and give correct output for a given input: given an acceptable string, the DFA should output" accept"; while given a non-acceptable string, the DFA should output an error message; (20 marks) (2) Please submit a report for your implementation, which should include the following information: (a) The entire process for constructing the DFA, such as the NFA generation from the regular expression, and the conversion from the NFA to its equivalent DFA. The final DFA should also be illustrated in both the transition table and the transition diagram; (10 marks) (b) Sample executions of at least two acceptable strings and two non- acceptable strings. Please demonstrate the executions in both the state transition sequences on your DFA transition diagram (for acceptable strings only), and the screenshots of the real executions (for both acceptable and non-acceptable strings). (10 marks) 2. Please design and implement an LL(1) parser for the following given grammar: Non-terminals E T 0 Terminal id real integer P(S): Sid:EE: E EOT ET (Pleiske submit the source code (in any intgsfogramming language) of your LL(1) o prsr, 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 LL1- example of L3.pdf), and the screenshots of the real executions. (10 marks)
