Type-1 Grammar is known as_____________

Related MCQs

• The following grammar G = (N, T, P, S) N = {S, A, B} T = {a, b, c} P : S → aSa S → aAa A → bB B → bB B → c is
• The following grammar G = (N, T, P, S) N = {S, A, B, C, D, E} T = {a, b, c} P : S → aAB AB → CD CD → CE C → aC C → b bE → bc is
• The following grammar G = (N, T, P, S) N = {S, A, B, C} T = {a, b, c} P : S → aS A → bB B → cC C → a is
• Which of the following strings is not generated by the following grammar? S → SaSbS ε
• The following grammar G = (N, T, P, S)**spaceN = {S, A, B, C, D, E}**spaceT = {a, b, c}**spaceP : S → aAB**spaceAB → CD**spaceCD → CE**spaceC → aC**spaceC → b**spacebE → bc is
• Context free grammar is not closed under
• Grammar that produce more than one Parse tree for same sentence is:
• All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the:
• Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
• Any Language generated by an unrestricted grammar is: