The construction of the lexical analyzer by direct programming is analyzed and studied in this paper. The lexical analyzer is described by the regular expression, the state diagram and FA. Then an example is used to analyze and explain the structural process of the lexical analyzer. By further analyzing the performance of the lexical analyzer, we find that the lexical analyzer constructed by direct programming is faster than other types of lexical analyzer.