A bit of whimsy

[WhiteCube]

Can you write a short simple program that outputs "the quick brown fox" 537 times, without using a loop?

Spoiler: an old solution

PROCEDURE DXXXVII()
CALL D()
CALL X()
CALL X()
CALL X()
CALL V()
CALL I()
CALL I()
END

PROCEDURE D()
CALL C()
CALL C()
CALL C()
CALL C()
CALL C()
END

PROCEDURE C()
CALL L()
CALL L()
END

PROCEDURE L()
CALL X()
CALL X()
CALL X()
CALL X()
CALL X()
END

PROCEDURE X()
CALL V()
CALL V()
END

PROCEDURE V()
CALL I()
CALL I()
CALL I()
CALL I()
CALL I()
END

PROCEDURE I()
PRINT "the quick brown fox"
END

 

[VBService]

print("the quick brown fox\n" * 537)

def print_(i=1):
  print(f"{i}. the quick brown fox")
  if i > 536:
    return
  print_(i+1) 

print_()

 

[WhiteCube]

Nice one. I had a feeling someone would use recursion.

 

[WhiteCube]

Here's a weird one.

Spoiler: binary style

Z = "The quick brown fox\n"
PRINT G(F(F(F(G(F(G(F(F(F(F(F(Z))))))))))))
END

FUNCTION F(X)
CONCATENATION OF X AND X
END FUNCTION

FUNCTION G(X)
CONCATENATION OF X AND Z
END FUNCTION

 

[WhiteCube]

I could write a program in COBOL with an identifier named THEQUICKBROWNFOX.

Leave out one full stop, and then try to compile it.

I'm not sure if it will output 537 error messages about THEQUICKBROWNFOX, but it should be close.