Abstract—Traditional theoretical works on language processing systems define the syntax of a formal language as a set of rules of grammar, which a compiler can check, all other language aspects, which we can detect only in runtime. We call them "semantics". Moreover, static semantics – i.e., those language properties which may be checked at the translation (compilation) time, distinguish from dynamic semantics – all other properties of this language. This article describes various approaches to defining the static semantics of an implemented language. A comparison of attribute-based language specification methods is also given. Examples provided. In addition, a new attribute-based approach to the implementation of contextual conditions in a translational context-free grammar in regular form are presented in the article. The attention is paid to the attributed automation model in the framework of automata theory to the decomposition problem and, to the application of attributed automata from the point of view of model developed.