in Theory of Computation edited by
782 views
0 votes
0 votes

Consider the grammar G with Productions

$S \rightarrow A|B,$
$A \rightarrow   λ,$
$B \rightarrow aBb,$
$B \rightarrow b$.

Construct a Grammar $\hat{G}$ by applying the algorithm in Theorem 6.3.

in Theory of Computation edited by
782 views

4 Comments

Ohh sorry.. I thought u were talking about "B" which was mentioned in that image..
0
0
so the answer should be

$S \rightarrow B|λ,$
$B \rightarrow aBb,$
$B \rightarrow b$.

am i correct?
1
1
yes..
1
1

Please log in or register to answer this question.

Related questions