mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-09-28 22:02:37 +01:00
Jon Ross-Perkins
e58ce3e1bb
This refactors the diagnostic kind coverage check into something that also works for node kinds. Then, since this points out a few node kinds that aren't having their parse verified, I'm adding minor tests for those.
50 lines
2.7 KiB
Plaintext
50 lines
2.7 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
|
|
// TIP: To test this file alone, run:
|
|
// TIP: bazel test //toolchain/testing:file_test --test_arg=--file_tests=toolchain/parse/testdata/operators/infix.carbon
|
|
// TIP: To dump output, run:
|
|
// TIP: bazel run //toolchain/testing:file_test -- --dump_output --file_tests=toolchain/parse/testdata/operators/infix.carbon
|
|
|
|
fn F() {
|
|
n * n;
|
|
n ^ n;
|
|
n >= n;
|
|
n >> n;
|
|
n / n;
|
|
}
|
|
|
|
// CHECK:STDOUT: - filename: infix.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: 'TuplePattern', text: ')', subtree_size: 2},
|
|
// CHECK:STDOUT: {kind: 'FunctionDefinitionStart', text: '{', subtree_size: 5},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperatorStar', text: '*', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'ExprStatement', text: ';', subtree_size: 4},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperatorCaret', text: '^', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'ExprStatement', text: ';', subtree_size: 4},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperatorGreaterEqual', text: '>=', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'ExprStatement', text: ';', subtree_size: 4},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperatorGreaterGreater', text: '>>', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'ExprStatement', text: ';', subtree_size: 4},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'IdentifierNameExpr', text: 'n'},
|
|
// CHECK:STDOUT: {kind: 'InfixOperatorSlash', text: '/', subtree_size: 3},
|
|
// CHECK:STDOUT: {kind: 'ExprStatement', text: ';', subtree_size: 4},
|
|
// CHECK:STDOUT: {kind: 'FunctionDefinition', text: '}', subtree_size: 26},
|
|
// CHECK:STDOUT: {kind: 'FileEnd', text: ''},
|
|
// CHECK:STDOUT: ]
|