Patent
1994-11-22
1997-06-17
Kriess, Kevin A.
395706, 395709, G06F 945
Patent
active
056405685
ABSTRACT:
To provide inline expansion universally applicable to a variety of formulas as combinations of array functions and array operations with a programming language such as APL or FORTRAN 90 having array functions, without the need to prepare individual templates or macros. In the method of the present invention, a transformational intrinsic function (TIF) formula is analyzed during compilation and a template for inline expansion is generated. The template for inline expansion is mapped to an actual array, and macro-processing is used in generating the template. According to this method, an arbitrary combination of TIFs can be inline-expanded by simply preparing one macro-template for each TIF.
REFERENCES:
patent: 5347654 (1994-09-01), Sabot et al.
patent: 5450313 (1995-09-01), Gilbert et al.
patent: 5475842 (1995-12-01), Gilbert et al.
patent: 5485619 (1996-01-01), Lai et al.
Chaki Kakali
International Business Machines - Corporation
Kriess Kevin A.
Saber Paik
LandOfFree
Inline expansion method for programming languages having array f does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Inline expansion method for programming languages having array f, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inline expansion method for programming languages having array f will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2165787