Compiler1414

The user enter a code in Mini C language (described below). The analyser tokenizes the code into tokens according to white spaces and symbols. Each token is assigned to a valid type and line number. The description of types are below. You have to write a regular expression for each type. For assigning a type for a token you can use the following algorithm:  Develop a function called RegularExp_to_DFA. Use this function to convert each regular expression into DFA.  For each token, parse the token into all defined DFAs using the priority order of the REs (more constrains REs first, for example the RE for identifier type has less constrains; then it has less priority). If the DFA accepts the token, assign its type. If not try another DFA.  If you could not find appropriate DFA can accept the token then report an error message with the token and line number. Your program should have one interface with 2 options: 1. Convert RE into DFA directly. We can enter any RE here and the system convert it into DFA (there is 3 marks extra graphical interface) 2. Lexical parser The parser can reads any code file and returns a list of (line number, token, type) in a file with all errors exist. Note: This phase concerns on the tokens regardless the syntax structure of the statements. For example: the tokens in a statement (x int =5;) are accepted; but one token is not accepted in (3int x=5;) as 3int is not accepted in all DFA we have. Thus you should report a lexical error with line number.