Some strings of a$\text{'}$s and b$\text{'}$s have a unique parse tree in the

grammar of Exercise $5\mathrm{.}4\mathrm{.}1.$ Give an efficient test to tell whether a given string

is one of these. The test "try all parse trees to see how many yield the given

string" is not adequately efficient