Context free grammar for arithmetic expressions over the alphabet (int,·)+-) s: S->SS S->S-s S -> int Some valid example expressions are: (int), int, (intint – int)) Some invalid example expressions are: (int, int + (int -,int) 1. Convert this grammar to an empty stack Push Down Automata (PDA) with a single state allowing multiple stack operations in one PDA transition. 2. Using solution from (1), find a sequence of PDA transitions to show that the expression int
OR
OR