LANGUAGE STRUCTURE FOR PROCESSING FORMULAS AND DATA IN A COMPUTER PROGRAMMING LANGUAGE WITHOUT A CALL TO AN ALGORITHM POINTER OR ALGORITHM HANDLER

摘要

The present invention relates to an umbrella that is a novel language structure capable of performing a desired task in a computer programming language for scientific and technical fields without a call to an algorithm pointer or algorithm handler. An umbrella disclosed by the present invention comprises three substructures, i.e. a hub, a stem, and a spoke. One of the defining features of the present invention is a configuration in which the hub and stem manage data generation, multivariables can be defined by the hub, and low-priority variables can be functions of high-priority variables. Another defining feature of the present invention is the ability to define a function in the stem and process a function with a formula without writing an algorithm pointer. The final substructural component, the spoke, is an option that does not have to be used when not required, and is similarly a defining feature of the present invention which performs tasks additionally applicable to generated data, in particular, even after one spoke is performed, the ending of a command is suspended, and a task of another spoke is continuously performed. As the umbrella of the present invention is an improvement over language structures for languages known to date such as C, C++ and MATLAB, for which an algorithm pointer or algorithm handle must be used in order to call an algorithm defined by a user, the language structure of the present invention, for which patent protection is sought, is a novel language structure that enables primary school and middle school level users, for whom grasping the concepts of matrices and functions is difficult, to easily solve problems.