Lexer.cpp 12 KB

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