1. (15 points) Write a lexical analyzer that includes operations for parenthesis, exponents, multiplication,
division, addition, subtraction, assignment and the inequalities,
2. (5 points) Create a state machine for the previous problem.
3. (5 points) Write a BNF, EBNF or Context Free Grammer for evaluating expressions for the possible
equations and inequalities for the language designed in the previous question.
4. (10 points) Write a program that shows the RDA for the rules show in in the previous BNF, EBNF or
Grammer. If the structure of the rules dont allow for it rewrite them so it can.
5. (5 points) Describe the order of operations and the associativity of the expressions and inequalities
described in the previous problem.