Matching Check Using Greedy/Non-Greedy Mode of Regular Expressions

In the past, we usually use stack´s FILO (First In Last Out) characteristics to match and check the document. But stack usually needs to be implemented on the server before returns the results to system, which influences the total efficiency of the system greatly. This paper is based on the client of regular expressions related knowledge and applies greedy/non-greedy mode of regular expressions, and uses a new type of pairing check way to research and implement matching check. The client greedy/non-greedy mode of regular expressions can improve the work efficiency greatly. The client program writing is simpler than that on the server and has a huge potential in the future. It´s a good supplement for artificial check or using the traditional stack form to match check.