Context free grammar for arithmetic expressions over the alphabet int, (,), +, -) is S->SS S->S-S S- (S) S-> int Some valid example expressions are: (int), int, (int (int – int) Some invalid example expressions are: (int, intint, 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
OR
OR