Inherently ambiguous language

A formal language is inherently called ambiguous language if any formal grammar is ambiguous with . ${\displaystyle L}$ ${\displaystyle G}$ ${\displaystyle L\left(G\right)=L}$

${\displaystyle L\left(G\right)}$stands for the language generated by the grammar . ${\displaystyle G}$

example

The language is inherently ambiguous as each has different syntax trees . The proof can be found, for example, in Ingo Wegener's book Theoretical Computer Science: An Algorithm-Oriented Introduction . ${\displaystyle L=\{a^{n}b^{n}c^{m}\;|\;n,m\in \mathbb {N} _{0}\}\cup \{a^{m}b^{n}c^{n}\;|\;m,n\in \mathbb {N} _{0}\}}$ ${\displaystyle a^{i}b^{i}c^{i}}$

See also

• Legal derivation

swell

1. ↑ Ingo Wegener : Theoretical Computer Science. An algorithm-oriented introduction . 2nd revised edition. Teubner, Leipzig 1999, ISBN 3-519-12123-9 .