Neha Patil (Editor)

Uniquely inversible grammar

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

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.

Contents

Formal definition

A → α ∧ B → β ⟺ ( A <> B ⇒ α <> β )

Examples

Uniquely inversibles

A → a A | b B

B → b | a

Not uniquely inversibles

A → a A | b B

B → b B | a

References

Uniquely inversible grammar Wikipedia
(Text) CC BY-SA


Similar Topics