A Multiple String and Pattern Matching Algorithm Using Context-Free Grammar

Various Substring Pattern Matching Algorithm introduced here is executed in two stages. The main stage is preprocessing in which a n-ary tree as structure is built for the given content information and GNF (i.e., Griebach Normal Form) is made for given Context-Free Grammar. The second stage called seek stage takes as info a n-ary tree structure and Griebach Normal Form of given Context-free linguistic use is built in stage 1, and yields those strings that match both the content information and the setting free language structure. The calculation proposed here has the favorable position that it can recover any number of examples in the meantime. This finds wide applications in bioinformatics, data recovery, and prerequisites particular phase of programming life cycle advancement.