Implement a recursive descent parser in Python for the grammar listed as following:

$\{(-|)\}|)/($

Use the following code as a model for your implementation:

$/*$ Function expr

Parses strings in the language

generated by the rule:

$$ expr $>$ term term $>*$

void expr$()\{$

$/*$ Parse the first term As long as the next token is $+$ or $-,$ call

lex to get the next token and parse the

next term ${?}^{**}$

while $($nextToken $==$ ADD$\_$OP II

nextToken $=$ SUB$\_$OP$)$

lex$()$;

term$()$;

$\}$

$\}.$