The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
27 views
Show that the grammar with productions

$S\rightarrow SS,$

$S\rightarrow \lambda,$

$S\rightarrow aSb,$

$S\rightarrow bSa.$

is ambiguous.
asked in Theory of Computation by Boss (14k points) | 27 views
+1
In this gammer there are strings that can be created with different production leading to same string. basically tree structure is different for same string eg: abab

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,541 questions
54,094 answers
187,238 comments
71,001 users