Section $7\mathrm{.}2$ Pushdown Automata and Context free languages

$($PRACTICE QUESTION$)$

$**$Construct an npda corresponding to the grammar:

$S$aSSSab $|$ lambda

$($PRACTICE QUESTION$)$

Construct an upda corresponding to the grammar:

$S$aABB$|aAA||$

$A$aBB$|b||$

$BbBB|A||$

Greibach normal form:

$S$aABB$|aAAA||$

$$aBB$|b||$

$BbBB|aBB|b$