Let G = (V, T, S, P) be the phrase-structure grammar with V = {0, 1, A, S}, T = {0, 1} and a set of productions P consisting of S → 1S, S → 00A, A → 0A, and A → 0. Identify the correct argument to show that 11001 does not belong to the language generated by G. Multiple Choice A) Every production results in a string that ends with S , A, or 0. Therefore, the string 11001, which ends with a 1, cannot be generated. B) Every production results in a string that does not contain S , A, or 0. Therefore, the string 11001, which contains 0, cannot be generated. C) Every production results in a string that starts with S , A, or 0. Therefore, the string 11001, which starts with a 1, cannot be generated. D) Every production results in a string that contains S , A, or 0. Therefore, the string 11001, which contains 1, cannot be generated.
NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part.
Let G = (V, T, S, P) be the phrase-structure grammar with V = {0, 1, A, S}, T = {0, 1} and a set of productions P consisting of S → 1S, S → 00A, A → 0A, and A → 0.
Identify the correct argument to show that 11001 does not belong to the language generated by G.
A) Every production results in a string that ends with S , A, or 0. Therefore, the string 11001, which ends with a 1, cannot be generated.
B) Every production results in a string that does not contain S , A, or 0. Therefore, the string 11001, which contains 0, cannot be generated.
C) Every production results in a string that starts with S , A, or 0. Therefore, the string 11001, which starts with a 1, cannot be generated.
D) Every production results in a string that contains S , A, or 0. Therefore, the string 11001, which contains 1, cannot be generated.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
