Consider the following grammar: program - stmt_list $$ stmt_list stmt stmt_list | E stmt → id := expr | read id | write expr expr term term_tail term_tail add_op term term_tail | E term factor...

Extracted text: Consider the following grammar: program - stmt_list $$ stmt_list stmt stmt_list | E stmt → id := expr | read id | write expr expr term term_tail term_tail add_op term term_tail | E term factor factor_tail factor_tail mult_op factor factor_tail | E factor (expr) | id | literal add_op +|- mult_op *|/ Write the pseudo-code for a recursive descent parser based on the above grammar rules. For a nonterminal N, write a pseudo-code for parseN(). You are not asked to program this