Question: Let G1 and G2 be context-free grammars, generating the languages L(G1) and L(G2), respectively. Show that there is a context-free grammar generating each of these
a) L(G1) ∪ L(G2)
b) L(G1)L(G2)
c) L(G1)*
Step by Step Solution
3.50 Rating (173 Votes )
There are 3 Steps involved in it
Let us assume that the nonterminal symbols of G 1 and G 2 are disjoint If they ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
923-M-C-M-S (2645).docx
120 KBs Word File
