0 votes 0 votes Convert the $CFG$ $G$ $R\rightarrow XRX \mid S$ $S\rightarrow aT b \mid bT a$ $T\rightarrow XT X \mid X \mid\epsilon$ $X\rightarrow a \mid b$ to an equivalent $PDA,$ using the procedure given in $\text{Theorem 2.20.}$ Theory of Computation michael-sipser theory-of-computation context-free-grammar pushdown-automata + – admin asked May 1, 2019 edited May 4, 2019 by Lakshman Bhaiya admin 448 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.