On 28/08/2009, at 1:31 PM, Erick Tryzelaar wrote: > > On Thu, Aug 27, 2009 at 7:10 PM, john > skaller<skal...@users.sourceforge.net> wrote: >> >> That's pretty nice! > > Thanks! I've wimped out and skipped dealing with getting the frontend > optimizations to work with this. So I'm just going pretty much > straight from binding to the backend. Got any time to help out with > that?
Not really: if anything I should work on documentation :) Happy to discuss and do a little research but I probably won't be able to do any serious programming at the moment, busy fitting out the boat. Since I'll probably end up with no money after that is done I may have to actually get a job :) > I need to adapt them to work a top-level statement at a time. I > think most of them operate like that, where they're just driven by a > List.map or a for-loop, but I'm not sure if the semantics will hold up > in every case. You won't be able to handle recursion easily. I see no reason you can't run all the optimisations: the output is the same format as the input (BBDCL records). That is, it will work fine as a whole program analyser with an LLVM backend instead of C++ back end. Getting the eval loop to work is a completely separate issue, if you can do that it should work for C++ as well. -- john skaller skal...@users.sourceforge.net ------------------------------------------------------------------------------ Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day trial. Simplify your report design, integration and deployment - and focus on what you do best, core application coding. Discover what's new with Crystal Reports now. http://p.sf.net/sfu/bobj-july _______________________________________________ Felix-language mailing list Felix-language@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/felix-language
