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
This note was uploaded on 11/29/2010 for the course CSC 873569 taught by Professor Roberts during the Spring '10 term at ASU.
 Spring '10
 Roberts

Click to edit the document details