Q1

Convert the following CFG into an equivalent PDA (note that in this problem, the start symbol is X): X X Y |Y Y Y/Z|Z Z (X)|q Extra points: You may solve this problem either (i) using the shorthand notation we discussed in class and in the book OR (ii) without using the shorthand notation and instead writing out the fully expanded PDA. If you do option (ii) and do it correctly, you will be given two extra points.

Q2

The following is a grammar for JMH-Lisp 2.1, a modified version of the language you encountered in homework 4, with slightly different syntax, and expanded set of functions. It uses underscores rather than spaces, square brackets rather than parentheses, and words as function names instead of symbolic operators. S [O E E] E [O E E]|N N 0|1|2|3|4|5|6|7|8|9|NN O add|sub|mul|div|mod|shl|shr Create a PDA that recognizes JMH-Lisp 2.1. Extra points: You may solve this problem either (i) using the shorthand notation we discussed in class and in the book OR (ii) without using the shorthand notation and instead writing out the fully expanded PDA. If you do option (ii) and do it correctly, you will be given two extra points.