如何评估新编程语言的抽象语法树

i want to design a compiler for a 'new' language.The new language will have it's own syntax and outputs a valid C code.that is, generate a c code from pseudo code.I had designed a grammar.perform recursive descent parsing and got the abstract syntax tree.for example i got a tree for if structure .How can i map this to original c code? Can i perform in-order traversal or something? i want to design a compiler for a 'new' languag