1996-12-23
2000-02-08
Hafiz, Tariq R.
395705, 395707, 395710, G06F 944
Patent
active
060235829
ABSTRACT:
A computer language construct for connecting related but independent routines at compile time. The computer language construct allows the creation of symbolic "chains", which can be called at run time. Individual functions and code fragments, written in a high level programming language, can be attached to the chains. When a symbolic chain is called, all the functions and code fragments attached to it will also be called. The definition of a symbolic chain and each function or code fragment attached to it are all independent. Chains can also be organized hierarchically, and a chain can be attached to another chain.
REFERENCES:
patent: 5375241 (1994-12-01), Walsh
patent: 5504901 (1996-04-01), Peterson
patent: 5613117 (1997-03-01), Davidson et al.
patent: 5625822 (1997-04-01), Brett
Inprise Corporation, "SEGMENT Ideal, MASM", TASM32.HLP from Borland C++ Builder 4.0 distribution, 1988.
Hayashida et al., Optimizing Method of C Compiler for TRON Architecture, IEEE, TRON Project, 1992 Symposium, pp. 70-76 (No Date With Month).
Auyeung Tak Y.
Rogers Norman L.
Hafiz Tariq R.
Ingberg Todd
O'Banion John P.
Z-World, Inc.
LandOfFree
Function code chaining method does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Function code chaining method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Function code chaining method will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1687485