Refactor binary expression parser to reduce call depth
Refactor binary expression parser to reduce call depth

Instead of having to call all of the following:

parseLogicalOR_
parseLogicalAND_
parseBitwiseOR_
parseBitwiseXOR_
parseBitwiseAND_
parseEquality_
parseRelational_
parseShiftExpression_
parseAdditiveExpression_
parseMultiplicativeExpression_
parseExponentiationExpression_
parseUnaryExpression_

We just call parseUnaryExpression_ directly and check if there is
an operator after it. We then use precedence to determine the order
to create the binary expression AST node in.

This gives 10% - 20% performance improvement on the esprima persar
performance test.

longze/traceur-compiler,rossberg-chromium/traceur-soundscript,lintangarief/traceur-compiler,longze/traceur-compiler,pandoraui/traceur-compiler,arv/traceur-compiler,google/traceur-compiler,renie/traceur-compiler,google/traceur-compiler,wilsonokibe/traceur-compiler,sid0818/traceur-compiler,sebmck/traceur-compiler,bjlxj2008/traceur-compiler,sebgod/traceur-compiler,arv/traceur-compiler,bazaarvoice/traceur-compiler,johnjbarton/traceur-compiler,sid0818/traceur-compiler,sebmck/traceur-compiler,renie/traceur-compiler,rossberg-chromium/traceur-soundscript,kittens/traceur-compiler,bjlxj2008/traceur-compiler,pandoraui/traceur-compiler,lintangarief/traceur-compiler,johnjbarton/traceur-compiler,wilsonokibe/traceur-compiler,sebgod/traceur-compiler,kittens/traceur-compiler,bazaarvoice/traceur-compiler