See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

## Consider the following context-free grammar over the alphabet ∑ = {a, b, c} with S as the start symbol: S → abScT | abcT T → bT | b -gate computer science 2017

Which of the following represents the language generated by the above grammar ?

A) {(ab)n(cb)n | n >= 1 }

B) {(abncbm1cbm2...cbmn | n, m1, m2, ....., mn >= 1 }

C) {(ab)n(cbm)n | n >= 1 }

D) {(ab)n(cbn)m | m, n >= 1 }

By:satyashiromani

Taged users:

|13priya|satyashiromani|psanju96|DEEPAK202|vaishnavi-Deshpande|milanyoyoyogmailcom|Umang|ThreeRed|Msshikhil|Ashwath-Shetty|deepuckraj|Manisha12|Durvesh-pal|Divyanshu-Changkakoti|psonika29|Aparna-Dasgupta|milan-ransingh|salazar|Shivam-Yadav|akialwayz|Devang|Niveditha-|Jhon|jimusabapa|aksingh1818|Amogh|rajeshdotsinghgmailcom|leo|Aaditi|madachod

Likes:

Be first to like this question

Dislikes:

Be first to dislike this question

Talk about thisDelete|Like|Dislike|

## Answers

**B) {(abncbm1cbm2...cbmn | n, m1, m2, ....., mn >= 1 }**

Explanation:

Let’s generate a string from given grammar : S → abScT → ab abScT cT → abab abcT cTcT → abababc bT cTcT → abababcb bT cTcT → abababcbb bT cTcT → abababcbbbb cTcT → abababcbbbbc b cT → abababcbbbbcbc bT → abababcbbbbcbcbb This string can rule out all wrong options. Now let’s try to analyse this string. → abababcbbbbcbcbb → {(abncbm1cbm2...cbmn | n, m1, m2, ....., mn >= 1 } We can clearly rule out option (A), (C) and (D) with help of the string generated by given grammar. Only option (B) is correct.

deepuckraj

Likes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

------------------------------------

## Use Me ?