Design the DFA machine for a simple calculator, where

? = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ., =, , , , , [, ] }. [ ] is used

for only one operation each time (e.g, [3.1 4.2] 5 [12 4.8]),

embedded [[...]] is not allowed.

Steps of the project:

(1)Design a regular expressionrfor real number expression. A real number can be negative orpositive (e.g., 2.5 and 0.52). A real number expression is an expression of real numbers connected by four arithmetic operations +, -, , , / and priority [] .

(2)Design a DFA for accepting the regular languageL(r). You can first design a NFA and then conve it to a DFA.

Desis er exevessiona +Ci) ledto realla opi(l@te ) tO/@i Frea