In one sense of implementing OOP in HLASM, it's trivial but onerous.
Take an OOP language that has an open source compiler available for
z/OS. Using the object code if necessary, reverse engineer the entire
compiler into assembler language and rebuild the compiler. So you now
have an OOP compiler written in assembler language.
Now write assembler macros to accept every statement written in the
original language, possibly massaged to meet assembler coding
restrictions, and pass that statement to the compiler you've written.
When compiled, the OOP program will have been transformed from original
format (assembler macros) to executable code entirely with assembler code.
That's probably not what anyone meant.
From this whole discussion, I think the challenge to add an HLASM
routine to the list of languages in which the Knuth challenge, to
correctly implement recursion and non-local references, is a more
intriguing one. That it can be done is obvious (just reverse engineer
the object code of any existing z/OS solution), but that it can be done
more efficiently and with more efficient use of memory than any other
z/OS solution (and hence allow more iterations) would be the goal.
gary
Gary Weinhold
Senior Application Architect
DATAKINETICS | Data Performance & Optimization
Phone +1.613.523.5500 x216
Email: [email protected]
Visit us online at www.DKL.com
E-mail Notification: The information contained in this email and any attachments is confidential and may be subject to copyright or other intellectual property protection. If you are not the intended recipient, you are not authorized to use or disclose this information, and we request that you notify us by reply mail or telephone and delete the original message from your mail system.
