15 views
Use the exhaustive search parsing method to parse the string $abbbbbb$ with the grammar with productions

$S\rightarrow aAB,$

$A\rightarrow bBb,$

$B\rightarrow A|\lambda.$

In general, how many rounds will be needed to parse any string $w$ in this language?
asked | 15 views