Question: Answer question #2 QUESTION 1 Given a grammar G=(T N, S, P) as follows: T = {a, b, c} N- (A, B,S) A- ab B-
Answer question #2

QUESTION 1 Given a grammar G=(T N, S, P) as follows: T = {a, b, c} N- (A, B,S) A- ab B- Ba B-b Answer the questions: 1) What Type grammar is this? (Type 0, 1, 2, or 3?) 2) Show 5 instances of strings that can be generated by G. 3) Verify whether string "aaabbbab" can be accepted by G
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
