A grammar for which there are two different parse trees for the same terminal string is said to be ambiguous.
Last modified 22/May/97
