Research Communication | Open Access
Volume 2020 | Communication ID 159 |

the intelligent search engine backtracking algorithm

Hicham Gourram, El Houssine Labriji, Mostapha Rachik
Academic Editor: Youssef EL FOUTAYENI
Received
Accepted
Published
30 January 2020
14 February 2020
10 March 2020

Abstract: The regular expression is the set of text strings that describe a search pattern ¬[1][2], and also can provide special techniques for parsing and validating data. There are several works that have been done on reading text string [3][4][5] using several algorithms like backtracking search, local search, and dynamic programming ... As a result backtracking is an effective algorithm for reading a regular expression text string, and there are exceptional cases that it encounters an infinite loop or a waste of time, this is the case of catastrophic backtracking. And to avoid this type of problem we have proposed an intelligent reading method based on reverse reading of a text string.