mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-10-04 22:02:52 +01:00
Jon Ross-Perkins
b2084ea15d
This PR renames parse nodes on a Name/NameExpression taxonomy. NameExpressions occur in a name context. The difference is that in non-expression contexts it's useful to return the identifier / string ID for adding to name lookup, whereas in expression contexts it's useful to return the resolved node ID for consistency with other expressions. In the code, I do note SelfValueName is returned in the expression context: I'd expect this to change, as `self` in `[self: Self]` versus `self.Foo()` will probably be best handled similarly to the above. That means that, in the proposed taxonomy, both `SelfValueName` and `SelfValueNameExpression` will exist in order to assist semantics. To contrast choices: Original | Current | [zygoloid suggestion](https://discord.com/channels/655572317891461132/655578254970716160/1121581663399464970) | [This PR](https://discord.com/channels/655572317891461132/655578254970716160/1121814551789318215) --- | --- | --- | --- DeclaredName/DesignatedName | Identifier | NameComponent | Name NameReference | NameReference | NameReference | NameExpression SelfValueIdentifier | SelfValueIdentifier | SelfValueReference | SelfValueName SelfTypeIdentifier | SelfTypeIdentiifer | SelfTypeReference | SelfTypeNameExpression
44 lines
2.8 KiB
Plaintext
44 lines
2.8 KiB
Plaintext
// Part of the Carbon Language project, under the Apache License v2.0 with LLVM
|
|
// Exceptions. See /LICENSE for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
// AUTOUPDATE
|
|
// CHECK:STDOUT: [
|
|
// CHECK:STDOUT: {kind: 'FunctionIntroducer', text: 'fn'},
|
|
// CHECK:STDOUT: {kind: 'Name', text: 'F'},
|
|
// CHECK:STDOUT: {kind: 'ParameterListStart', text: '('},
|
|
// CHECK:STDOUT: {kind: 'ParameterList', text: ')', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'FunctionDefinitionStart', text: '{', subtree_size: 5},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'a'},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'b'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperator', text: '*', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'c'},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'd'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperator', text: '*', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'InfixOperator', text: '+', subtree_size: 7},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'd'},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'd'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperator', text: '*', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'e'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperator', text: '<<', has_error: yes, subtree_size: 5},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'f'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperator', text: '&', has_error: yes, subtree_size: 7},
|
|
// CHECK:STDOUT: {kind: 'NameExpression', text: 'g'},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperator', text: 'not', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'InfixOperator', text: '-', has_error: yes, subtree_size: 10},
|
|
// CHECK:STDOUT: {kind: 'InfixOperator', text: '=', subtree_size: 18},
|
|
// CHECK:STDOUT: {kind: 'InfixOperator', text: '=', subtree_size: 20},
|
|
// CHECK:STDOUT: {kind: 'ExpressionStatement', text: ';', subtree_size: 21},
|
|
// CHECK:STDOUT: {kind: 'FunctionDefinition', text: '}', subtree_size: 27},
|
|
// CHECK:STDOUT: {kind: 'FileEnd', text: ''},
|
|
// CHECK:STDOUT: ]
|
|
|
|
fn F() {
|
|
// CHECK:STDERR: fail_variety.carbon:[[@LINE+4]]:29: Parentheses are required to disambiguate operator precedence.
|
|
// CHECK:STDERR: fail_variety.carbon:[[@LINE+3]]:34: Parentheses are required to disambiguate operator precedence.
|
|
// CHECK:STDERR: fail_variety.carbon:[[@LINE+2]]:38: Parentheses are required to disambiguate operator precedence.
|
|
// CHECK:STDERR: fail_variety.carbon:[[@LINE+1]]:40: Parentheses are required to disambiguate operator precedence.
|
|
n = a * b + c * d = d * d << e & f - not g;
|
|
}
|