The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
16 views
Is the string $aabbababb$ in the language generated by the grammar $S → aSS|b$?

Show that the grammar with productions

$S\rightarrow aAb|\lambda,$

$A\rightarrow aAb|\lambda$      is unambiguous.
asked in Theory of Computation by Boss (14k points) | 16 views

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,093 answers
187,235 comments
71,001 users