The research method presented in this article is a presentation of a method for processing a program model that is described using predicates. Such describing of software models transforms in form of non-deterministic finite automatons, where each state of the automaton describes a series of actions in the form of symbolic data of indefinite length, which at the analysis step must be processed and transformed into a series of equivalent statements of the target programming language. This article describes the application and description of the stack algorithm for the syntactic processing of each state of the model. Analysis of the description according to this algorithm is more natural for the analysis of ordinary languages. Unlike known top-down and bottom-up parsing techniques, the stacks algorithm determines and parses pairs of lexemes such as a data lexeme and an action lexeme (such it`s used subject and predicate in ordinary languages).