Question: Let V = {S, A, B, a, b} and T = {a, b}. Determine whether G = (V, T, S, P) is a type 0

Let V = {S, A, B, a, b} and T = {a, b}. Determine whether G = (V, T, S, P) is a type 0 grammar 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
a) S → (AB, A → Bb, B → λ.
b) S → (A, A → a, A → b.
c) S → (Ba, AB → (.
d) S → (BA, A → (B, B → (b.
e) S → bA, A → B, B → (.
f) S → (A, aA → B, B → (A, A → b.
g) S → bA, A → b, S → λ.
h) S → AB, B → (Ab, (Ab → b.
i) S → (A, A → bB, B → b, B → λ.
j) S → A, A → B, B → λ.

Step by Step Solution

3.40 Rating (156 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a This is a type 2 grammar because the lefthand side of each production has a single nonterminal sym... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

923-M-C-M-S (2644).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!