No, it&#x27;s more of a No True Scotsman.  People have written DSLs that are unreadable, but those DSLs weren&#x27;t Well Designed(TM).  So their failures don&#x27;t count against DSLs, because only well designed DSLs count.<p>I think empirical evidence is that DSLs are easy to make not readable, especially as they evolve.  Then again, that&#x27;s true of almost everything, including assembly language programming, structured programming, object oriented programming, and functional programming (did I miss anything?).