On 2 July 2010 19:53, Joel C. Ewing <[email protected]> wrote: > I think is is equally obvious that without a looping construct, > implementing a Turing Machine purely in JCL would be totally out of the > question. So clearly JCL belongs in a lesser category than those > programming languages typically used to implement business algorithms.
Yes, but... JCL has elements of declarative programming that are not found in procedural languages like REXX, PL/I, FORTRAN, COBOL, C, or indeed Turing machines. In particular the way dataset ENQs and disposition are handled is not easily expressed in procedural languages. Tony H. ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: GET IBM-MAIN INFO Search the archives at http://bama.ua.edu/archives/ibm-main.html
