Regular grammar

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Regular grammar" – news · newspapers · books · scholar · JSTOR (December 2018) (Learn how and when to remove this message)

In theoretical computer science and formal language theory, a regular grammar is a grammar that is right-regular or left-regular. While their exact definition varies from textbook to textbook, they all require that

• all production rules have at most one non-terminal symbol;
• that symbol is either always at the end or always at the start of the rule's right-hand side.

Every regular grammar describes a regular language.