Below is the pseudo-code for a recursive descent parser. What are the corresponding productions? 'p') s() { if (lookahead == 'q' or lookahead == 'l' or lookahead == { A(); match('p');} else if (lookahead == 'm') { B(); } else error(); } A() { if (lookahead == 'q') { match('q');} else if (lookahead == '1') { match('1'); B(); } else return; BE 'm') { match('m'); A(); } B() { if (lookahead else error(); }