Regularization of context free grammars on the base of equivalent transformations of syntax graph-schemes.
The regularization of grammar is a method of preliminary design phase of preparing source grammar by equivalent transformations of the rules of the CF- grammar into a new grammar in a regular form (CFR-grammar), and such that all non-self-embedded nonterminals are excluded by substitutions. The transformation process is carried out on the syntactical graph diagram, which is a graphical analog of CFR-grammar. A new algorithm for the regularization of the translational context-free grammars by means of equivalent transformations of their syntactic-classical graph-schemes that can approximate the input language by regular sets of words. Shown its applicability to the real language fragments, providing a high percentage increase efficiency (15-20%) compared with the known methods in Flex / Bison and Antlr. Algorithm for the regularization of grammar can be used to create miniature language processors for embedded software. Using the system for equivalent transformations in conjunction with the chosen technology the level of automation of compiler developing is obtained from 50% to 100% depending on the specifics of the project. Reduced labor costs is about 3-4 times.