If I have an ambiguous grammar G and its disambiguated version D. Then which one is true L(D) ⊂ L(G) , L(G) ⊂ L(D) or L(G)=L(D)?
As I tried with some examples to transform a grammar to it unambiguous version but i found that both are equivalent.
I mean is there a specific set relation between both. Please help me and provide an example if possible.
Thanks