S ss that any language that follows this rule would

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: s and there is nothing on the stack, then it accepts. If there are any b’s on the stack still, then this case fails. If one or both of each case pass, then it accepts, if either of them fail then it rejects. Problem 4 Give a counterexample to show that the following construction fails to prove that the class of CFL’s is closed under star. Let A be a CFL that is generated by the CFG G = (V, ∑, R, S). Add the new rule S SS and call the resulting grammer G’. This grammer is supposed to generate A*. S SS ⇒ that any language that follows this rule would ne...
View Full Document

Ask a homework question - tutors are online