Comp.compilers newsgroup

Re: Executing code at compilation time

Fri, 19 Mar 2010 17:13:38 +0000 (UTC)

Fernando Magno Quintao Pereira wrote: > If > you allow me a last question, why the loop: > > for (; i < 32767; i++) { > sum += i; > } > > is fully resolved, The assignment to sum in the first is caught by a power rule and

Jit Implementation

Fri, 19 Mar 2010 17:12:24 +0000 (UTC)

Hey guys This is still bugging me, a while back i started a similar topic on this. But really i still don't quite understand how a Jit works completely. So i hope someone here can show what i am missing. From what i understand to Jit some kind of language, do your parsing

Re: Generic AST in XML for any language

Fri, 19 Mar 2010 17:06:50 +0000 (UTC)

Hi all this rather unknown tool (called "c2xml") does a good job in producing an XML representation of C source: http://www.plutospin.com/c2xml.html I think it is GPL'ed. Kind regards Nikolaos Kavvadias

Re: Executing code at compilation time

Thu, 18 Mar 2010 04:04:19 +0000 (UTC)

Quinn Tyler Jackson wrote: (snip) >> for(k = 0; k < 1000; k++) >> if(i * i + j * j + k * k % 7 == 0) t++; This looks suspicious for the symmetry that it doesn't have. It evaluates as: if(((i * i) + (j * j) + (k * k % 7)) == 0) t++;

Re: Executing code at compilation time

Wed, 17 Mar 2010 03:40:07 +0000 (UTC)

Dear Fernando, On 17/03/2010, at 11:37 AM, Fernando Magno Quintao Pereira wrote: > If you allow me a last question, why the loop: > > for (; i < 32767; i++) { > sum += i; > } > > fully resolved, whereas: > > for (; i < 32767; i++) {

Re: Executing code at compilation time

Wed, 17 Mar 2010 03:39:33 +0000 (UTC)

Dear Patryk and Diego, thank you very much for the kind replies. In particular, Patryk, thank you very much for pointing me to Partial Evaluation. About the small program that I had posted: int main(int argc, char** argv) { int i = 0; int sum = 0;

Re: Executing code at compilation time

Wed, 17 Mar 2010 03:39:15 +0000 (UTC)

The first loop is case of recognizing that it is reduction pattern. The simplest case of the pattern will present as a cyclic loop self dependence. The following book explans the concepts for this very well... Optimizing Compilers for Modern Architectures: A Dependence-based

Re: Executing code at compilation time

Wed, 17 Mar 2010 03:38:47 +0000 (UTC)

Hi Fernando, On 16/03/2010, at 12:53 PM, Fernando wrote: > GCC does a pretty good job at optimizing a program like this one > below: > > #include > > int main(int argc, char** argv) { > int i = 0; > int sum = 0;

Re: Executing code at compilation time

Wed, 17 Mar 2010 03:37:45 +0000 (UTC)

Fernando wrote: > GCC does a pretty good job at optimizing a program like this one > below: > > #include > > int main(int argc, char** argv) { > int i = 0; > int sum = 0; > for (; i < 10; i++) { > sum += i;

Re: Executing code at compilation time

Wed, 17 Mar 2010 03:37:30 +0000 (UTC)

On 2010-03-16, Fernando wrote: > GCC does a pretty good job at optimizing a program like this one > below: > > #include > > int main(int argc, char** argv) { > int i = 0; > int sum = 0;