Modeling of a dynamic system by functional grammars

The article considers the problem of modeling a class of computer programs that generate computational processes and adequately describe the operation of a dynamic system. To solve this problem, we use the means of functional grammars. Identification is the basic operation of functional grammars. The article gives an example of using the identification operation on a fragment of the computer program that simulates a dynamic system. The end result is the obtaining of basic functions superposition with the involvement of the identification operation. The superposition obtained is an algebraic model of dynamic system, presented in the form of a computer program. We have constructed a parse tree for the computer program, which nodes contain the basic functions (non-terminals). If nodes require a representation in the form of functions (an object is the function), then this node is interpreted as a superposition of basic functions. If in nodes a representation in the form of text is required, then an object is the fragment of the program text corresponding to non-terminal (non-terminal in this node is a fragment of the program text). Also, nodes may require a representation in the form of values (an object is the result of the above superposition of functions corresponding to non-terminal).