Show that the grammars of problems 3 and 6 generateinfinite languages.
PROBLEM 3: We found that the context freelanguages are not closed under intersection. But they are closedunder a less restrictive property – intersection with regular sets.Prove this.
PROBLEM 6: Select a feature of your favorite programminglanguage and show that its syntax is not context free.
Expert Answer
Answer to Show that the grammars of problems 3 and 6 generate infinite languages. PROBLEM 3: We found that the context free langua…