Computer Sciences > Gate 2023 > Regular Language

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Consider the following grammar:
S —> aSb|X
X —>aX|Xb|a|b
What can be said about the language generated by grammar?

A

The regular expression for language generated by the grammar is a*(a + b)b*

B

The language generated by the grammar is non-regular

C

The regular expression for language generated by the grammar is a* b*(a + b)

D

The regular expression for language generated by the grammar is (a + b)*

Check Answer

Explanation

Correct : a

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