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

$S\rightarrow aAB,$

$A\rightarrow bBb,$

$B\rightarrow A|\lambda.$

 is unambiguous.
asked in Theory of Computation by Boss (14k points) | 19 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,094 answers
187,240 comments
71,002 users