1,760 views

1 Answer

Best answer
4 votes
4 votes

A context free grammar G is said to be ambiguous ,if there exists some w belongs to L(G) that has at least 2 distinct derivation trees.

If every grammar that generate L is ambiguous  then language is called inherently ambiguous ...eg for inherently grammar is L= {a^nb^nc^m}∪{a^nb^mc^m}

http://infolab.stanford.edu/~ullman/ialc/slides/slides7.pdf

selected by

Related questions

24 votes
24 votes
1 answer
1
Harsh Tripathi asked Jun 30, 2016
4,690 views
DANGLING ELSE PROBLEM:S->iEtSS' / aS'->∊/ eS E->b is a Deterministic context free grammar, and is ambiguous for "iEtiEtSeS" but ALL DCFG ARE UNAMBIGUOUS . so " how c...
1 votes
1 votes
2 answers
4
Sandeep Verma asked Nov 23, 2017
475 views
What is difference between the following languages a*b* and ambn { where m <= n }