| OLD | NEW |
| (Empty) | |
| 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. |
| 4 |
| 5 #library("precedence"); |
| 6 |
| 7 final EXPRESSION = 0; |
| 8 final ASSIGNMENT = EXPRESSION + 1; |
| 9 final LOGICAL_OR = ASSIGNMENT + 1; |
| 10 final LOGICAL_AND = LOGICAL_OR + 1; |
| 11 final BIT_OR = LOGICAL_AND + 1; |
| 12 final BIT_XOR = BIT_OR + 1; |
| 13 final BIT_AND = BIT_XOR + 1; |
| 14 final EQUALITY = BIT_AND + 1; |
| 15 final RELATIONAL = EQUALITY + 1; |
| 16 final SHIFT = RELATIONAL + 1; |
| 17 final ADDITIVE = SHIFT + 1; |
| 18 final MULTIPLICATIVE = ADDITIVE + 1; |
| 19 final UNARY = MULTIPLICATIVE + 1; |
| 20 final LEFT_HAND_SIDE = UNARY + 1; |
| 21 // We merge new, call and member expressions. |
| 22 // This means that we have to emit parenthesis for 'new's. For example `new X;` |
| 23 // should be printed as `new X();`. This simplifies the requirements. |
| 24 final CALL = LEFT_HAND_SIDE; |
| 25 final PRIMARY = CALL + 1; |
| OLD | NEW |