bottom-up parser

1. Design a DFA that could recongnize any integer constants, then translate the design into a working program written in a high level language (C, ++, Java, or others). Input a few examples of your own and demonstrate your program works. 2. Design a DFA that could recognize variable names consists of only letters and integers, then translate that design into a working program. Input a few examples of your own and demonstrate that it works. 3. Using the bottom up parser (see the attached file) for the simple expression grammar, implement the bottom-up parsing algorithm in a progam. Input a few sentences to your program, and show that your parser does work. 4. Using the code generation routines from the hand-outs, show that your parser in 3 generates the right codes corresponds to the input expressions . 5. Finally, combine all 1,2,3,4 together into a single program and input expressions with different variable names, and show that the corresponding code generation works. 6. Include more grammatical rules into your exprssion grammar, such as the for-loop, the while loop, the nested loops, and others. Input the sample program as shown in the hand-outs, and show that your simple compiler program will generate the sample output as shown in the hand-outs. ## Deliverables 1) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No 3rd party components unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the worker's Worker Legal Agreement). ## Platform N/A