Question

Show that the class of context-free languages is closed under the regular operation union. For simplicity, you may assume that the alphabets of G₁ and G₂ are the same.

[Hint: Use a constructive proof. Start with the formal definitions, G₁ = (V₁ ,∑, R₁,S₁) and G₂ = (V₂, ∑, R₂, S₂) and derive the formal definition of G∪.]

Answer 1

*****************************************************************************
PLEASE DO UPVOTE IF THE ANSWER IS HELPFUL AS IT GIVES THE CONFIDENCE TO HELP MORE STUDENTS
*****************************************************************************
Chegg allows me to answer specific no of questions including the sub parts , so please do post the rest of the questions as a separate query as per Chegg Guidelines. Thank you :)
*****************************************************************************