COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The closure property of context free grammar includes
|
|
Kleene
|
|
|
Concatenation
|
|
|
Union
|
|
|
All of the mentioned
|
Explanation:
Detailed explanation-1: -Explanation: Context free languages are closed under the following operation: union, kleene and concatenation. For regular languages, we can add intersection and complement to the list.
Detailed explanation-2: -Context-free languages are not closed under intersection or complement.
Detailed explanation-3: -So, context free language is closed under union operation.
There is 1 question to complete.