Consider the following EBNF grammar for a very simple programming language: program:S (statemt) statemt assnmt | ifstmt | do inout | progcall assnmt :-ident ~ exprsn ; ifstmt ::- 1 comp r sn @ {statemt } [% {statemtH & inout 1osym ::- progcal1-C program G comprsn ::= ( oprnd opratr oprnd ) exprsn factor ( factor factor oprnd ( oprnd) oprnd ::- integer | ident | bool | ( exprsn ) opratn - ident char integer: digit (digith letter := iosym ident {, ident } ; :-letter (charh :: letter | digit digit bool The tokens are: S 1 D U E R 0 GWXYZ01TF;~@%&,()+*=>!^ Nonterminals are shown as lowercase words. The following characters are NOT tokens (they are EBNF metasymbols) 1 Note that parentheses are TOKENS, not EBNF metasymbols in this particular grammar. 1. Draw Syntax Diagrams for the above grammar