Question: $2.$a$)$ Considerthe

graminarbew, with

terminals...

solve needed

$2.$ a$)$ Consider the grammar below, wilh terminals $($c$,$i$,$ x$,$ c$,$il$.c=100$;$1=50$;$x=10$; $y=5,i=1.$

Notice that we use lowercase characters here to represcat the numerals, to distinguish them from the non$-$terminaly.

$S$xTU$||x|x|$

$Tc||$

$xxx|U|$

$U|Y|v||||$

$Yx|y|$

$|i||c|$

Find the leff derivation and draw a parse tree for $67.$

b$)$ Conver the following grammar to a PDA that accepts the same language. Show that

$5$

PDA accept the string 'abbcbba'

Convert accept the string 'abbebba?

SoraSa

$S2bSb$

$S+2c$

Convert the given $CFGtoCNF,$ Consider the given grammar $G.$

$Sa|aA|B$

$A$aBB$|E|$

$BAa|b|$