Skip to main content
Log in

Constructive-Synthesizing Structures and Their Grammatical Interpretations. i. Generalized Formal Constructive-Synthesizing Structure

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Capabilities of various formal grammars are generalized, and a framework for constructive-synthesizing structures is proposed. Its tools make it possible to formalize processes and results of formation of constructions on the basis of elements with attributes. Possibilities of specialization, specification of constructive-synthesizing structures, and also interpretation based on algorithmic structures modeling an executor are considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. I. L. Bratchikov, The Syntax of Programming Languages [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  2. A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1, Syntactic Analysis [Russian translation], Mir, Moscow (1978).

    Google Scholar 

  3. A. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools [Russian translation], Izd. Dom “Williams,” Moscow (2003).

    Google Scholar 

  4. R. Hunter, The Essence of Compilers [Russian translation], Izd. Dom “Williams,” Moscow-St. Petersburg-Kyiv (2002).

  5. S. Ginzburg, Mathematical Theory of Context-Free Languages [Russian translation], Books on Demand, Moscow (2012).

    Google Scholar 

  6. T. Pratt and M. Zelkowitz, Programming Language Design and Implementation [Russian translation], Piter, St. Petersburg (2002).

    Google Scholar 

  7. A. A. Markov and N. M. Nagornyi, Theory of Algorithms [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  8. F. T. Andon, A. E. Doroshenko, G. E. Tseitlin, and E. A. Yatsenko, Algebro-Algorithmic Models and Methods of Parallel Programming [in Russian], Akademperiodika, Kyiv (2007).

    Google Scholar 

  9. V. I. Shynkarenko, V. M. Ilman, and G. G. Krol, “Grammar-algorithmic structural models of metaalgorithms,” USiM, No. 1, 3–16 (2010).

  10. K. S. Fu, Structural Methods of Pattern Recognition [Russian translation], Mir, Moscow (1977).

    Google Scholar 

  11. O. V. Pavlyuk and B. D. Savchynskyy, “Efficient parsing and recognition of structured images,” USiM, No. 5, 13–24 (2005).

  12. J. Tou and R. Gonzalez, Pattern Recognition Principles [Russian translation], Mir, Moscow (1978).

    Google Scholar 

  13. A. D. Glubochanskii and Ye. B. Nekhamkin, “Formal linguistic description of complicated dynamic systems,” Dynamic Systems, No. 2, 109–115 (1983).

  14. P. Prusinkiewicz and A. Lindenmayer, The Algorithmic Beauty of Plants, Springer, New York (1990).

    Book  MATH  Google Scholar 

  15. M. Schlesinger and V. Glavach, Ten Lectures on Statistical and Structural Recognition [in Russian], Naukova Dumka, Kyiv (2004).

    Google Scholar 

  16. A. Aho, “Indexed grammars - an extension of context-free grammars,” in: Collected Articles on Languages and Automata, Mir, Moscow (1975), pp. 130–165.

    Google Scholar 

  17. D. J. Rozenkrantz, “Programmed grammars and classes of formal languages,” Collected Translations of Articles on Information Theory and Practice, No. 16, 117–146, VINITI, Moscow (1970).

  18. L. P. Lisovik and T. A. Karnaukh, “A method of specification of fractal sets,” Cybernetics and Systems Analysis, 45, No. 3, 365–372 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  19. V. M. Ilman, V. V. Skalozub, and V. I. Shynkarenko, Formal Structures and Their Application, Vyd-vo Dnipropetr. Nats. Un-tu Zalizn. Transp., Dnipropetrovsk (2009).

    Google Scholar 

  20. V. M. Ilman and V. I. Shynkarenko, “A structural approach to the problem of reproduction of grammars,” Problemy Programuvannya, No. 1, 5–16 (2007).

  21. V. I. Shynkarenko, V. M. Ilman, and V. V. Skalozub, “Structural models of algorithms in problems of applied programming. I. Formal algorithmic structures,” Cybernetics and Systems Analysis, 45, No. 3, 329–339 (2009).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. I. Shynkarenko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 8–16, September–October, 2014.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shynkarenko, V.I., Ilman, V.M. Constructive-Synthesizing Structures and Their Grammatical Interpretations. i. Generalized Formal Constructive-Synthesizing Structure. Cybern Syst Anal 50, 655–662 (2014). https://doi.org/10.1007/s10559-014-9655-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-014-9655-z

Keywords

Navigation