BM 匹配算法 In computer science, the Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature.[1] It was developed by Robert S. Boyer and J Strother Moore in 197
Carl B. Boyer The History of the Calculus and its Conceptual Development Dover Publications Inc. 1949 from https://archive.org/details/TheHistoryOfTheCalculusAndItsConceptualDevelopment
Parser-iruri-de-caractere:可以在字符串解析器中执行metoda Boyer-Moore。 字符串表中的字符串（matricea delta）。 Pe baza acestuia se va realiza parsarea string2 pentru a se calcula decalajul（offset-ul）
