Research in regular languages and their associated computational problems has been revitalized by the rapid development of the Internet and its applications. The construction of finite automata from regular expressions is of central importance to a variety of practical problems, including DFA construction in Unix systems, lexical scanning, Internet searching, content-based network service, and computational biology. First, a smart parsing algorithm is developed which constructs a parse tree with at most