In formal language theory, a grammar is in Kuroda normal form if all production rules are of the form: where A, B, C and D are nonterminal symbols and a is a terminal symbol. Some sources omit the A → B pattern. It is named after Sige-Yuki Kuroda, who originally called it a linear bounded grammar—a terminology that was also used by a few other...