edited by
414 views
0 votes
0 votes

Consider the following CFG $G:$

  • $S \rightarrow SS \mid T$
  • $T \rightarrow aT b \mid ab$

Describe $L(G)$ and show that $G$ is ambiguous. Give an unambiguous grammar $H$ where $L(H) = L(G)$ and sketch a proof that $H$ is unambiguous.

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
3
1 votes
1 votes
1 answer
4
admin asked May 4, 2019
495 views
Show that if $G$ is a $CFG$ in Chomsky normal form$,$ then for any string $w\in L(G)$ of length $n\geq 1,$ exactly $2n − 1$ steps are required for any derivation of $w....