This worksheet consists of $2$ questions for a total of $13$ marks.

Show your working for all calculations and reasoning.

Question $1$

$(7$ marks$)$

Convert the context$-$free grammar $G$ to a non$-$deterministic pushdown automaton. Where $G=(V,,R,S),V=\{S,A,B,C\},=\{a,b,c\},$ and $R$ contains

$SAB|lon|$

$AAB|CB|a$

$BAB|b|$

$CAC|c|$