1. Consider the following grammar given in EBNF:

expr ::= term {+ term}

term ::= factor { factor}

factor ::= (expr) | number

number ::= NUMBER

NUMBER = [0 9]+

Give the pseudo-code for recursive-descent parser that implements this grammar.