322 views
0 votes
0 votes
Show that the grammar with productions

$S\rightarrow SS,$

$S\rightarrow \lambda,$

$S\rightarrow aSb,$

$S\rightarrow bSa.$

is ambiguous.

1 Answer

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
1 answer
2
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4