Parallel Transition from Regular Expressions to Follow Automata

Constructing smaller nondeterministic finite automata of Regular Expressions is key technique in the fields of compiler science. The whole progress of parallel transition from regular expressions to Follow automata is analyzed in the paper, and a parallel transition algorithm with the middle structure of Thompson automata and Glushkov automata is proposed. The thesis describes whole design and implementation in detail, and simulates its parallel translation progress with an instance.