The Various optimization techniques are deployed in the compilation process of a source program for improving the program?s execution speed and reducing the size of the source code[2].

Of the optimization pattern matching techniques, the string pattern matching technique involves finding an optimal pattern that corresponds to the intermediate code. However, it is deemed inefficient due to excessive time required for optimized pattern search. The tree matching pattern technique can result in many redundant comparisons for pattern determination, and there is also the disadvantage of high cost involved in constructing a code tree[8][15].

The objective of this paper is to propose a tabledriven code optimizer using the DFA(Deterministic Finite Automata)[6][11] optimization table to overcome the shortcomings of existing optimization techniques. Unlike other techniques, this is an efficient method of implementing an optimizer that is constructed with the deterministic automata, which determines the final pattern, reducing the pattern selection cost and expediting the pattern search process.