Exercise 45:

CFG for {anbmckdtn=mn=kn=t}\{ a^n b^m c^k d^t \mid n=m \vee n=k \vee n=t \}
Write a CFG (which will be ambiguous) generating the words of the form anbmckdta^n b^m c^k d^t where the amount of aa’s equals the amount of bb’s or the amount of cc’s or the amount of dd’s.
Authors: Carles Creus, Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.