Uniquely Inversible Grammar

From Wikipedia, the free encyclopedia

The introduction to this article provides insufficient context for those unfamiliar with the subject matter.
Please help improve the introduction to meet Wikipedia's layout standards. You can discuss the issue on the talk page.

A uniquely inversible grammar is a formal grammar where no two distinct productions give the same result. This implies the specific production can be inferred from its results.

[edit] Formal definition

A \to \alpha \and B \to \beta \iff (A <> B \Rightarrow \alpha <> \beta)

[edit] Examples

Uniquely inversibles

A \to aA | bB

B \to b | a

Not uniquely inversibles

A \to aA | bB

B \to bB | a

Retrieved from "http://en.wikipedia.org../../../u/n/i/Uniquely_Inversible_Grammar_d4b4.html"