Use the picture provided below

I want a language that accepts $0$ or more $x^{\text{'}}s$ followed by $2y^{\text{'}}s,$ followed by $1$ or more z$\text{'}$s$.$

For example, my language will allow the following strings: xyyz$,$ xxyyzzz$,$ yyz$,$ xxyyzzzz$,$ etc.

What is the Regular Expression for this language using $*$ and $+[12$ points$]$

$?{?}^{****}?$ RE :

Draw the DFA diagram for this language, show the start and final states $[15$ points$]$

$?{?}^{******},******$ DRAW DFA HERE $***$

Write the function $($hand$-$coded scanner like project part A for Word$)$ for this DFA $[15$ points$]\_?**?$

bool Language$($string inputWord$)//$ use states $0,1,2,$ etc..

$\{$

$//$ write the hand$-$coded scanner here.......

$//$ check the state that you are in

$//$ return true if DFA accepts the inputword, otherwise return false

What is another way to write a scanner? Refer back to HW$2$B$.[3$ points$]$

$?**?{?}^{**}$

Given the following context$-$free grammar rules write a recursive descent parser $($RDP$)$ for the function.

$]=[$ Total $20$ points$\}$

$\{\}$

$\{$