Structures for generating admissible grammar case of longest repeat first substitution

Abstract

Here, we described primary challenges for generating context-free grammar for a given text. Creating rules using repeated or common substrings or patterns, yields compression. Such common patterns overlap with others in a various way. We, first, discussed all such different overlapping patterns and finally generated context-free grammar in polynomial time using all such non-overlapping common substrings.