Lexer.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426
  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), 0, 0)
  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("continue", TokenType::Continue);
  48. s_keywords.set("default", TokenType::Default);
  49. s_keywords.set("delete", TokenType::Delete);
  50. s_keywords.set("do", TokenType::Do);
  51. s_keywords.set("else", TokenType::Else);
  52. s_keywords.set("false", TokenType::BoolLiteral);
  53. s_keywords.set("finally", TokenType::Finally);
  54. s_keywords.set("for", TokenType::For);
  55. s_keywords.set("function", TokenType::Function);
  56. s_keywords.set("if", TokenType::If);
  57. s_keywords.set("in", TokenType::In);
  58. s_keywords.set("instanceof", TokenType::Instanceof);
  59. s_keywords.set("interface", TokenType::Interface);
  60. s_keywords.set("let", TokenType::Let);
  61. s_keywords.set("new", TokenType::New);
  62. s_keywords.set("null", TokenType::NullLiteral);
  63. s_keywords.set("return", TokenType::Return);
  64. s_keywords.set("switch", TokenType::Switch);
  65. s_keywords.set("this", TokenType::This);
  66. s_keywords.set("throw", TokenType::Throw);
  67. s_keywords.set("true", TokenType::BoolLiteral);
  68. s_keywords.set("try", TokenType::Try);
  69. s_keywords.set("typeof", TokenType::Typeof);
  70. s_keywords.set("var", TokenType::Var);
  71. s_keywords.set("void", TokenType::Void);
  72. s_keywords.set("while", TokenType::While);
  73. s_keywords.set("yield", TokenType::Yield);
  74. }
  75. if (s_three_char_tokens.is_empty()) {
  76. s_three_char_tokens.set("===", TokenType::EqualsEqualsEquals);
  77. s_three_char_tokens.set("!==", TokenType::ExclamationMarkEqualsEquals);
  78. s_three_char_tokens.set("**=", TokenType::AsteriskAsteriskEquals);
  79. s_three_char_tokens.set("<<=", TokenType::ShiftLeftEquals);
  80. s_three_char_tokens.set(">>=", TokenType::ShiftRightEquals);
  81. s_three_char_tokens.set(">>>", TokenType::UnsignedShiftRight);
  82. }
  83. if (s_two_char_tokens.is_empty()) {
  84. s_two_char_tokens.set("=>", TokenType::Arrow);
  85. s_two_char_tokens.set("+=", TokenType::PlusEquals);
  86. s_two_char_tokens.set("-=", TokenType::MinusEquals);
  87. s_two_char_tokens.set("*=", TokenType::AsteriskEquals);
  88. s_two_char_tokens.set("/=", TokenType::SlashEquals);
  89. s_two_char_tokens.set("%=", TokenType::PercentEquals);
  90. s_two_char_tokens.set("&=", TokenType::AmpersandEquals);
  91. s_two_char_tokens.set("|=", TokenType::PipeEquals);
  92. s_two_char_tokens.set("&&", TokenType::DoubleAmpersand);
  93. s_two_char_tokens.set("||", TokenType::DoublePipe);
  94. s_two_char_tokens.set("??", TokenType::DoubleQuestionMark);
  95. s_two_char_tokens.set("**", TokenType::DoubleAsterisk);
  96. s_two_char_tokens.set("==", TokenType::EqualsEquals);
  97. s_two_char_tokens.set("<=", TokenType::LessThanEquals);
  98. s_two_char_tokens.set(">=", TokenType::GreaterThanEquals);
  99. s_two_char_tokens.set("!=", TokenType::ExclamationMarkEquals);
  100. s_two_char_tokens.set("--", TokenType::MinusMinus);
  101. s_two_char_tokens.set("++", TokenType::PlusPlus);
  102. s_two_char_tokens.set("<<", TokenType::ShiftLeft);
  103. s_two_char_tokens.set(">>", TokenType::ShiftRight);
  104. s_two_char_tokens.set("?.", TokenType::QuestionMarkPeriod);
  105. }
  106. if (s_single_char_tokens.is_empty()) {
  107. s_single_char_tokens.set('&', TokenType::Ampersand);
  108. s_single_char_tokens.set('*', TokenType::Asterisk);
  109. s_single_char_tokens.set('[', TokenType::BracketOpen);
  110. s_single_char_tokens.set(']', TokenType::BracketClose);
  111. s_single_char_tokens.set('^', TokenType::Caret);
  112. s_single_char_tokens.set(':', TokenType::Colon);
  113. s_single_char_tokens.set(',', TokenType::Comma);
  114. s_single_char_tokens.set('{', TokenType::CurlyOpen);
  115. s_single_char_tokens.set('}', TokenType::CurlyClose);
  116. s_single_char_tokens.set('=', TokenType::Equals);
  117. s_single_char_tokens.set('!', TokenType::ExclamationMark);
  118. s_single_char_tokens.set('-', TokenType::Minus);
  119. s_single_char_tokens.set('(', TokenType::ParenOpen);
  120. s_single_char_tokens.set(')', TokenType::ParenClose);
  121. s_single_char_tokens.set('%', TokenType::Percent);
  122. s_single_char_tokens.set('.', TokenType::Period);
  123. s_single_char_tokens.set('|', TokenType::Pipe);
  124. s_single_char_tokens.set('+', TokenType::Plus);
  125. s_single_char_tokens.set('?', TokenType::QuestionMark);
  126. s_single_char_tokens.set(';', TokenType::Semicolon);
  127. s_single_char_tokens.set('/', TokenType::Slash);
  128. s_single_char_tokens.set('~', TokenType::Tilde);
  129. s_single_char_tokens.set('<', TokenType::LessThan);
  130. s_single_char_tokens.set('>', TokenType::GreaterThan);
  131. }
  132. consume();
  133. }
  134. void Lexer::consume()
  135. {
  136. if (m_position >= m_source.length()) {
  137. m_position = m_source.length() + 1;
  138. m_current_char = EOF;
  139. return;
  140. }
  141. if (m_current_char == '\n') {
  142. m_line_number++;
  143. m_line_column = 1;
  144. } else {
  145. m_line_column++;
  146. }
  147. m_current_char = m_source[m_position++];
  148. }
  149. void Lexer::consume_exponent()
  150. {
  151. consume();
  152. if (m_current_char == '-' || m_current_char == '+')
  153. consume();
  154. while (isdigit(m_current_char)) {
  155. consume();
  156. }
  157. }
  158. bool Lexer::match(char a, char b) const
  159. {
  160. if (m_position >= m_source.length())
  161. return false;
  162. return m_current_char == a
  163. && m_source[m_position] == b;
  164. }
  165. bool Lexer::match(char a, char b, char c) const
  166. {
  167. if (m_position + 1 >= m_source.length())
  168. return false;
  169. return m_current_char == a
  170. && m_source[m_position] == b
  171. && m_source[m_position + 1] == c;
  172. }
  173. bool Lexer::match(char a, char b, char c, char d) const
  174. {
  175. if (m_position + 2 >= m_source.length())
  176. return false;
  177. return m_current_char == a
  178. && m_source[m_position] == b
  179. && m_source[m_position + 1] == c
  180. && m_source[m_position + 2] == d;
  181. }
  182. bool Lexer::is_eof() const
  183. {
  184. return m_current_char == EOF;
  185. }
  186. bool Lexer::is_identifier_start() const
  187. {
  188. return isalpha(m_current_char) || m_current_char == '_' || m_current_char == '$';
  189. }
  190. bool Lexer::is_identifier_middle() const
  191. {
  192. return is_identifier_start() || isdigit(m_current_char);
  193. }
  194. bool Lexer::is_line_comment_start() const
  195. {
  196. return match('/', '/') || match('<', '!', '-', '-') || match('-', '-', '>');
  197. }
  198. bool Lexer::is_block_comment_start() const
  199. {
  200. return match('/', '*');
  201. }
  202. bool Lexer::is_block_comment_end() const
  203. {
  204. return match('*', '/');
  205. }
  206. bool Lexer::is_numeric_literal_start() const
  207. {
  208. return isdigit(m_current_char) || (m_current_char == '.' && m_position < m_source.length() && isdigit(m_source[m_position]));
  209. }
  210. void Lexer::syntax_error(const char* msg)
  211. {
  212. m_has_errors = true;
  213. if (m_log_errors)
  214. fprintf(stderr, "Syntax Error: %s (line: %zu, column: %zu)\n", msg, m_line_number, m_line_column);
  215. }
  216. Token Lexer::next()
  217. {
  218. size_t trivia_start = m_position;
  219. // consume whitespace and comments
  220. while (true) {
  221. if (isspace(m_current_char)) {
  222. do {
  223. consume();
  224. } while (isspace(m_current_char));
  225. } else if (is_line_comment_start()) {
  226. consume();
  227. do {
  228. consume();
  229. } while (!is_eof() && m_current_char != '\n');
  230. } else if (is_block_comment_start()) {
  231. consume();
  232. do {
  233. consume();
  234. } while (!is_eof() && !is_block_comment_end());
  235. consume(); // consume *
  236. consume(); // consume /
  237. } else {
  238. break;
  239. }
  240. }
  241. size_t value_start = m_position;
  242. auto token_type = TokenType::Invalid;
  243. if (is_identifier_start()) {
  244. // identifier or keyword
  245. do {
  246. consume();
  247. } while (is_identifier_middle());
  248. StringView value = m_source.substring_view(value_start - 1, m_position - value_start);
  249. auto it = s_keywords.find(value);
  250. if (it == s_keywords.end()) {
  251. token_type = TokenType::Identifier;
  252. } else {
  253. token_type = it->value;
  254. }
  255. } else if (is_numeric_literal_start()) {
  256. if (m_current_char == '0') {
  257. consume();
  258. if (m_current_char == '.') {
  259. // decimal
  260. consume();
  261. while (isdigit(m_current_char)) {
  262. consume();
  263. }
  264. if (m_current_char == 'e' || m_current_char == 'E') {
  265. consume_exponent();
  266. }
  267. } else if (m_current_char == 'e' || m_current_char == 'E') {
  268. consume_exponent();
  269. } else if (m_current_char == 'o' || m_current_char == 'O') {
  270. // octal
  271. consume();
  272. while (m_current_char >= '0' && m_current_char <= '7') {
  273. consume();
  274. }
  275. } else if (m_current_char == 'b' || m_current_char == 'B') {
  276. // binary
  277. consume();
  278. while (m_current_char == '0' || m_current_char == '1') {
  279. consume();
  280. }
  281. } else if (m_current_char == 'x' || m_current_char == 'X') {
  282. // hexadecimal
  283. consume();
  284. while (isxdigit(m_current_char)) {
  285. consume();
  286. }
  287. } else if (isdigit(m_current_char)) {
  288. // octal without 'O' prefix. Forbidden in 'strict mode'
  289. // FIXME: We need to make sure this produces a syntax error when in strict mode
  290. do {
  291. consume();
  292. } while (isdigit(m_current_char));
  293. }
  294. } else {
  295. // 1...9 or period
  296. while (isdigit(m_current_char)) {
  297. consume();
  298. }
  299. if (m_current_char == '.') {
  300. consume();
  301. while (isdigit(m_current_char)) {
  302. consume();
  303. }
  304. }
  305. if (m_current_char == 'e' || m_current_char == 'E') {
  306. consume_exponent();
  307. }
  308. }
  309. token_type = TokenType::NumericLiteral;
  310. } else if (m_current_char == '"' || m_current_char == '\'' || m_current_char == '`') {
  311. char stop_char = m_current_char;
  312. consume();
  313. while (m_current_char != stop_char && m_current_char != '\n' && !is_eof()) {
  314. if (m_current_char == '\\') {
  315. consume();
  316. }
  317. consume();
  318. }
  319. if (m_current_char != stop_char) {
  320. syntax_error("unterminated string literal");
  321. token_type = TokenType::UnterminatedStringLiteral;
  322. } else {
  323. consume();
  324. if (stop_char == '`')
  325. token_type = TokenType::TemplateLiteral;
  326. else
  327. token_type = TokenType::StringLiteral;
  328. }
  329. } else if (m_current_char == EOF) {
  330. token_type = TokenType::Eof;
  331. } else {
  332. // There is only one four-char operator: >>>=
  333. bool found_four_char_token = false;
  334. if (match('>', '>', '>', '=')) {
  335. found_four_char_token = true;
  336. consume();
  337. consume();
  338. consume();
  339. consume();
  340. token_type = TokenType::UnsignedShiftRightEquals;
  341. }
  342. bool found_three_char_token = false;
  343. if (!found_four_char_token && m_position + 1 < m_source.length()) {
  344. char second_char = m_source[m_position];
  345. char third_char = m_source[m_position + 1];
  346. char three_chars[] { (char)m_current_char, second_char, third_char, 0 };
  347. auto it = s_three_char_tokens.find(three_chars);
  348. if (it != s_three_char_tokens.end()) {
  349. found_three_char_token = true;
  350. consume();
  351. consume();
  352. consume();
  353. token_type = it->value;
  354. }
  355. }
  356. bool found_two_char_token = false;
  357. if (!found_four_char_token && !found_three_char_token && m_position < m_source.length()) {
  358. char second_char = m_source[m_position];
  359. char two_chars[] { (char)m_current_char, second_char, 0 };
  360. auto it = s_two_char_tokens.find(two_chars);
  361. if (it != s_two_char_tokens.end()) {
  362. found_two_char_token = true;
  363. consume();
  364. consume();
  365. token_type = it->value;
  366. }
  367. }
  368. bool found_one_char_token = false;
  369. if (!found_four_char_token && !found_three_char_token && !found_two_char_token) {
  370. auto it = s_single_char_tokens.find(m_current_char);
  371. if (it != s_single_char_tokens.end()) {
  372. found_one_char_token = true;
  373. consume();
  374. token_type = it->value;
  375. }
  376. }
  377. if (!found_four_char_token && !found_three_char_token && !found_two_char_token && !found_one_char_token) {
  378. consume();
  379. token_type = TokenType::Invalid;
  380. }
  381. }
  382. m_current_token = Token(
  383. token_type,
  384. m_source.substring_view(trivia_start - 1, value_start - trivia_start),
  385. m_source.substring_view(value_start - 1, m_position - value_start),
  386. m_line_number,
  387. m_line_column - m_position + value_start);
  388. return m_current_token;
  389. }
  390. }