Problem $7$

Let $G$ be a context$-$free grammar in Greibach Normal Form.

$G$:$SaT|aR$

$T>$aTB$|cB$

$R>$aRC$|c$

$B>b$

$C>c$

a$.$ Use JFLAP to construct a NPDA M such that $L(M)=L(G).$ You must use the algorithm

from the Power Point slides from Chapter $7\mathrm{.}2.$

b$.$ Use JFLAP to test M on the following input:

acb, aacbb, aaacbbb, aaaacccc, ac$,$ aacc, acbaacbb, accb, aabbc, ab

c$.$ Hand draw parse trees using grammar $G$ for $w=$aaacbbb and for $w=$ aaaacccc

d$.$ Describe $L(G)$ is terms of the patterns of strings accepted by $M.$

Submit the JFLAP diagram for the NPDA M$.$ Submit the JFLAP test case. Submit the parse tree

drawings from Part $c$ and description of $L(G)$ from part $d.$ Do not use JFLAP to create the parse

trees in Part c$.$