In theoretical computer science and formal language theory, a regular grammar is a grammar that is right-regular or left-regular. Wikipedia