Question

Give a phrase-structure grammar that generates the set {0xn1yn | n = 0, 1, 2, . . . }, where x is the number of consonants and y is the number of vowels in your first name.

e.g. Let’s say your name is “Buket”. Then x will be 3 and y will be 2 and you should find the grammar that generates 0_3n1_2n where n is a nonnegative integer.

Answer 1

so) state you need consides that 's' is initical (or) starting y=3 for x=2 and name Berket for name is "susae" V = { 5,0,1} so that grammes will be reduce 029135 let n=0 then string string 02m13n string i and the Ý the null production steps from. S to . STA Its the no. of 'o talowed by 1. Here O2n13n way Even

so that the production is St Oosul and finally trinally th the phase structured grammer G, will have GR$ vit.s.p3 Vi $5,0113 1- Şo. 1 2 2. } the production sets is a SA S DOS111

Please do like thank you