215 views
0 votes
0 votes
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$.$

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
admin asked Apr 6, 2019
281 views
This question concerns the grammar $S\rightarrow A1B$ $A\rightarrow 0A|\in$ $B\rightarrow 0B|1B\in$ Is your grammar is unambiguous$?$ If not,redesign it to be unambi...
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4