Lexer.cpp 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267
  1. /*
  2. * Copyright (c) 2020, Stephan Unverwerth <s.unverwerth@gmx.de>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include "Lexer.h"
  27. #include <AK/HashMap.h>
  28. #include <AK/StringBuilder.h>
  29. #include <ctype.h>
  30. #include <stdio.h>
  31. namespace JS {
  32. HashMap<String, TokenType> Lexer::s_keywords;
  33. HashMap<String, TokenType> Lexer::s_three_char_tokens;
  34. HashMap<String, TokenType> Lexer::s_two_char_tokens;
  35. HashMap<char, TokenType> Lexer::s_single_char_tokens;
  36. Lexer::Lexer(StringView source)
  37. : m_source(source)
  38. , m_current_token(TokenType::Eof, StringView(nullptr), StringView(nullptr))
  39. {
  40. if (s_keywords.is_empty()) {
  41. s_keywords.set("true", TokenType::BoolLiteral);
  42. s_keywords.set("false", TokenType::BoolLiteral);
  43. s_keywords.set("catch", TokenType::Catch);
  44. s_keywords.set("class", TokenType::Class);
  45. s_keywords.set("const", TokenType::Const);
  46. s_keywords.set("delete", TokenType::Delete);
  47. s_keywords.set("do", TokenType::Do);
  48. s_keywords.set("else", TokenType::Else);
  49. s_keywords.set("finally", TokenType::Finally);
  50. s_keywords.set("for", TokenType::For);
  51. s_keywords.set("function", TokenType::Function);
  52. s_keywords.set("if", TokenType::If);
  53. s_keywords.set("interface", TokenType::Interface);
  54. s_keywords.set("let", TokenType::Let);
  55. s_keywords.set("new", TokenType::New);
  56. s_keywords.set("null", TokenType::NullLiteral);
  57. s_keywords.set("return", TokenType::Return);
  58. s_keywords.set("try", TokenType::Try);
  59. s_keywords.set("var", TokenType::Var);
  60. s_keywords.set("while", TokenType::While);
  61. }
  62. if (s_three_char_tokens.is_empty()) {
  63. s_three_char_tokens.set("===", TokenType::EqualsEqualsEquals);
  64. s_three_char_tokens.set("!==", TokenType::ExclamationMarkEqualsEquals);
  65. }
  66. if (s_two_char_tokens.is_empty()) {
  67. s_two_char_tokens.set("+=", TokenType::PlusEquals);
  68. s_two_char_tokens.set("-=", TokenType::MinusEquals);
  69. s_two_char_tokens.set("*=", TokenType::AsteriskEquals);
  70. s_two_char_tokens.set("/=", TokenType::SlashEquals);
  71. s_two_char_tokens.set("%=", TokenType::PercentEquals);
  72. s_two_char_tokens.set("&=", TokenType::AmpersandEquals);
  73. s_two_char_tokens.set("|=", TokenType::PipeEquals);
  74. s_two_char_tokens.set("&&", TokenType::DoubleAmpersand);
  75. s_two_char_tokens.set("||", TokenType::DoublePipe);
  76. s_two_char_tokens.set("==", TokenType::EqualsEquals);
  77. s_two_char_tokens.set("!=", TokenType::ExclamationMarkEquals);
  78. s_two_char_tokens.set("--", TokenType::MinusMinus);
  79. s_two_char_tokens.set("++", TokenType::PlusPlus);
  80. s_two_char_tokens.set("<<", TokenType::ShiftLeft);
  81. s_two_char_tokens.set(">>", TokenType::ShiftRight);
  82. }
  83. if (s_single_char_tokens.is_empty()) {
  84. s_single_char_tokens.set('&', TokenType::Ampersand);
  85. s_single_char_tokens.set('*', TokenType::Asterisk);
  86. s_single_char_tokens.set('[', TokenType::BracketOpen);
  87. s_single_char_tokens.set(']', TokenType::BracketClose);
  88. s_single_char_tokens.set(',', TokenType::Comma);
  89. s_single_char_tokens.set('{', TokenType::CurlyOpen);
  90. s_single_char_tokens.set('}', TokenType::CurlyClose);
  91. s_single_char_tokens.set('=', TokenType::Equals);
  92. s_single_char_tokens.set('!', TokenType::ExclamationMark);
  93. s_single_char_tokens.set('-', TokenType::Minus);
  94. s_single_char_tokens.set('(', TokenType::ParenOpen);
  95. s_single_char_tokens.set(')', TokenType::ParenClose);
  96. s_single_char_tokens.set('%', TokenType::Percent);
  97. s_single_char_tokens.set('.', TokenType::Period);
  98. s_single_char_tokens.set('|', TokenType::Pipe);
  99. s_single_char_tokens.set('+', TokenType::Plus);
  100. s_single_char_tokens.set('?', TokenType::QuestionMark);
  101. s_single_char_tokens.set(';', TokenType::Semicolon);
  102. s_single_char_tokens.set('/', TokenType::Slash);
  103. s_single_char_tokens.set('<', TokenType::LessThan);
  104. s_single_char_tokens.set('>', TokenType::GreaterThan);
  105. }
  106. consume();
  107. }
  108. void Lexer::consume()
  109. {
  110. if (is_eof()) {
  111. m_current_char = EOF;
  112. return;
  113. }
  114. m_current_char = m_source[m_position++];
  115. }
  116. bool Lexer::is_eof() const
  117. {
  118. return m_position >= m_source.length();
  119. }
  120. bool Lexer::is_identifier_start() const
  121. {
  122. return isalpha(m_current_char) || m_current_char == '_' || m_current_char == '$';
  123. }
  124. bool Lexer::is_identifier_middle() const
  125. {
  126. return is_identifier_start() || isdigit(m_current_char);
  127. }
  128. bool Lexer::is_line_comment_start() const
  129. {
  130. return m_current_char == '/' && m_position < m_source.length() && m_source[m_position] == '/';
  131. }
  132. bool Lexer::is_block_comment_start() const
  133. {
  134. return m_current_char == '/' && m_position < m_source.length() && m_source[m_position] == '*';
  135. }
  136. bool Lexer::is_block_comment_end() const
  137. {
  138. return m_current_char == '*' && m_position < m_source.length() && m_source[m_position] == '/';
  139. }
  140. Token Lexer::next()
  141. {
  142. size_t trivia_start = m_position;
  143. // consume up whitespace and comments
  144. while (true) {
  145. if (isspace(m_current_char)) {
  146. do {
  147. consume();
  148. } while (!is_eof() && isspace(m_current_char));
  149. } else if (is_line_comment_start()) {
  150. consume();
  151. do {
  152. consume();
  153. } while (!is_eof() && m_current_char != '\n');
  154. } else if (is_block_comment_start()) {
  155. consume();
  156. do {
  157. consume();
  158. } while (!is_eof() && !is_block_comment_end());
  159. consume(); // consume *
  160. consume(); // consume /
  161. } else {
  162. break;
  163. }
  164. }
  165. size_t value_start = m_position;
  166. auto token_type = TokenType::Invalid;
  167. if (is_identifier_start()) {
  168. // identifier or keyword
  169. do {
  170. consume();
  171. } while (is_identifier_middle());
  172. StringView value = m_source.substring_view(value_start - 1, m_position - value_start);
  173. auto it = s_keywords.find(value);
  174. if (it == s_keywords.end()) {
  175. token_type = TokenType::Identifier;
  176. } else {
  177. token_type = it->value;
  178. }
  179. } else if (isdigit(m_current_char)) {
  180. consume();
  181. while (isdigit(m_current_char)) {
  182. consume();
  183. }
  184. token_type = TokenType::NumericLiteral;
  185. } else if (m_current_char == '"') {
  186. consume();
  187. while (m_current_char != '"') {
  188. consume();
  189. }
  190. consume();
  191. token_type = TokenType::StringLiteral;
  192. } else if (m_current_char == EOF) {
  193. token_type = TokenType::Eof;
  194. } else {
  195. bool found_three_char_token = false;
  196. if (m_position + 1 < m_source.length()) {
  197. char second_char = m_source[m_position];
  198. char third_char = m_source[m_position + 1];
  199. char three_chars[] { (char)m_current_char, second_char, third_char, 0 };
  200. auto it = s_three_char_tokens.find(three_chars);
  201. if (it != s_three_char_tokens.end()) {
  202. found_three_char_token = true;
  203. consume();
  204. consume();
  205. consume();
  206. token_type = it->value;
  207. }
  208. }
  209. bool found_two_char_token = false;
  210. if (!found_three_char_token && !is_eof()) {
  211. char second_char = m_source[m_position];
  212. char two_chars[] { (char)m_current_char, second_char, 0 };
  213. auto it = s_two_char_tokens.find(two_chars);
  214. if (it != s_two_char_tokens.end()) {
  215. found_two_char_token = true;
  216. consume();
  217. consume();
  218. token_type = it->value;
  219. }
  220. }
  221. bool found_one_char_token = false;
  222. if (!found_three_char_token && !found_two_char_token) {
  223. auto it = s_single_char_tokens.find(m_current_char);
  224. if (it != s_single_char_tokens.end()) {
  225. found_one_char_token = true;
  226. consume();
  227. token_type = it->value;
  228. }
  229. }
  230. if (!found_three_char_token && !found_two_char_token && !found_one_char_token) {
  231. consume();
  232. token_type = TokenType::Invalid;
  233. }
  234. }
  235. m_current_token = Token(
  236. token_type,
  237. m_source.substring_view(trivia_start - 1, value_start - trivia_start),
  238. m_source.substring_view(value_start - 1, m_position - value_start));
  239. return m_current_token;
  240. }
  241. }