$15.$ Consider the grammar G with productions

S $->$ A$|$B$,$

A $->\backslash$lambda $,$

B $->$aBb,

B $->$b$.$

Construct a grammar G by applying the algorithm in Theorem $6\mathrm{.}3$ to G$.$

What is the difference between L$($G$)$ and L$($G$)$