edited by
448 views
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.}$

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
admin asked May 4, 2019
351 views
Let $C = \{x\#y \mid x, y\in\{0,1\}^{*}$ and $x\neq y\}.$ Show that $C$ is a context-free language$.$
0 votes
0 votes
1 answer
3
admin asked May 4, 2019
264 views
Let $\Sigma = \{a,b\}.$ Give a $CFG$ generating the language of strings with twice as many $a’s$ as $b’s.$ Prove that your grammar is correct$.$