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

Computer Sciences > Gate 2016 Set-1 > Grammer

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

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}*

Check Answer

Explanation

Correct : Grammar

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science