Formalization of context-free grammars by means of modified algebra of algorithms

We consider the use of the modified algebra of algorithms to formalize the grammars and outputs of context-free grammars. The inference rules and the derivations themselves of several applied grammars have been given in formulas of modified algebra of algorithms. We illustrate the use of operations of sequencing as well as operations of paralleling to describe the rules of output.