The syntax of a simple programming language includes the following grammar rules. where n is any number and v is any identifier. (a) (i) Translate the grammar rules into EBNF notation. [5%] (ii) Parse the following string using this grammar, showing your answer as a parse [8%] tree. WHILE VAR(a) LEQ LIT(20) BEG VAR(b) ASSGN LIT(10) ADD VAR(b) END (iii) Draw the Abstract Syntax Tree (AST) that can be derived from the parse tree you [8\%] gave in answer to part (ii) of this question. (b) What problems might arise when parsing Boolean expressions with the grammar? [4\%] Illustrate your answer using the following example. BOOL AND BOOL OR BOOL