Definition A CFG is ambiguous ⟺ there is a string x∈L(G) for which there is more than one Parse Tree.