Apply the theorem covered in class to convert the following grammar G to a PDA M accepting the same language by empty stack. No credit will be given if your design an equivalent PDA from scratch.

G: S ---> begin A end

A ---> A ; A | a | S

9:32 AM T o 100%. ooooo Sprint ww.tutorialspoint CO 70 E Algorithm to find PDA correspond to a given CFG Input A CFG, G J (V, P, S) output Equivalent PDA, P (Q, 2, S, o, qo I, F) Step 1 Convert the productions of the CFG Step 2 The PDA will have only one state Step 3 The start symbol of CFG will be the start symbol in the PDA. Step 4 All non-terminals of the CFG will be the stack symbols of the PDA and all the terminals of the CFG will be the input symbols of the PDA. Step 5 For each production in the form A ax where a is terminal and A, X are combination of terminal and non-terminals, make a transition (q, a, A)