token_kind_test.cpp 4.8 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394
  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/lexer/token_kind.h"
  5. #include <gmock/gmock.h>
  6. #include <gtest/gtest.h>
  7. #include <cstring>
  8. #include "llvm/ADT/StringRef.h"
  9. namespace Carbon {
  10. namespace {
  11. using ::testing::MatchesRegex;
  12. // We restrict symbols to punctuation characters that are expected to be widely
  13. // available on modern keyboards used for programming.
  14. constexpr llvm::StringLiteral SymbolRegex = "[][{}!@#%^&*()/?\\|;:.,<>=+~-]+";
  15. // We restrict keywords to be lowercase ASCII letters and underscores.
  16. constexpr llvm::StringLiteral KeywordRegex = "[a-z_]+";
  17. #define CARBON_TOKEN(TokenName) \
  18. TEST(TokenKindTest, TokenName) { \
  19. EXPECT_EQ(#TokenName, TokenKind::TokenName().Name()); \
  20. EXPECT_FALSE(TokenKind::TokenName().IsSymbol()); \
  21. EXPECT_FALSE(TokenKind::TokenName().IsKeyword()); \
  22. EXPECT_EQ("", TokenKind::TokenName().GetFixedSpelling()); \
  23. }
  24. #define CARBON_SYMBOL_TOKEN(TokenName, Spelling) \
  25. TEST(TokenKindTest, TokenName) { \
  26. EXPECT_EQ(#TokenName, TokenKind::TokenName().Name()); \
  27. EXPECT_TRUE(TokenKind::TokenName().IsSymbol()); \
  28. EXPECT_FALSE(TokenKind::TokenName().IsGroupingSymbol()); \
  29. EXPECT_FALSE(TokenKind::TokenName().IsOpeningSymbol()); \
  30. EXPECT_FALSE(TokenKind::TokenName().IsClosingSymbol()); \
  31. EXPECT_FALSE(TokenKind::TokenName().IsKeyword()); \
  32. EXPECT_EQ(Spelling, TokenKind::TokenName().GetFixedSpelling()); \
  33. EXPECT_THAT(Spelling, MatchesRegex(SymbolRegex.str())); \
  34. }
  35. #define CARBON_OPENING_GROUP_SYMBOL_TOKEN(TokenName, Spelling, ClosingName) \
  36. TEST(TokenKindTest, TokenName) { \
  37. EXPECT_EQ(#TokenName, TokenKind::TokenName().Name()); \
  38. EXPECT_TRUE(TokenKind::TokenName().IsSymbol()); \
  39. EXPECT_TRUE(TokenKind::TokenName().IsGroupingSymbol()); \
  40. EXPECT_TRUE(TokenKind::TokenName().IsOpeningSymbol()); \
  41. EXPECT_EQ(TokenKind::ClosingName(), \
  42. TokenKind::TokenName().GetClosingSymbol()); \
  43. EXPECT_FALSE(TokenKind::TokenName().IsClosingSymbol()); \
  44. EXPECT_FALSE(TokenKind::TokenName().IsKeyword()); \
  45. EXPECT_EQ(Spelling, TokenKind::TokenName().GetFixedSpelling()); \
  46. EXPECT_THAT(Spelling, MatchesRegex(SymbolRegex.str())); \
  47. }
  48. #define CARBON_CLOSING_GROUP_SYMBOL_TOKEN(TokenName, Spelling, OpeningName) \
  49. TEST(TokenKindTest, TokenName) { \
  50. EXPECT_EQ(#TokenName, TokenKind::TokenName().Name()); \
  51. EXPECT_TRUE(TokenKind::TokenName().IsSymbol()); \
  52. EXPECT_TRUE(TokenKind::TokenName().IsGroupingSymbol()); \
  53. EXPECT_FALSE(TokenKind::TokenName().IsOpeningSymbol()); \
  54. EXPECT_TRUE(TokenKind::TokenName().IsClosingSymbol()); \
  55. EXPECT_EQ(TokenKind::OpeningName(), \
  56. TokenKind::TokenName().GetOpeningSymbol()); \
  57. EXPECT_FALSE(TokenKind::TokenName().IsKeyword()); \
  58. EXPECT_EQ(Spelling, TokenKind::TokenName().GetFixedSpelling()); \
  59. EXPECT_THAT(Spelling, MatchesRegex(SymbolRegex.str())); \
  60. }
  61. #define CARBON_KEYWORD_TOKEN(TokenName, Spelling) \
  62. TEST(TokenKindTest, TokenName) { \
  63. EXPECT_EQ(#TokenName, TokenKind::TokenName().Name()); \
  64. EXPECT_FALSE(TokenKind::TokenName().IsSymbol()); \
  65. EXPECT_TRUE(TokenKind::TokenName().IsKeyword()); \
  66. EXPECT_EQ(Spelling, TokenKind::TokenName().GetFixedSpelling()); \
  67. EXPECT_THAT(Spelling, MatchesRegex(KeywordRegex.str())); \
  68. }
  69. #include "toolchain/lexer/token_registry.def"
  70. // Verify that the symbol tokens are sorted from longest to shortest. This is
  71. // important to ensure that simply in-order testing will identify tokens
  72. // following the max-munch rule.
  73. TEST(TokenKindTest, SymbolsInDescendingLength) {
  74. int previous_length = INT_MAX;
  75. #define CARBON_SYMBOL_TOKEN(TokenName, Spelling) \
  76. EXPECT_LE(llvm::StringRef(Spelling).size(), previous_length) \
  77. << "Symbol token not in descending length order: " << #TokenName; \
  78. previous_length = llvm::StringRef(Spelling).size();
  79. #include "toolchain/lexer/token_registry.def"
  80. EXPECT_GT(previous_length, 0);
  81. }
  82. } // namespace
  83. } // namespace Carbon