fariasjanet2000 fariasjanet2000 24-01-2024 Engineering contestada Let G = (V, T, S, P ) be the phrase-structure grammar with V = {0, 1, A, B, S}, T = {0, 1}, and set of productions P consisting of S ā 0A, S ā 1A, A ā 0B, B ā 1A, B ā 1.Show that 10101 belongs to the language generated by G