Uniquely Inversible Grammar

Uniquely Inversible Grammar

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.

Formal definition

A o alpha and B o eta iff (A <> B Rightarrow alpha <> eta)

Examples

;Uniquely inversibles

A o aA | bB

B o b | a

;Not uniquely inversibles

A o aA | bB

B o bB | a


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Simple precedence grammar — A simple precedence grammar is a context free formal grammar that can be parsed with a simple precedence parser. TOC =Formal definition=G = ( N , Sigma;, P , S ) is a simple precedence grammar if all the production rules in P comply with the… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”