Lexer.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325
  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("await", TokenType::Await);
  42. s_keywords.set("break", TokenType::Break);
  43. s_keywords.set("case", TokenType::Case);
  44. s_keywords.set("catch", TokenType::Catch);
  45. s_keywords.set("class", TokenType::Class);
  46. s_keywords.set("const", TokenType::Const);
  47. s_keywords.set("default", TokenType::Default);
  48. s_keywords.set("delete", TokenType::Delete);
  49. s_keywords.set("do", TokenType::Do);
  50. s_keywords.set("else", TokenType::Else);
  51. s_keywords.set("false", TokenType::BoolLiteral);
  52. s_keywords.set("finally", TokenType::Finally);
  53. s_keywords.set("for", TokenType::For);
  54. s_keywords.set("function", TokenType::Function);
  55. s_keywords.set("if", TokenType::If);
  56. s_keywords.set("in", TokenType::In);
  57. s_keywords.set("instanceof", TokenType::Instanceof);
  58. s_keywords.set("interface", TokenType::Interface);
  59. s_keywords.set("let", TokenType::Let);
  60. s_keywords.set("new", TokenType::New);
  61. s_keywords.set("null", TokenType::NullLiteral);
  62. s_keywords.set("return", TokenType::Return);
  63. s_keywords.set("switch", TokenType::Switch);
  64. s_keywords.set("throw", TokenType::Throw);
  65. s_keywords.set("true", TokenType::BoolLiteral);
  66. s_keywords.set("try", TokenType::Try);
  67. s_keywords.set("typeof", TokenType::Typeof);
  68. s_keywords.set("undefined", TokenType::UndefinedLiteral);
  69. s_keywords.set("var", TokenType::Var);
  70. s_keywords.set("void", TokenType::Void);
  71. s_keywords.set("while", TokenType::While);
  72. s_keywords.set("yield", TokenType::Yield);
  73. }
  74. if (s_three_char_tokens.is_empty()) {
  75. s_three_char_tokens.set("===", TokenType::EqualsEqualsEquals);
  76. s_three_char_tokens.set("!==", TokenType::ExclamationMarkEqualsEquals);
  77. s_three_char_tokens.set("**=", TokenType::AsteriskAsteriskEquals);
  78. s_three_char_tokens.set("<<=", TokenType::ShiftLeftEquals);
  79. s_three_char_tokens.set(">>=", TokenType::ShiftRightEquals);
  80. s_three_char_tokens.set(">>>", TokenType::UnsignedShiftRight);
  81. }
  82. if (s_two_char_tokens.is_empty()) {
  83. s_two_char_tokens.set("=>", TokenType::Arrow);
  84. s_two_char_tokens.set("+=", TokenType::PlusEquals);
  85. s_two_char_tokens.set("-=", TokenType::MinusEquals);
  86. s_two_char_tokens.set("*=", TokenType::AsteriskEquals);
  87. s_two_char_tokens.set("/=", TokenType::SlashEquals);
  88. s_two_char_tokens.set("%=", TokenType::PercentEquals);
  89. s_two_char_tokens.set("&=", TokenType::AmpersandEquals);
  90. s_two_char_tokens.set("|=", TokenType::PipeEquals);
  91. s_two_char_tokens.set("&&", TokenType::DoubleAmpersand);
  92. s_two_char_tokens.set("||", TokenType::DoublePipe);
  93. s_two_char_tokens.set("??", TokenType::DoubleQuestionMark);
  94. s_two_char_tokens.set("**", TokenType::DoubleAsterisk);
  95. s_two_char_tokens.set("==", TokenType::EqualsEquals);
  96. s_two_char_tokens.set("<=", TokenType::LessThanEquals);
  97. s_two_char_tokens.set(">=", TokenType::GreaterThanEquals);
  98. s_two_char_tokens.set("!=", TokenType::ExclamationMarkEquals);
  99. s_two_char_tokens.set("--", TokenType::MinusMinus);
  100. s_two_char_tokens.set("++", TokenType::PlusPlus);
  101. s_two_char_tokens.set("<<", TokenType::ShiftLeft);
  102. s_two_char_tokens.set(">>", TokenType::ShiftRight);
  103. s_two_char_tokens.set("?.", TokenType::QuestionMarkPeriod);
  104. }
  105. if (s_single_char_tokens.is_empty()) {
  106. s_single_char_tokens.set('&', TokenType::Ampersand);
  107. s_single_char_tokens.set('*', TokenType::Asterisk);
  108. s_single_char_tokens.set('[', TokenType::BracketOpen);
  109. s_single_char_tokens.set(']', TokenType::BracketClose);
  110. s_single_char_tokens.set('^', TokenType::Caret);
  111. s_single_char_tokens.set(':', TokenType::Colon);
  112. s_single_char_tokens.set(',', TokenType::Comma);
  113. s_single_char_tokens.set('{', TokenType::CurlyOpen);
  114. s_single_char_tokens.set('}', TokenType::CurlyClose);
  115. s_single_char_tokens.set('=', TokenType::Equals);
  116. s_single_char_tokens.set('!', TokenType::ExclamationMark);
  117. s_single_char_tokens.set('-', TokenType::Minus);
  118. s_single_char_tokens.set('(', TokenType::ParenOpen);
  119. s_single_char_tokens.set(')', TokenType::ParenClose);
  120. s_single_char_tokens.set('%', TokenType::Percent);
  121. s_single_char_tokens.set('.', TokenType::Period);
  122. s_single_char_tokens.set('|', TokenType::Pipe);
  123. s_single_char_tokens.set('+', TokenType::Plus);
  124. s_single_char_tokens.set('?', TokenType::QuestionMark);
  125. s_single_char_tokens.set(';', TokenType::Semicolon);
  126. s_single_char_tokens.set('/', TokenType::Slash);
  127. s_single_char_tokens.set('~', TokenType::Tilde);
  128. s_single_char_tokens.set('<', TokenType::LessThan);
  129. s_single_char_tokens.set('>', TokenType::GreaterThan);
  130. }
  131. consume();
  132. }
  133. void Lexer::consume()
  134. {
  135. if (m_position >= m_source.length()) {
  136. m_position = m_source.length() + 1;
  137. m_current_char = EOF;
  138. return;
  139. }
  140. m_current_char = m_source[m_position++];
  141. }
  142. bool Lexer::is_eof() const
  143. {
  144. return m_current_char == EOF;
  145. }
  146. bool Lexer::is_identifier_start() const
  147. {
  148. return isalpha(m_current_char) || m_current_char == '_' || m_current_char == '$';
  149. }
  150. bool Lexer::is_identifier_middle() const
  151. {
  152. return is_identifier_start() || isdigit(m_current_char);
  153. }
  154. bool Lexer::is_line_comment_start() const
  155. {
  156. return m_current_char == '/' && m_position < m_source.length() && m_source[m_position] == '/';
  157. }
  158. bool Lexer::is_block_comment_start() const
  159. {
  160. return m_current_char == '/' && m_position < m_source.length() && m_source[m_position] == '*';
  161. }
  162. bool Lexer::is_block_comment_end() const
  163. {
  164. return m_current_char == '*' && m_position < m_source.length() && m_source[m_position] == '/';
  165. }
  166. void Lexer::syntax_error(const char* msg)
  167. {
  168. m_has_errors = true;
  169. fprintf(stderr, "Syntax Error: %s\n", msg);
  170. }
  171. Token Lexer::next()
  172. {
  173. size_t trivia_start = m_position;
  174. // consume whitespace and comments
  175. while (true) {
  176. if (isspace(m_current_char)) {
  177. do {
  178. consume();
  179. } while (isspace(m_current_char));
  180. } else if (is_line_comment_start()) {
  181. consume();
  182. do {
  183. consume();
  184. } while (!is_eof() && m_current_char != '\n');
  185. } else if (is_block_comment_start()) {
  186. consume();
  187. do {
  188. consume();
  189. } while (!is_eof() && !is_block_comment_end());
  190. consume(); // consume *
  191. consume(); // consume /
  192. } else {
  193. break;
  194. }
  195. }
  196. size_t value_start = m_position;
  197. auto token_type = TokenType::Invalid;
  198. if (is_identifier_start()) {
  199. // identifier or keyword
  200. do {
  201. consume();
  202. } while (is_identifier_middle());
  203. StringView value = m_source.substring_view(value_start - 1, m_position - value_start);
  204. auto it = s_keywords.find(value);
  205. if (it == s_keywords.end()) {
  206. token_type = TokenType::Identifier;
  207. } else {
  208. token_type = it->value;
  209. }
  210. } else if (isdigit(m_current_char)) {
  211. consume();
  212. while (isdigit(m_current_char)) {
  213. consume();
  214. }
  215. token_type = TokenType::NumericLiteral;
  216. } else if (m_current_char == '"' || m_current_char == '\'') {
  217. char stop_char = m_current_char;
  218. consume();
  219. while (m_current_char != stop_char && m_current_char != '\n' && !is_eof()) {
  220. if (m_current_char == '\\') {
  221. consume();
  222. }
  223. consume();
  224. }
  225. if (m_current_char != stop_char) {
  226. syntax_error("unterminated string literal");
  227. token_type = TokenType::UnterminatedStringLiteral;
  228. } else {
  229. consume();
  230. token_type = TokenType::StringLiteral;
  231. }
  232. } else if (m_current_char == EOF) {
  233. token_type = TokenType::Eof;
  234. } else {
  235. // There is only one four-char operator: >>>=
  236. bool found_four_char_token = false;
  237. if (m_position + 2 < m_source.length()) {
  238. if (m_current_char == '>'
  239. && m_source[m_position] == '>'
  240. && m_source[m_position + 1] == '>'
  241. && m_source[m_position + 2] == '=') {
  242. found_four_char_token = true;
  243. consume();
  244. consume();
  245. consume();
  246. consume();
  247. token_type = TokenType::UnsignedShiftRightEquals;
  248. }
  249. }
  250. bool found_three_char_token = false;
  251. if (!found_four_char_token && m_position + 1 < m_source.length()) {
  252. char second_char = m_source[m_position];
  253. char third_char = m_source[m_position + 1];
  254. char three_chars[] { (char)m_current_char, second_char, third_char, 0 };
  255. auto it = s_three_char_tokens.find(three_chars);
  256. if (it != s_three_char_tokens.end()) {
  257. found_three_char_token = true;
  258. consume();
  259. consume();
  260. consume();
  261. token_type = it->value;
  262. }
  263. }
  264. bool found_two_char_token = false;
  265. if (!found_four_char_token && !found_three_char_token && m_position < m_source.length()) {
  266. char second_char = m_source[m_position];
  267. char two_chars[] { (char)m_current_char, second_char, 0 };
  268. auto it = s_two_char_tokens.find(two_chars);
  269. if (it != s_two_char_tokens.end()) {
  270. found_two_char_token = true;
  271. consume();
  272. consume();
  273. token_type = it->value;
  274. }
  275. }
  276. bool found_one_char_token = false;
  277. if (!found_four_char_token && !found_three_char_token && !found_two_char_token) {
  278. auto it = s_single_char_tokens.find(m_current_char);
  279. if (it != s_single_char_tokens.end()) {
  280. found_one_char_token = true;
  281. consume();
  282. token_type = it->value;
  283. }
  284. }
  285. if (!found_four_char_token && !found_three_char_token && !found_two_char_token && !found_one_char_token) {
  286. consume();
  287. token_type = TokenType::Invalid;
  288. }
  289. }
  290. m_current_token = Token(
  291. token_type,
  292. m_source.substring_view(trivia_start - 1, value_start - trivia_start),
  293. m_source.substring_view(value_start - 1, m_position - value_start));
  294. return m_current_token;
  295. }
  296. }