Abstraction in programming languages according to domain-specific patterns
Ján Kollár, Emília Pietriková, Sergej Chodarev · Acta Electrotechnica et Informatica · 2012
This paper focuses on the presentation of an approach to language pattern recognition and distinguishes two concepts: abstraction and structural complexity.Abstraction as well as language patterns are examined from both current state and future perspectives.The abstraction is traced through a specific set of tools, and the premises on which the measuring methodology stands are critically analyzed with respect to theoretical and application concerns.Particular attention is paid to the main features that characterize language patterns, proposing a method for automatized raise of abstraction level based on recognition of patterns in program source code (thus not design patterns), with contribution to a new approach in development of programming languages.In addition, a large group of programs is examined with the goal of predicting the future development and application of the language patterns.All the presented experiments are performed within a specific domain of programs, providing sample derivation trees.