|
|
|
The basic REXX implementation provides an IMOD task with a single stack. Conceptually, a stack has a top and a bottom. Records can be added at the top (using PUSH) or at the bottom (using QUEUE). The number of records on a stack can be determined with the QUEUED() built-in function. Records can only be removed from the top of the stack with the PULL and PARSE PULL instructions.
| Copyright © 2011 CA. All rights reserved. | Tell Technical Publications how we can improve this information |