A finite-state or regular grammar has production rules of the following two forms: A x B C y where A, B, and C are single nonterminal symbols, and x and y represent single terminal symbols. Note that finite-state grammars may have recursive rules of the form A x A, but the recur...