Efficient Extended Automaton Matching Perl-Compatible Regular Expressions

The limitation of existing method is analysed,Bitmap shift Finite Automaton(Bs-FA) is proposed by introducing condition function and bitmap structure,and the general method is provided to create Bs-FA from regular expression.In the condition of class of characters which overlaps with prefix,additional less space can reduce the memory storage remarkably.Bs-FA is evaluated on current rule sets and it has an important application value by comparing with recent methods.