Generate p machine code; tree grammar

[afran...@gmail.com]

I have completed my symbol table and now in the phase of code generation. My program is suppose to translate c to p machine. I don't know much of how code generation is handled by antlr using the tree walking strategy. So i looked into some tutorials and saw 'LLVM'. My Question is, can i use this tutorial below to fulfill my objectives ?

http://www.antlr.org/wiki/display/ANTLR3/LLVM

I know how p machine codes are translated(e.g ldc i,sto i) from a given expression.

Are there any major changes to make apart from the translation from that tutorial ?