- According to the regular expressions of different Token types, design the NFA firstly.
- transform NFA to DFA.
- use double switch-case to implement state transformation in DFA.
- design abstract syntax tree
- use recursive descent to implement the context-free grammars.
- generate syntax tree to text files.
- IDEA
- Java1.8
- put MIDL code files into
inputFile folder
- run CompilerTest.java in
src folder