precedence_test.cpp 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158
  1. // Part of the Carbon Language project, under the Apache License v2.0 with LLVM
  2. // Exceptions. See /LICENSE for license information.
  3. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  4. #include "toolchain/parse/precedence.h"
  5. #include <gmock/gmock.h>
  6. #include <gtest/gtest.h>
  7. #include "toolchain/lex/token_kind.h"
  8. namespace Carbon::Parse {
  9. namespace {
  10. using ::testing::Eq;
  11. TEST(PrecedenceTest, OperatorsAreRecognized) {
  12. EXPECT_TRUE(PrecedenceGroup::ForLeading(Lex::TokenKind::Minus).has_value());
  13. EXPECT_TRUE(PrecedenceGroup::ForLeading(Lex::TokenKind::Caret).has_value());
  14. EXPECT_FALSE(PrecedenceGroup::ForLeading(Lex::TokenKind::Slash).has_value());
  15. EXPECT_FALSE(
  16. PrecedenceGroup::ForLeading(Lex::TokenKind::Identifier).has_value());
  17. EXPECT_FALSE(PrecedenceGroup::ForLeading(Lex::TokenKind::Tilde).has_value());
  18. EXPECT_TRUE(
  19. PrecedenceGroup::ForTrailing(Lex::TokenKind::Minus, false).has_value());
  20. EXPECT_TRUE(
  21. PrecedenceGroup::ForTrailing(Lex::TokenKind::Caret, false).has_value());
  22. EXPECT_FALSE(
  23. PrecedenceGroup::ForTrailing(Lex::TokenKind::Tilde, false).has_value());
  24. EXPECT_TRUE(
  25. PrecedenceGroup::ForTrailing(Lex::TokenKind::Slash, true).has_value());
  26. EXPECT_FALSE(PrecedenceGroup::ForTrailing(Lex::TokenKind::Identifier, false)
  27. .has_value());
  28. EXPECT_TRUE(
  29. PrecedenceGroup::ForTrailing(Lex::TokenKind::Minus, true)->is_binary);
  30. EXPECT_FALSE(PrecedenceGroup::ForTrailing(Lex::TokenKind::MinusMinus, false)
  31. .has_value());
  32. }
  33. TEST(PrecedenceTest, InfixVsPostfix) {
  34. // A trailing `-` is always binary, even when written with whitespace that
  35. // suggests it's postfix.
  36. EXPECT_TRUE(
  37. PrecedenceGroup::ForTrailing(Lex::TokenKind::Minus, /*infix*/ false)
  38. ->is_binary);
  39. // A trailing `*` is interpreted based on context.
  40. EXPECT_TRUE(
  41. PrecedenceGroup::ForTrailing(Lex::TokenKind::Star, true)->is_binary);
  42. EXPECT_FALSE(
  43. PrecedenceGroup::ForTrailing(Lex::TokenKind::Star, false)->is_binary);
  44. // Infix `*` can appear in `+` contexts; postfix `*` cannot.
  45. EXPECT_THAT(
  46. PrecedenceGroup::GetPriority(
  47. PrecedenceGroup::ForTrailing(Lex::TokenKind::Star, true)->level,
  48. PrecedenceGroup::ForTrailing(Lex::TokenKind::Plus, true)->level),
  49. Eq(OperatorPriority::LeftFirst));
  50. EXPECT_THAT(
  51. PrecedenceGroup::GetPriority(
  52. PrecedenceGroup::ForTrailing(Lex::TokenKind::Star, false)->level,
  53. PrecedenceGroup::ForTrailing(Lex::TokenKind::Plus, true)->level),
  54. Eq(OperatorPriority::Ambiguous));
  55. }
  56. TEST(PrecedenceTest, Associativity) {
  57. EXPECT_THAT(
  58. PrecedenceGroup::ForLeading(Lex::TokenKind::Minus)->GetAssociativity(),
  59. Eq(Associativity::None));
  60. EXPECT_THAT(
  61. PrecedenceGroup::ForLeading(Lex::TokenKind::Star)->GetAssociativity(),
  62. Eq(Associativity::RightToLeft));
  63. EXPECT_THAT(PrecedenceGroup::ForTrailing(Lex::TokenKind::Plus, true)
  64. ->level.GetAssociativity(),
  65. Eq(Associativity::LeftToRight));
  66. EXPECT_THAT(PrecedenceGroup::ForTrailing(Lex::TokenKind::Equal, true)
  67. ->level.GetAssociativity(),
  68. Eq(Associativity::None));
  69. }
  70. TEST(PrecedenceTest, DirectRelations) {
  71. EXPECT_THAT(
  72. PrecedenceGroup::GetPriority(
  73. PrecedenceGroup::ForTrailing(Lex::TokenKind::Star, true)->level,
  74. PrecedenceGroup::ForTrailing(Lex::TokenKind::Plus, true)->level),
  75. Eq(OperatorPriority::LeftFirst));
  76. EXPECT_THAT(
  77. PrecedenceGroup::GetPriority(
  78. PrecedenceGroup::ForTrailing(Lex::TokenKind::Plus, true)->level,
  79. PrecedenceGroup::ForTrailing(Lex::TokenKind::Star, true)->level),
  80. Eq(OperatorPriority::RightFirst));
  81. EXPECT_THAT(
  82. PrecedenceGroup::GetPriority(
  83. PrecedenceGroup::ForTrailing(Lex::TokenKind::Amp, true)->level,
  84. PrecedenceGroup::ForTrailing(Lex::TokenKind::Less, true)->level),
  85. Eq(OperatorPriority::LeftFirst));
  86. EXPECT_THAT(
  87. PrecedenceGroup::GetPriority(
  88. PrecedenceGroup::ForTrailing(Lex::TokenKind::Less, true)->level,
  89. PrecedenceGroup::ForTrailing(Lex::TokenKind::Amp, true)->level),
  90. Eq(OperatorPriority::RightFirst));
  91. }
  92. TEST(PrecedenceTest, IndirectRelations) {
  93. EXPECT_THAT(
  94. PrecedenceGroup::GetPriority(
  95. PrecedenceGroup::ForTrailing(Lex::TokenKind::Star, true)->level,
  96. PrecedenceGroup::ForTrailing(Lex::TokenKind::Or, true)->level),
  97. Eq(OperatorPriority::LeftFirst));
  98. EXPECT_THAT(
  99. PrecedenceGroup::GetPriority(
  100. PrecedenceGroup::ForTrailing(Lex::TokenKind::Or, true)->level,
  101. PrecedenceGroup::ForTrailing(Lex::TokenKind::Star, true)->level),
  102. Eq(OperatorPriority::RightFirst));
  103. EXPECT_THAT(
  104. PrecedenceGroup::GetPriority(
  105. *PrecedenceGroup::ForLeading(Lex::TokenKind::Caret),
  106. PrecedenceGroup::ForTrailing(Lex::TokenKind::Equal, true)->level),
  107. Eq(OperatorPriority::LeftFirst));
  108. EXPECT_THAT(
  109. PrecedenceGroup::GetPriority(
  110. PrecedenceGroup::ForTrailing(Lex::TokenKind::Equal, true)->level,
  111. *PrecedenceGroup::ForLeading(Lex::TokenKind::Caret)),
  112. Eq(OperatorPriority::RightFirst));
  113. }
  114. TEST(PrecedenceTest, IncomparableOperators) {
  115. EXPECT_THAT(PrecedenceGroup::GetPriority(
  116. *PrecedenceGroup::ForLeading(Lex::TokenKind::Caret),
  117. *PrecedenceGroup::ForLeading(Lex::TokenKind::Not)),
  118. Eq(OperatorPriority::Ambiguous));
  119. EXPECT_THAT(PrecedenceGroup::GetPriority(
  120. *PrecedenceGroup::ForLeading(Lex::TokenKind::Caret),
  121. *PrecedenceGroup::ForLeading(Lex::TokenKind::Minus)),
  122. Eq(OperatorPriority::Ambiguous));
  123. EXPECT_THAT(
  124. PrecedenceGroup::GetPriority(
  125. *PrecedenceGroup::ForLeading(Lex::TokenKind::Not),
  126. PrecedenceGroup::ForTrailing(Lex::TokenKind::Amp, true)->level),
  127. Eq(OperatorPriority::Ambiguous));
  128. EXPECT_THAT(
  129. PrecedenceGroup::GetPriority(
  130. PrecedenceGroup::ForTrailing(Lex::TokenKind::Equal, true)->level,
  131. PrecedenceGroup::ForTrailing(Lex::TokenKind::PipeEqual, true)->level),
  132. Eq(OperatorPriority::Ambiguous));
  133. EXPECT_THAT(
  134. PrecedenceGroup::GetPriority(
  135. PrecedenceGroup::ForTrailing(Lex::TokenKind::Plus, true)->level,
  136. PrecedenceGroup::ForTrailing(Lex::TokenKind::Amp, true)->level),
  137. Eq(OperatorPriority::Ambiguous));
  138. }
  139. } // namespace
  140. } // namespace Carbon::Parse