METHOD OF CF-GRAMMAR REGULARIZATION FOR LANGUAGE PROCESSORS
St. Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences, Laboratory of Applied Informatics; Senior Researcher
Read the full article
Abstract. A method of context-free regularization based on special equivalent transformations of the grammar syntactic graph is described. In combination with an algorithm of elimination of recursions, the method is shown to ultimately convert a context-free grammar into a regular one.
Keywords:
context-free grammar, equivalent transformations of grammars
