Uniquely Inversible Grammar

From Wikipedia, the free encyclopedia

 The introduction to this article provides insufficient context for those unfamiliar with the subject.
Please help improve the article with a good introductory style.

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