Question

Consider a grammar : S --> a | aS | bSS | SSb | SbS, Where T={a,b} V={S }.

a. Show that the grammar is ambiguous.

b. What is the language generated by this grammar?

2. (20 points) Consider a grammar: S -->a | aS | SS | Ssb | Sbs, Where T={a,b} V={S}. a. Show that the grammar is ambiguous. b. What is the language generated by this grammar?

Answer 1

2016 August 15 Monday Güven the language is Salas loss Iss 6 | sbs terminals. Here ab are s is non terminal a to show given Guammar is Ambiguos Tuesday is said to Ambiguos grammar & Any Grammar be antiguos such that there existe syntax tree for one string. more Parse trees Example - aaba for aaba if we Can derive in two ways is ambiguos the guammou CS Scanned with CamScanner

2016 August Monday 22 S S ^ S sbs A s b. 1 S S a a b a o > aaba - a aba. Tuesday 23 the be derived in Con I ways So grammar So is ambiguos guamman the guamman Language generated by 3-a lastbss | ssbl sbs {a, aa, baa, arab, abay that contains one are more a's and ie Language single b W T F S M T W T F S S M T W T S S 9 10 11 12 13 14 15 16 17 18 Sep 2016 CS Scanned with CamScanner

2016 st nesday L=şa, aa, bat, atb, at bat ? this is the language generated by the grammar CS Scanned with CamScanner

This is the language generated by the grammar.

THANK YOU