Print the first 128 prime numbers without using any reserved words
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.