Regular expression was the foundation of advanced language and compiler. It can be recognized by finite automaton. In this paper, combined with operator priority analysis and the rules of regular expression, the table of priority relationship between operators involved in regular expression has be constructed. Based on the table, realized the automatic convert from regular expression to finite automaton, and the program is given. It provided a new reference of regular expression convert to finite automaton.