Print the first 128 prime numbers without using any reserved words The obvious solution would be to just print them as a string, but is it possible to write a shorter code?

Requirements:


No input should be processed, and the output should be in the form of 2 3 5 7 11 13 ... etc.
No reserved words in the language are used at all
The language should at least allow structured programming, and have reserved words (otherwise point 2 would be moot). 


first I had exclusively C/C++ in mind, but extended the question while still trying to prevent cheating
C, 60 chars

The "no keywords" limitation doesn't matter here. I'm pretty sure that improving it, if possible, won't be done by adding keywords.

n=2;main(m){n&lt;720&amp;&amp;main(m&lt;2?printf("%d ",n),n:n%m?m-1:n++);}


Alternate version:
The output isn't as nice, but I like the printf abuse.

n=2;main(m){n&lt;720&amp;&amp;main(m&lt;2?printf("%*d",n,n):n%m?m-1:n++);}


The trick in both solutions is to merge two loops (implemented by recursion) into one.
n is the next potential prime, m the next potential divisor.
In each recursive call, we either increment n (while setting m to its previous value) or decrement m.