-1

Give context-free grammars that generate the following language. In all parts the alphabet ∑ is {x,s}. {w| w starts and ends with the different symbols}

Muhammad Shahid Khan Afridi
  • 101
  • 1
  • 1
  • 8

1 Answers1

1
S -> xAs | sAx
A -> xA | sA | xAs | sAx | e

e = epsilon

sameerkn
  • 2,209
  • 1
  • 12
  • 13