edited by
739 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.

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
0 answers
4