255 views
0 votes
0 votes

The following CFG 

S->aS| bS| a| b

is equivalent  to the regular expression 

a)(a*+b)*    b)(a+b)+

c)(a+b)(a+b)*    d)(a+b)* (a+b)

1 Answer

Best answer
3 votes
3 votes
a) Is incorrect as € can't be derived from the grammar

b) c) d) are right
selected by

Related questions

0 votes
0 votes
1 answer
1
Sanjay Sharma asked Apr 15, 2017
651 views
The machine pictured in fig a)complements a given bit pattern b)finds 2's complement c)increments a given bit pattern by 1d)changes the sign bit
0 votes
0 votes
1 answer
2
sripo asked Dec 11, 2018
721 views
Is Timothy Williams book good for GATE preparation?
0 votes
0 votes
1 answer
3
shwetakhandelwal asked Nov 1, 2018
260 views
a << 1 is equivalent tomultiplying a by 2,dividing a by 2,adding 2 to anone