Topic: Discrete Mathematics and its Applications(2012) Chapter 13 Modeling Computation "Languages and Grammars"

T={a, b). Determine [Variation on 13.1 #19. Let V = {S,A, Ba, b} and whether G = (V,T,S, P) is a type 0 grammnar but not a type 1 grammar, a type 1 grammar but not a type 2 grammar, or a type 2 grammar but not a type 3 grammar if P, the set of productions, is: 2. (c) S DCe, DC e. (d) S&D, D C,C e. (f) S+D, D C,C+