| Index: lib/compiler/implementation/js/precedence.dart
|
| ===================================================================
|
| --- lib/compiler/implementation/js/precedence.dart (revision 11400)
|
| +++ lib/compiler/implementation/js/precedence.dart (working copy)
|
| @@ -4,22 +4,22 @@
|
|
|
| #library("precedence");
|
|
|
| -final EXPRESSION = 0;
|
| -final ASSIGNMENT = EXPRESSION + 1;
|
| -final LOGICAL_OR = ASSIGNMENT + 1;
|
| -final LOGICAL_AND = LOGICAL_OR + 1;
|
| -final BIT_OR = LOGICAL_AND + 1;
|
| -final BIT_XOR = BIT_OR + 1;
|
| -final BIT_AND = BIT_XOR + 1;
|
| -final EQUALITY = BIT_AND + 1;
|
| -final RELATIONAL = EQUALITY + 1;
|
| -final SHIFT = RELATIONAL + 1;
|
| -final ADDITIVE = SHIFT + 1;
|
| -final MULTIPLICATIVE = ADDITIVE + 1;
|
| -final UNARY = MULTIPLICATIVE + 1;
|
| -final LEFT_HAND_SIDE = UNARY + 1;
|
| +const EXPRESSION = 0;
|
| +const ASSIGNMENT = EXPRESSION + 1;
|
| +const LOGICAL_OR = ASSIGNMENT + 1;
|
| +const LOGICAL_AND = LOGICAL_OR + 1;
|
| +const BIT_OR = LOGICAL_AND + 1;
|
| +const BIT_XOR = BIT_OR + 1;
|
| +const BIT_AND = BIT_XOR + 1;
|
| +const EQUALITY = BIT_AND + 1;
|
| +const RELATIONAL = EQUALITY + 1;
|
| +const SHIFT = RELATIONAL + 1;
|
| +const ADDITIVE = SHIFT + 1;
|
| +const MULTIPLICATIVE = ADDITIVE + 1;
|
| +const UNARY = MULTIPLICATIVE + 1;
|
| +const LEFT_HAND_SIDE = UNARY + 1;
|
| // We merge new, call and member expressions.
|
| // This means that we have to emit parenthesis for 'new's. For example `new X;`
|
| // should be printed as `new X();`. This simplifies the requirements.
|
| -final CALL = LEFT_HAND_SIDE;
|
| -final PRIMARY = CALL + 1;
|
| +const CALL = LEFT_HAND_SIDE;
|
| +const PRIMARY = CALL + 1;
|
|
|