mirror of
https://github.com/carbon-language/carbon-lang.git
synced 2026-09-24 22:02:23 +01:00
Implements parsing of struct patterns as per https://github.com/carbon-language/carbon-lang/issues/6680. This handles the full and short syntax given in the [design doc](https://github.com/carbon-language/carbon-lang/blob/trunk/docs/design/pattern_matching.md#struct-patterns), but the handling of the shorthand syntax may need to change as I move on to implementing Check support (currently the shorthand is represented as one of `LetBindingPattern`, `VarBindingPattern`, or `VariablePattern`). This implementation assumes that the answer to https://github.com/carbon-language/carbon-lang/issues/7404 is that trailing commas are allowed in the struct pattern, except for the case where an `_` is present, in which case the next token must be the closing brace `}`.
130 lines
4.6 KiB
C++
130 lines
4.6 KiB
C++
// 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
|
|
|
|
#include "toolchain/diagnostics/diagnostic.h"
|
|
#include "toolchain/lex/token_kind.h"
|
|
#include "toolchain/parse/context.h"
|
|
#include "toolchain/parse/handle.h"
|
|
#include "toolchain/parse/node_kind.h"
|
|
|
|
namespace Carbon::Parse {
|
|
|
|
auto HandleLet(Context& context) -> void {
|
|
auto state = context.PopState();
|
|
|
|
// These will start at the `let`.
|
|
context.PushState(state, StateKind::LetFinishAsRegular);
|
|
context.PushState(state, StateKind::LetAfterPatternAsRegular);
|
|
|
|
context.PushStateForPattern(StateKind::Pattern, /*in_var_pattern=*/false,
|
|
/*in_unused_pattern=*/false,
|
|
/*in_field_shorthand_pattern=*/false,
|
|
BindingContext::ExplicitParam,
|
|
PrecedenceGroup::ForTopLevelPattern());
|
|
}
|
|
|
|
auto HandleAssociatedConstant(Context& context) -> void {
|
|
auto state = context.PopState();
|
|
|
|
// Parse the associated constant pattern: identifier : type. The binding is a
|
|
// checked generic by context, so no phase keyword is used.
|
|
auto identifier = context.ConsumeIf(Lex::TokenKind::Identifier);
|
|
if (!identifier) {
|
|
auto kind = context.PositionKind();
|
|
if (kind == Lex::TokenKind::Generic || kind == Lex::TokenKind::Runtime ||
|
|
kind == Lex::TokenKind::Template) {
|
|
// Diagnose a phase keyword specifically, rather than reporting a missing
|
|
// associated constant name.
|
|
CARBON_DIAGNOSTIC(
|
|
PhaseKeywordInAssociatedConstant, Error,
|
|
"phase keyword is not allowed on an associated constant");
|
|
context.emitter().Emit(*context.position(),
|
|
PhaseKeywordInAssociatedConstant);
|
|
} else {
|
|
CARBON_DIAGNOSTIC(
|
|
ExpectedAssociatedConstantIdentifier, Error,
|
|
"expected identifier in associated constant declaration");
|
|
context.emitter().Emit(*context.position(),
|
|
ExpectedAssociatedConstantIdentifier);
|
|
}
|
|
state.has_error = true;
|
|
}
|
|
|
|
auto colon = context.ConsumeIf(Lex::TokenKind::Colon);
|
|
if (identifier && !colon) {
|
|
CARBON_DIAGNOSTIC(ExpectedAssociatedConstantColon, Error,
|
|
"expected `:` in associated constant declaration");
|
|
context.emitter().Emit(*context.position(),
|
|
ExpectedAssociatedConstantColon);
|
|
state.has_error = true;
|
|
}
|
|
|
|
if (!identifier || !colon) {
|
|
auto end_token = context.SkipPastLikelyEnd(*(context.position() - 1));
|
|
context.AddNode(NodeKind::AssociatedConstantDecl, end_token,
|
|
/*has_error=*/true);
|
|
state.has_error = true;
|
|
return;
|
|
}
|
|
|
|
context.AddLeafNode(NodeKind::IdentifierNameNotBeforeSignature, *identifier);
|
|
state.token = *colon;
|
|
context.PushState(state, StateKind::LetFinishAsAssociatedConstant);
|
|
context.PushState(state, StateKind::LetAfterPatternAsAssociatedConstant);
|
|
context.PushState(StateKind::Expr);
|
|
}
|
|
|
|
static auto HandleLetAfterPattern(Context& context, NodeKind init_kind)
|
|
-> void {
|
|
auto state = context.PopState();
|
|
|
|
if (state.has_error) {
|
|
if (auto after_pattern =
|
|
context.FindNextOf({Lex::TokenKind::Equal, Lex::TokenKind::Semi})) {
|
|
context.SkipTo(*after_pattern);
|
|
}
|
|
}
|
|
|
|
if (auto equals = context.ConsumeIf(Lex::TokenKind::Equal)) {
|
|
context.AddLeafNode(init_kind, *equals);
|
|
context.PushState(StateKind::Expr);
|
|
}
|
|
}
|
|
|
|
auto HandleLetAfterPatternAsRegular(Context& context) -> void {
|
|
HandleLetAfterPattern(context, NodeKind::LetInitializer);
|
|
}
|
|
|
|
auto HandleLetAfterPatternAsAssociatedConstant(Context& context) -> void {
|
|
auto state = context.PopState();
|
|
context.AddNode(NodeKind::AssociatedConstantNameAndType, state.token,
|
|
state.has_error);
|
|
context.PushState(state);
|
|
HandleLetAfterPattern(context, NodeKind::AssociatedConstantInitializer);
|
|
}
|
|
|
|
static auto HandleLetFinish(Context& context, NodeKind node_kind) -> void {
|
|
auto state = context.PopState();
|
|
|
|
auto end_token = state.token;
|
|
if (context.PositionIs(Lex::TokenKind::Semi)) {
|
|
end_token = context.Consume();
|
|
} else {
|
|
context.DiagnoseExpectedDeclSemi(Lex::TokenKind::Let);
|
|
state.has_error = true;
|
|
end_token = context.SkipPastLikelyEnd(state.token);
|
|
}
|
|
context.AddNode(node_kind, end_token, state.has_error);
|
|
}
|
|
|
|
auto HandleLetFinishAsRegular(Context& context) -> void {
|
|
HandleLetFinish(context, NodeKind::LetDecl);
|
|
}
|
|
|
|
auto HandleLetFinishAsAssociatedConstant(Context& context) -> void {
|
|
HandleLetFinish(context, NodeKind::AssociatedConstantDecl);
|
|
}
|
|
|
|
} // namespace Carbon::Parse
|