+1 vote
39 views
Consider the following statements about the context free grammar
G = {S-->SS , S-->ab , S-->ba , S-->^}
I. G is ambiguous
II. G produces all strings with equal number of a’s and b’s
III. G can be accepted by a deterministic PDA.

Which combination below expresses all the true statements about ?

A) I only
B) I and III
C) II and II
D) All I,II,III

but II is not right.
0
it should be $B$
0

III is CFG thats why it is true right ?

+1
actually $G$ is regular language.

its regular expression will be

$(ab+ba)^*$ ,hence it will be DCFL too  and hence accepted by DPDA too.