Loop Merger in an Interpretive Environment
Original Publication Date: 1989-May-01
Included in the Prior Art Database: 2005-Jan-28
This invention relates to a method for merging loops in an interpretive environment by testing the program source code for a predetermined attribute. The method which can be used with a highly parallel type of interpretive processing language, such as APL, can be depicted as follows: Given that one stringable function has been encountered: ¿ Look at the number of data items in the arguments. (a) If both arguments are simple scalars, execute the function immediately and remember the result. (b) If one or both arguments are long (a predetermined number which makes vector processing efficient), encode a description of the function, the argument types and locations, and the type of the result.