Weekend Challenge Sharpened: Missing Positions in Champernowne's Constant

[Gerald H]

While nlj's programme is a complete solution of the problem it is not really what I wanted.

The sharpened problem is to present a programme giving the same results without iterations, recursions, loop etc.

Meanwhile here's a slightly more readable version of nlj's programme:

Code:


::
  CK1&Dispatch
  # FF
  ::
    Z0_
    BINT9
    NDUPN
    DROP'
    NULLLAM
    BINT10
    NDUPN
    DOBIND
    FALSE
    BEGIN
    7GETLAM
    Z10_
    OVER
    FPTR2 ^Z2BIN
    FPTR2 ^RP#
    Z9_
    FPTR2 ^RMULText
    6PUTLAM
    DUP
    Z1_
    FPTR2 ^RADDext
    5PUTLAM
    DUP4PUTLAM
    6GETLAM
    FPTR2 ^RMULText
    DUP
    3PUTLAM
    8GETLAM
    FPTR2 ^RADDext
    10GETLAM
    Z>=
    ::
      casedrptru
      3GETLAM
      8GETLAM
      FPTR2 ^RADDext
      8PUTLAM
      6GETLAM
      5GETLAM
      FPTR2 ^RMULText
      9GETLAM
      FPTR2 ^RADDext
      9PUTLAM
    ;
    Z1_
    7GETLAM
    FPTR2 ^RADDext
    7PUTLAM
    DUP
    UNTIL
    DROP
    9GETLAM
    10GETLAM
    8GETLAM
    FPTR2 ^RSUBext
    4GETLAM
    FPTR2 ^ZDIVext
    SWAP
    5GETLAM
    ABND
    FPTR2 ^RMULText
    FPTR2 ^RADDext
    FPTR2 ^RADDext
  ;
;