Problem 4: There are 5 languages and 5 grammars. Next to each language state the number...

Transcribed Image Text:

Problem 4: There are 5 languages and 5 grammars. Next to each language state the number of the grammar who's language it is a) {abn#m} b) {abn>m} c) {a²b|n>2m} d) {a¹bn>0} e) {a²b|n>m>0} f) {a²b|n=2m+1} 1) SaSB SIE B → b BE 4) S →aaTb TaTb TaT TE 2) SaS S→ Sb Sa 5) SaSb S→T S →R T- →→aT R→ Rb Ta R → b 3) SaaSb SaT TaT TE 6) SaaSb Sa Problem 4: There are 5 languages and 5 grammars. Next to each language state the number of the grammar who's language it is a) {abn#m} b) {abn>m} c) {a²b|n>2m} d) {a¹bn>0} e) {a²b|n>m>0} f) {a²b|n=2m+1} 1) SaSB SIE B → b BE 4) S →aaTb TaTb TaT TE 2) SaS S→ Sb Sa 5) SaSb S→T S →R T- →→aT R→ Rb Ta R → b 3) SaaSb SaT TaT TE 6) SaaSb Sa

Answer rating: 100% (QA)

Step 1 a abn This grammar generates a string with b repeated n times regardless of the number of as Grammar 2 seems to fit 2 SaS S Sb Sa Using this grammar you can keep deriving as as needed with the ... View the full answer