Linear grammar is a type of formal grammar in the theory of formal languages and automata. It is a specific subclass of context-free grammars (CFGs) that has certain restrictions on the production rules. In a linear grammar, each production rule is of the form: - A → xBy - A → x - A → ε Here, A is a non-terminal symbol, x and y are strings of terminal symbols (or empty), and B is another non-terminal symbol.
New to topics? Read the docs here!