2. (14 points) With the procedure “match(x)” defined as in slide 26 of the notes “Contest-free Languages and Pushdown Automata IV”, the recursive descent procedures for the following LL(1) grammar can be written as follows: A if then else ガ B i then else ガ Show transcribed image text 2. (14 points) With the procedure “match(x)” defined as in slide 26 of the notes “Contest-free Languages and Pushdown Automata IV”, the recursive descent procedures for the following
OR
OR