Akimasa Morihata

Translation of Regular Expression with Lookahead into Finite State Automaton

Most of the conventional implementations of regular expressions are based on backtracking. Such implementations are slow in the worst case, and thus, we would like to develop a better matching algorithm. However, it is nontrivial to provide an efficient matching algorithm that can deal with practical extensions includi...