mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-10-03 07:35:48 +01:00
Jon Ross-Perkins
7c7afc9e32
This leaves a single state for each in the expr loop. I was trying to think through ways to have per-token states, but they felt sort of bulky. Note this is more verbose: but I think the long-term is going to be that when we start wanting to add handlers, we're going to need to switch to different names based on the token found. As a consequence, the parse state logic will end up diverging a little, and we'll just want to align towards boilerplate handlers. Short-term, this opens up a path for saying that each parse node corresponds to precisely one token in success states, and separates out what were becoming big handler functions in check.
55 lines
3.3 KiB
Plaintext
55 lines
3.3 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
|
|
|
|
fn F(p: i32*) {
|
|
// Numeric, bitwise, and bit-shift binary operators are lower precedence than
|
|
// numeric and bitwise unary operators, which are lower precedence than
|
|
// dereference.
|
|
-*p + ^*p;
|
|
-*p | ^*p;
|
|
-*p << ^*p;
|
|
}
|
|
|
|
// CHECK:STDOUT: - filename: precedence_unary.carbon
|
|
// CHECK:STDOUT: parse_tree: [
|
|
// CHECK:STDOUT: {kind: 'FileStart', text: ''},
|
|
// CHECK:STDOUT: {kind: 'FunctionIntroducer', text: 'fn'},
|
|
// CHECK:STDOUT: {kind: 'IdentifierName', text: 'F'},
|
|
// CHECK:STDOUT: {kind: 'TuplePatternStart', text: '('},
|
|
// CHECK:STDOUT: {kind: 'IdentifierName', text: 'p'},
|
|
// CHECK:STDOUT: {kind: 'IntTypeLiteral', text: 'i32'},
|
|
// CHECK:STDOUT: {kind: 'PostfixOperatorStar', text: '*', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'BindingPattern', text: ':', subtree_size: 4},
|
|
// CHECK:STDOUT: {kind: 'TuplePattern', text: ')', subtree_size: 6},
|
|
// CHECK:STDOUT: {kind: 'FunctionDefinitionStart', text: '{', subtree_size: 9},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'p'},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorStar', text: '*', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorMinus', text: '-', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'p'},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorStar', text: '*', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorCaret', text: '^', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'InfixOperatorPlus', text: '+', subtree_size: 7},
|
|
// CHECK:STDOUT: {kind: 'ExprStatement', text: ';', subtree_size: 8},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'p'},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorStar', text: '*', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorMinus', text: '-', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'p'},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorStar', text: '*', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorCaret', text: '^', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'InfixOperatorPipe', text: '|', subtree_size: 7},
|
|
// CHECK:STDOUT: {kind: 'ExprStatement', text: ';', subtree_size: 8},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'p'},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorStar', text: '*', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorMinus', text: '-', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'p'},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorStar', text: '*', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'PrefixOperatorCaret', text: '^', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'InfixOperatorLessLess', text: '<<', subtree_size: 7},
|
|
// CHECK:STDOUT: {kind: 'ExprStatement', text: ';', subtree_size: 8},
|
|
// CHECK:STDOUT: {kind: 'FunctionDefinition', text: '}', subtree_size: 34},
|
|
// CHECK:STDOUT: {kind: 'FileEnd', text: ''},
|
|
// CHECK:STDOUT: ]
|