Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cornell!uw-beaver!apollo!perry
From: perry@apollo.HP.COM (Jim Perry)
Newsgroups: comp.lang.misc
Subject: Re: PL/I and Reserved Words
Message-ID: <46716dbf.20b6d@apollo.HP.COM>
Date: 25 Oct 89 18:53:00 GMT
References: <2958@usceast.UUCP> <4560@bd.sei.cmu.edu> <465396f5.20b6d@apollo.HP.COM> <6614@ficc.uu.net> <4666d281.20b6d@apollo.HP.COM> <6659@ficc.uu.net> <618@hq.af.mil>
Sender: root@apollo.HP.COM
Reply-To: perry@apollo.HP.COM (Jim Perry)
Organization: Hewlett-Packard Apollo Division - Chelmsford, MA
Lines: 18
Keywords: PL/I keywords

In article <618@hq.af.mil> cliff@hq.af.mil (Cliff.J.Bamford) writes:
>No PL/I equivalent to Obfuscated C? Humph. We used to have Palindromic PL/I
>contests:

Sure, you can do obscure things in any language (the old "self-writing"
program, for instance).  C just lends itself particularly to arcane coding,
what with side-effects operators, the preprocessor, and so on.

Anyway, try this: write a program in PL/I to compute and print the Fibonacci
numbers less than 100 (1,1,2,3,5...).  This program should contain at most
one letter 'e' (case insensitive, of course) and no preprocessor-style 
%directives (easy hint: it's in the "end" statement for the main procedure).  
PL/I being what it is, there are a number of ways of doing this, from the 
elegant to the less-so.
-
Jim Perry   perry@apollo.com    HP/Apollo, Chelmsford MA
This particularly rapid unintelligible patter 
isn't generally heard and if it is it doesn't matter.