ans all these questions $.$ dont answer only one question if you answer just one question i will give downvote.

b$)$ Consider the following $CFGG=(V,,R,S),$ with $V=\{S,P,Q\},=\{a,b\},$ start variable $S,8$ and rules $R$ as follows:

$SPQP$

$PaP||$

$QbQ||.$

i$.$ List all of the rules in $G$ that violate Chomsky normal form.

ii$.$ Convert into CNF of the given CFG

$2.$ a$)$ Consider the grammar below, with terminals $\{c,l,x,v,i\}.c=100$;$1=50$;$x=10$;

$6$

$v=5$;$i=1.$

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

$S$xTU$|lx|x$

$Tc|l|$

$xxx|U|$

$UiY|vI|I$

$Yx|V|$

$IiI||$

Find the left derivation and draw a parse tree for $63.$

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

$6$

$S0Al|0BA|$

$AS01|0|$

$B1B|1|$

Explain your answer with a string that accept by the PDA

$3.$ a$)$ Design a context free grammar for the following problems. All strings consisting of a $5$ series of a$\text{'}$s followed by a series of b$\text{'}$s$,$ where there are always more a$\text{'}$s than b$\text{'}$s$.$

$1$