OLD | NEW |
1 // Copyright (c) 2015, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2015, the Dart project authors. Please see the AUTHORS file |
2 // for details. All rights reserved. Use of this source code is governed by a | 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. | 3 // BSD-style license that can be found in the LICENSE file. |
4 | 4 |
5 // TODO(jmesserly): import from its own package | 5 // TODO(jmesserly): import from its own package |
6 import '../js/js_ast.dart'; | 6 import '../js_ast/js_ast.dart'; |
7 import '../js/precedence.dart'; | 7 import '../js_ast/precedence.dart'; |
8 | 8 |
9 import 'js_names.dart' show TemporaryId; | 9 import 'js_names.dart' show TemporaryId; |
10 | 10 |
11 /// A synthetic `let*` node, similar to that found in Scheme. | 11 /// A synthetic `let*` node, similar to that found in Scheme. |
12 /// | 12 /// |
13 /// For example, postfix increment can be desugared as: | 13 /// For example, postfix increment can be desugared as: |
14 /// | 14 /// |
15 /// // psuedocode mix of Scheme and JS: | 15 /// // psuedocode mix of Scheme and JS: |
16 /// (let* (x1=expr1, x2=expr2, t=x1[x2]) { x1[x2] = t + 1; t }) | 16 /// (let* (x1=expr1, x2=expr2, t=x1[x2]) { x1[x2] = t + 1; t }) |
17 /// | 17 /// |
(...skipping 299 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
317 @override | 317 @override |
318 visitYield(Yield node) { | 318 visitYield(Yield node) { |
319 if (!_nestedFunction) hasYield = true; | 319 if (!_nestedFunction) hasYield = true; |
320 } | 320 } |
321 | 321 |
322 @override | 322 @override |
323 visitNode(Node node) { | 323 visitNode(Node node) { |
324 if (!hasYield) super.visitNode(node); | 324 if (!hasYield) super.visitNode(node); |
325 } | 325 } |
326 } | 326 } |
OLD | NEW |