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

Home / Engineering / Theory of Computation / Question

Mr. Dubey • 51.17K Points
Coach

Q.) 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

(A) is type 3

(B) is type 2 but not type 3

(D) is type 0 but not type 1

Correct answer : Option (C) - is type 1 but not type 2

Discusssion

Related MCQs on Theory of Computation

Q. If you were a lead developer of a software company and you are asked to submit a project/product within a stipulated time-frame with no cost barriers, which model would you select?

Q. When does the ArrayIndexOutOfBoundsException occur?

Q. Except for , STD_LOGIC may have the following values.

Q. Key to represent relationship between tables is called

Q. What is the postfix form of the following prefix: *+ab–cd

Q. Let S be a start symbol and S -> aA, A -> BA, A -> a, B -> b be the productions in a grammar then one of the string derived form the grammar is _____.

Q. Organizational culture is similar to an individual’s:

Q. System Testing is ----

Q. The first phase of A Priori algorithm is _______.

Q. Which one of the following is not a software quality model?