From what I understand from the lecture, expression is 'term (op term)*' ('*' means it's 0 or more.)
So if I follow this rule, there is no condition that matches this case( x + g(2,y,-z) * 5 ).
The source code is basically 'term op term op term'.
Even If I split up the expression to two parts,
1. x + g(2,y,-z)
2. (result of 1) * 5
The resulting code makes no sense because
1. exp1( x ) op( + ) exp2( g(2,y,-z) ) will generate
2. exp1( result of 1 ) op( * ) exp2 ( 5 ) will generate
Because Jack language has no operator priority.
Should I implement my own version of codeWrite(exp)? Also, I have no idea how should I prioritize expressions inside of parenthesis.
edit 1: Is it ok to let the compiler calculate integer-only-expressions? Like, 'do Output.printInt(1 + (2 * 3));' can be simplified during compile time into 'do Output.printInt(7)'
edit 2 : And... Is it really possible to reuse Project 10's Compilation Engine?? For example, A variable declaration actually doesn't have to be placed in the first line of the function in Jack language. So the safest time to count local arguments would be right before the 'return' statement. Then somehow I should delay the rest of .vm writing for 'function name nLocals' ... Or Is it safe to assume that var dec always will be in the first line of the function.