Computer Sciences > Gate 2023 > Regular Language
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)*

Correct : a

Similar Questions

Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive 0s and two consecutive 1s?
#132 MCQ
Let L1 and L2 be any context-free language and R be any regular language. Then, which of the following is correct ? I. L1 ∪ L2 is context-free. II. L1' is cont...
#166 MCQ
For Σ = {a, b}, let us consider the regular language L = {x ∣ x = a2+ 3k or x = b10 + 12k, k ≥ 0} Which one of the following can be a pumping length (the co...
#252 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: