Computer Sciences > Gate 2017 Set-2 > Grammer

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Identity the language generated by following grammar where S is the start variable.

S --> XY
X --> aX | a
Y --> aYb | ∈

A

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

B

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

C

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

D

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

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