On Thu, 8 May 2025 12:29:30 +0200, Radoslaw Skorupka wrote: > ... >Update: since few years the delimiter in can be 2 to 18 characters long. >(it applies to JES2, not JES3). > ... (Some argument here for ISVs to test customer-facing JCL on both JES2 and JES3.
>18 characters. >IMHO it's enough to find unique string. > 18 bytes from /dev/random. 10**43 possibilities. Need to quote it. Does the 18 count paired apostrophes and ampersands? JES lexical analysis is chaotic: Conway's Law. >It's more than enough to find a string which is not a part of any >programming language, command language or any human language. >Of course there's still possibility to use DD * for binary or generated >random data, but in real world I would call it very unlikely use of DD *. > I faced the task when the limit was 2, and I wanted to code an instream NETDATA file for INDD. I scanned for an absent digraph. -- gil ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
