For each of the CFGs below in construct a PDA that accepts the same language they generate, using the algorithm of Theorem 30).

The PDA we produce by the algorithm of Theorem 30 is

(i) 

S → XaY I YbX
X → YY I aY I b
Y → b I bb
(ii) Draw the total language tree.

Transcribed Image Text:

START PUSH S PUSH S PUSH S READ POP S PUSH A PUSH A ACCEPT READ₂