This one time, at band camp, O Plameras wrote: > >>Ideally you want a language which is close to the notation >>of the problem domain. >> >> > >May be you can detail this.
He's talking about Domain Specific Languages, in which the language is designed to be a way to unambigiously describe some problem. For example, SQL -- it's not terribly good at being Turing complete, but it's fantasticly good at describing what you want to search for in a relational set of data. Likewise, Xpath is great way of talking about nodes in a Document Object Model. Doing either of these in programming-language-of-choice is possible, but more tedious than using the DSL directly and translating the results. _______________________________________________ coders mailing list coders@slug.org.au http://lists.slug.org.au/listinfo/coders
