GATE Computer Science 2016 Question 23: Language Generated by Grammar S → aS|bS| ε

```

Computer Sciences > Gate 2016 Set-1 > Grammer

Which of the following languages is generated by the given grammar?

S → aS|bS| ε

A

{aⁿb^m | m,n >= 0}

B

{w∈{a,b}* | w has equal number of a's and b's}

C

{aⁿ | n>=0} U {aⁿbⁿ | n>=0}

D

{a,b}*

Correct : Grammar

Similar Questions

Which one of the following grammars is free from left recursion?

#87 MCQ

Identity the language generated by following grammar where S is the start variable. S --> XY X --> aX | a Y --> aYb | ∈

#164 MCQ

Consider the following grammar over the alphabet {a,b,c} given below, S and T are non-terminals. G1: S-->aSb|T T--> cT|∈ G2: S-->bSa|T T--> cT|∈ The language...

#179 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......