TOC/Automata

1 Consider the following CFG:

:= |

:= A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P| Q | R | S | T | U | V | W | X | Y | Z

:= - |

:= |

:= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9

:= |

:= "+"|"-"|"/"|"*"

:= | assignSt>

:= "print"

:= "=" | "="

:= " " |

If the starting symbol is , can strings

X = 85

Y = - 3 * Z

and

A = 6

B = 3

C = A + B

print C = 9

be derived from the grammar? Justify your answer. (If impossible to derive, explain why. If possible, give a derivation).