Compiler theory - Chapter III lexical analysis -3.7 expressions to simplify automatic machine -DFA most from positive

DFA most simplified

First, the structure of the simplest DFA

---

1. O

2. Step

3. Notes

4. Code

Second, the example

---

• Example 1 :
  
• Example 2 :
  

Reference - Mu class - Suzhou University