search for: cc2llvm

...; what you are doing :-). You guys did a great job! > >> It was easy to lower the Elsa AST to LLVM by using Elsa's extension >> capability. > > I'll be pretty interested to see how you did that. You'll see it soon. But basically think about cc2c. There is now a cc2llvm. > >> Does Elsa provide an advantage over g++? For me, understanding it is a >> big plus. ;-) In addition, Elsa has a Berkeley-like license which I prefer. > > Read it more carefully: the license is not just BSD-like, it *is* BSD! Yes. > >> I'll let you know...

...ures. Oink is basically a bucket into which to throw tools like this one that use Elsa as a front-end. Daniel On Dec 7, 2007 6:37 AM, Richard Pennington <rich at pennware.com> wrote: > I don't know if these are the appropriate places to say this, but: > > [~/llvm] ms% ccparse -cc2llvm - sieve.c > foo.ll > [~/llvm] ms% llvm-as foo.ll -o foo.bc > [~/llvm] ms% llvmc foo.bc -o foo.s > [~/llvm] ms% gcc -o foo foo.s > [~/llvm] ms% ./foo > 10 iterations\n1899 primes\n > > It says a a lot about both Elsa and LLVM that I've gotten this far in > about a week...

> I've build gcc many times over the years for different target processors > and was never able to get my head around it internally. It is incredibly > complex. I also didn't like the fact that I had to have N copies of gcc > to support N processors. Scott McPeak is rather familiar with the internals of gcc and edg and says elsa is far simpler. > I became interested in

Chris Lattner wrote: > On Dec 21, 2007, at 1:08 PM, Richard Pennington wrote: > >> I'm a little further along now. I've started to put together a simple >> driver for Elsa and LLVM that I'm calling "ellsif" (cute name, I think >> it works). >> >> The file being compiled is a "printf" function. Here are timing >> results