Path: utzoo!attcan!uunet!aplcen!samsung!munnari.oz.au!goanna!ok
From: ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe)
Newsgroups: comp.lang.c
Subject: Re: C Trivia Question
Message-ID: <3784@goanna.cs.rmit.oz.au>
Date: 18 Sep 90 12:25:59 GMT
References: <1990Sep17.214906.20076@odin.corp.sgi.com>
Organization: Comp Sci, RMIT, Melbourne, Australia
Lines: 12

In article <1990Sep17.214906.20076@odin.corp.sgi.com>, mtoy@sgi.com (Michael Toy) writes:
> Can you think of a C statement which a compiler accepts that has
> a really long string of C keywords, with no operators between them?

> The best I've come up with is these sets of sequences of six keywords:

You can make such a sequence as long as you want:
	do do ... do ; while (0); ... while (0); while (0);
	1  2	  n    n              2          1
There's a sequence of n keywords (all "do") for any n you want.
-- 
Heuer's Law:  Any feature is a bug unless it can be turned off.