| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248 |
- // 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/parse/context.h"
- #include "toolchain/parse/handle.h"
- namespace Carbon::Parse {
- // TODO: Some handling is producing erroneous nodes, but wasn't diagnosing and
- // needed to. A more specific diagnostic could be added, but we should probably
- // have a larger look at this code and how it produces parse errors. This may be
- // good to re-examine when someone is working on implementing match checking.
- static auto DiagnoseMatchParseTODO(Context& context) -> void {
- CARBON_DIAGNOSTIC(MatchParseTODO, Error, "TODO: improve match parsing");
- context.emitter().Emit(*context.position(), MatchParseTODO);
- }
- static auto HandleStatementsBlockStart(Context& context, State finish,
- NodeKind equal_greater, NodeKind starter,
- NodeKind complete) -> void {
- auto state = context.PopState();
- if (!context.PositionIs(Lex::TokenKind::EqualGreater)) {
- if (!state.has_error) {
- CARBON_DIAGNOSTIC(ExpectedMatchCaseArrow, Error,
- "expected `=>` introducing statement block");
- context.emitter().Emit(*context.position(), ExpectedMatchCaseArrow);
- }
- context.AddLeafNode(equal_greater, *context.position(), /*has_error=*/true);
- context.AddNode(starter, *context.position(), /*has_error=*/true);
- context.AddNode(complete, *context.position(), /*has_error=*/true);
- context.SkipPastLikelyEnd(*context.position());
- return;
- }
- context.AddLeafNode(equal_greater, context.Consume());
- if (!context.PositionIs(Lex::TokenKind::OpenCurlyBrace)) {
- if (!state.has_error) {
- CARBON_DIAGNOSTIC(ExpectedMatchCaseBlock, Error,
- "expected `{{` after `=>`");
- context.emitter().Emit(*context.position(), ExpectedMatchCaseBlock);
- }
- context.AddNode(starter, *context.position(), /*has_error=*/true);
- context.AddNode(complete, *context.position(), /*has_error=*/true);
- context.SkipPastLikelyEnd(*context.position());
- return;
- }
- context.AddNode(starter, context.Consume(), state.has_error);
- context.PushState(state, finish);
- context.PushState(State::StatementScopeLoop);
- }
- static auto EmitUnexpectedTokenAndRecover(Context& context) -> void {
- CARBON_DIAGNOSTIC(UnexpectedTokenInMatchCasesBlock, Error,
- "unexpected `{0}`; expected `case`, `default` or `}`",
- Lex::TokenKind);
- context.emitter().Emit(*context.position(), UnexpectedTokenInMatchCasesBlock,
- context.PositionKind());
- context.ReturnErrorOnState();
- context.SkipPastLikelyEnd(*context.position());
- }
- auto HandleMatchIntroducer(Context& context) -> void {
- auto state = context.PopState();
- context.AddLeafNode(NodeKind::Placeholder, *context.position());
- context.PushState(state, State::MatchConditionFinish);
- context.PushState(State::ParenConditionAsMatch);
- context.ConsumeAndDiscard();
- }
- auto HandleMatchConditionFinish(Context& context) -> void {
- auto state = context.PopState();
- context.ReplacePlaceholderNode(state.subtree_start, NodeKind::MatchIntroducer,
- state.token);
- if (!context.PositionIs(Lex::TokenKind::OpenCurlyBrace)) {
- if (!state.has_error) {
- CARBON_DIAGNOSTIC(ExpectedMatchCasesBlock, Error,
- "expected `{{` starting block with cases");
- context.emitter().Emit(*context.position(), ExpectedMatchCasesBlock);
- }
- context.AddNode(NodeKind::MatchStatementStart, *context.position(),
- /*has_error=*/true);
- context.AddNode(NodeKind::MatchStatement, *context.position(),
- /*has_error=*/true);
- context.SkipPastLikelyEnd(*context.position());
- return;
- }
- context.AddNode(NodeKind::MatchStatementStart, context.Consume(),
- state.has_error);
- state.has_error = false;
- if (context.PositionIs(Lex::TokenKind::CloseCurlyBrace)) {
- CARBON_DIAGNOSTIC(ExpectedMatchCases, Error, "expected cases");
- context.emitter().Emit(*context.position(), ExpectedMatchCases);
- state.has_error = true;
- }
- context.PushState(state, State::MatchStatementFinish);
- context.PushState(State::MatchCaseLoop);
- }
- auto HandleMatchCaseLoop(Context& context) -> void {
- context.PopAndDiscardState();
- if (context.PositionIs(Lex::TokenKind::Case)) {
- context.PushState(State::MatchCaseLoop);
- context.PushState(State::MatchCaseIntroducer);
- } else if (context.PositionIs(Lex::TokenKind::Default)) {
- context.PushState(State::MatchCaseLoopAfterDefault);
- context.PushState(State::MatchDefaultIntroducer);
- } else if (!context.PositionIs(Lex::TokenKind::CloseCurlyBrace)) {
- EmitUnexpectedTokenAndRecover(context);
- context.PushState(State::MatchCaseLoop);
- }
- }
- auto HandleMatchCaseLoopAfterDefault(Context& context) -> void {
- context.PopAndDiscardState();
- Lex::TokenKind kind = context.PositionKind();
- if (kind == Lex::TokenKind::Case or kind == Lex::TokenKind::Default) {
- CARBON_DIAGNOSTIC(UnreachableMatchCase, Error,
- "unreachable case; `{0}` occurs after the `default`",
- Lex::TokenKind);
- context.emitter().Emit(*context.position(), UnreachableMatchCase, kind);
- context.ReturnErrorOnState();
- context.PushState(State::MatchCaseLoopAfterDefault);
- context.SkipPastLikelyEnd(*context.position());
- return;
- } else if (kind != Lex::TokenKind::CloseCurlyBrace) {
- EmitUnexpectedTokenAndRecover(context);
- context.PushState(State::MatchCaseLoopAfterDefault);
- }
- }
- auto HandleMatchCaseIntroducer(Context& context) -> void {
- auto state = context.PopState();
- context.AddLeafNode(NodeKind::MatchCaseIntroducer, context.Consume());
- context.PushState(state, State::MatchCaseAfterPattern);
- context.PushState(State::Pattern);
- }
- auto HandleMatchCaseAfterPattern(Context& context) -> void {
- auto state = context.PopState();
- if (state.has_error) {
- context.AddNode(NodeKind::MatchCaseStart, *context.position(),
- /*has_error=*/true);
- context.AddNode(NodeKind::MatchCase, *context.position(),
- /*has_error=*/true);
- context.SkipPastLikelyEnd(*context.position());
- return;
- }
- context.PushState(state, State::MatchCaseStart);
- if (context.PositionIs(Lex::TokenKind::If)) {
- context.PushState(State::MatchCaseGuardFinish);
- context.AddLeafNode(NodeKind::MatchCaseGuardIntroducer, context.Consume());
- auto open_paren = context.ConsumeIf(Lex::TokenKind::OpenParen);
- if (open_paren) {
- context.AddLeafNode(NodeKind::MatchCaseGuardStart, *open_paren);
- context.PushState(State::Expr);
- } else {
- if (!state.has_error) {
- DiagnoseMatchParseTODO(context);
- }
- context.AddLeafNode(NodeKind::MatchCaseGuardStart, *context.position(),
- true);
- context.AddInvalidParse(*context.position());
- state = context.PopState();
- context.AddNode(NodeKind::MatchCaseGuard, *context.position(),
- /*has_error=*/true);
- state = context.PopState();
- context.AddNode(NodeKind::MatchCaseStart, *context.position(),
- /*has_error=*/true);
- context.AddNode(NodeKind::MatchCase, *context.position(),
- /*has_error=*/true);
- context.SkipPastLikelyEnd(*context.position());
- return;
- }
- }
- }
- auto HandleMatchCaseGuardFinish(Context& context) -> void {
- auto state = context.PopState();
- auto close_paren = context.ConsumeIf(Lex::TokenKind::CloseParen);
- if (close_paren) {
- context.AddNode(NodeKind::MatchCaseGuard, *close_paren, state.has_error);
- } else {
- if (!state.has_error) {
- DiagnoseMatchParseTODO(context);
- }
- context.AddNode(NodeKind::MatchCaseGuard, *context.position(),
- /*has_error=*/true);
- context.ReturnErrorOnState();
- context.SkipPastLikelyEnd(*context.position());
- return;
- }
- }
- auto HandleMatchCaseStart(Context& context) -> void {
- HandleStatementsBlockStart(context, State::MatchCaseFinish,
- NodeKind::MatchCaseEqualGreater,
- NodeKind::MatchCaseStart, NodeKind::MatchCase);
- }
- auto HandleMatchCaseFinish(Context& context) -> void {
- auto state = context.PopState();
- context.AddNode(NodeKind::MatchCase,
- context.ConsumeChecked(Lex::TokenKind::CloseCurlyBrace),
- state.has_error);
- }
- auto HandleMatchDefaultIntroducer(Context& context) -> void {
- context.AddLeafNode(NodeKind::MatchDefaultIntroducer, context.Consume());
- HandleStatementsBlockStart(
- context, State::MatchDefaultFinish, NodeKind::MatchDefaultEqualGreater,
- NodeKind::MatchDefaultStart, NodeKind::MatchDefault);
- }
- auto HandleMatchDefaultFinish(Context& context) -> void {
- auto state = context.PopState();
- context.AddNode(NodeKind::MatchDefault,
- context.ConsumeChecked(Lex::TokenKind::CloseCurlyBrace),
- state.has_error);
- }
- auto HandleMatchStatementFinish(Context& context) -> void {
- auto state = context.PopState();
- context.AddNode(NodeKind::MatchStatement,
- context.ConsumeChecked(Lex::TokenKind::CloseCurlyBrace),
- state.has_error);
- }
- } // namespace Carbon::Parse
|