In formal language theory, a leftist grammar is a formal grammar on which certain restrictions are made on the left and right sides of the grammar's productions. Only two types of productions are allowed, namely those of the form formula_1 (insertion rules) and formula_2 (deletion rules). Here, formula_3 and formula_4 are terminal symbols. This type of grammar was motivated by accessibility problems in the field computer security.
Computational properties.
The membership problem for leftist grammars is decidable.
References.
 ;templatestyles src="Reflist/styles.css" / ;