##Inter$4*$ Generate another sentence using the BNF$,$ by starting with and replacing

it repeatedly by the right$-$side of the rules until you reach the terminals. Each time you use a rule to expand a non$-$

terminal, write its number next to the non$-$terminal node. $($give a parse tree$)$

Answer $?**?$

##Inter$6*1$ S $->0$ S $1$

$2$ S $->$ epsilon

$-$ Give the derivation path for S $=*=>00001111.$ For each $=>,$ write the rule number used. E$.$g$.=1=>$

Answer $?**?$

$-$ What is the language generated by this grammar $($describe using a set former notation$).$

Answer $?**?$

##Inter$8$: $1$ S $->0$ S $0$

$2$ S $->0($generates $200$s from opposite ends and end with $0)$

$-$ Give a derivation path for $000.$ For each $=>,$ write the rule number used. E$.$g$.=1=>$

Anwser $?**?$

$-$ Give a set former description for the language.

Answer $?**?$

##Inter$10$: $1$ S $->00$ A $11$ B $($A and B are expanded independently$)$

$2$ A $->00$ A $($generates $00$s$)$

$3$ A$->$ epsilon

$4$ B $->11$ B $($generates $11$s$)$

$5$ B $->$ epsilon

$-$ Give a derivation path for $0011.$ For each $=>,$ write the rule number used.

Answer $?**?$

$-$ Give a set former description for the language.

Answer $?**?$