Some strings of $a's$ and $b's$ have a unique parse tree in the grammar of $S\rightarrow aS|aSbS|\in.$ 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$.$