On 23/08/2018 7:44 AM, Steve Smith wrote:
Recursion in assembler is hardly difficult. Knowing how to implement
a stack is fundamental. Smart programmers not only do, but haven't
even thought about it other than when architecture improvements
require an upgrade.
Why do t you Demi started to us how easy it is? 😀
Apologies for the gibberish! Mangled by my iPad spell checker :) I meant
why don't you "demonstrate" how easy recursion is in assembler using a
stack?
It may be trivial to use a fixed sized stack and macros but it's not
easy to do a full stack frame implementation that handles overflow like
LE. We've all seen
how Metal/C uses the NAB pointer for it's stack frames and that's not
without it's issues if you don't keep track of how much storage you need.
sas
p.s. Aha! Spellchecker wants to replace Crayford with Crawford. I
will have it whipped :-)
On 8/22/2018 18:39, David Crayford wrote:
On 23/08/2018 12:46 AM, Kirk Wolf wrote:
I've used the IBM JSON parser, from C.
I don't see why it would be ill suited for assembler more than anything
else :-)
I'm doing a lot of JSON work right now and one task was to create a
JSON to YAML convertor for swagger documents.
The elegant solution was to use recursion which is difficult to do in
assembler. It's difficult to do in COBOL too.
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
