Generally, programming problems are formally described as function computation problems. In this paper we want to see programming problems as language recognition problems. More precisely, we sugget to specify the former problems as systems of languages, i.e. recursive languages built from the concatenation and transformation of recursives languages. To understand our grammatical approach we illustrate it by means of typical examples of programming.