|Lexer, Parser, AST, what now? email@example.com (lican) (2009-03-10)|
|Re: Lexer, Parser, AST, what now? firstname.lastname@example.org (2009-03-15)|
|Re: Lexer, Parser, AST, what now? email@example.com (lican) (2009-03-17)|
|Re: Lexer, Parser, AST, what now? firstname.lastname@example.org (Aaron Gray) (2009-03-18)|
|Date:||Tue, 17 Mar 2009 23:12:30 -0700 (PDT)|
|Posted-Date:||18 Mar 2009 06:21:59 EDT|
Since I'm trying to generate dynamic language bytecode for my VM LLVM
will not do me any good. I managed to generate CFG and basic blocks
with DAG directly from AST. It's not finished yet so it's hard to tell
if the generated code does work. But the first results are promising.
It generates almost the same graph that I would draw on paper if I was
the compiler. As for SSA... I know what it is and I think it's still
to early, I'll try to do the basic optimizations first, i.e. constant
propagation and dead code elimination.
As for compiler frameworks I couldn't find a similar thing for dynamic
languages. I know DLR and Parrot exist. It's just that Parrot is
lacking some documentation and more consistent examples. As for DLR, I
saw ONE tutorial floating arount the net, but nothing clear and
readable. I learn by reinventing the wheel I guess. If the available
wheels are barely turning...
Return to the
Search the comp.compilers archives again.