The Gateway to Computer Science Excellence
0 votes
7 views

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.

in Theory of Computation by Veteran (54.8k points) | 7 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,492 answers
195,454 comments
100,751 users