This paper discusses an approach to programming based on the use of parameterized grammars. The concepts of these grammars are equipped with parameters that can also be objects of the grammars. Such grammars are quite a powerful tool; they are proposed to be used for formulating statements of problems of transformation of linguistic data. These grammars can be used directly for information processing, but this may not be effective. Therefore, a special class of such grammars that are effective in application is distinguished. A special system of unambiguous (functional) parameterized grammars is proposed, which can be used as an effective programming language for linguistic tasks. The ideas of deductive synthesis of programs within this system are described as deriving programs from problem statements in general parameterized grammars through logical inference, with the prospect of subsequent automation. The practical application of the proposed tool is demonstrated through examples of processing logical formulas and solving other problems. This work continues the ideas of Valentin Turchin in the field of the REFAL language.