Parser.h 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235
  1. /*
  2. * Copyright (c) 2020, Stephan Unverwerth <s.unverwerth@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #pragma once
  7. #include <AK/HashTable.h>
  8. #include <AK/NonnullRefPtr.h>
  9. #include <AK/StringBuilder.h>
  10. #include <LibJS/AST.h>
  11. #include <LibJS/Lexer.h>
  12. #include <LibJS/SourceRange.h>
  13. #include <stdio.h>
  14. namespace JS {
  15. enum class Associativity {
  16. Left,
  17. Right
  18. };
  19. struct FunctionNodeParseOptions {
  20. enum {
  21. CheckForFunctionAndName = 1 << 0,
  22. AllowSuperPropertyLookup = 1 << 1,
  23. AllowSuperConstructorCall = 1 << 2,
  24. IsGetterFunction = 1 << 3,
  25. IsSetterFunction = 1 << 4,
  26. IsArrowFunction = 1 << 5,
  27. };
  28. };
  29. class Parser {
  30. public:
  31. explicit Parser(Lexer lexer);
  32. NonnullRefPtr<Program> parse_program();
  33. template<typename FunctionNodeType>
  34. NonnullRefPtr<FunctionNodeType> parse_function_node(u8 parse_options = FunctionNodeParseOptions::CheckForFunctionAndName);
  35. Vector<FunctionNode::Parameter> parse_formal_parameters(int& function_length, u8 parse_options = 0);
  36. RefPtr<BindingPattern> parse_binding_pattern();
  37. NonnullRefPtr<Declaration> parse_declaration();
  38. NonnullRefPtr<Statement> parse_statement();
  39. NonnullRefPtr<BlockStatement> parse_block_statement();
  40. NonnullRefPtr<BlockStatement> parse_block_statement(bool& is_strict);
  41. NonnullRefPtr<ReturnStatement> parse_return_statement();
  42. NonnullRefPtr<VariableDeclaration> parse_variable_declaration(bool for_loop_variable_declaration = false);
  43. NonnullRefPtr<Statement> parse_for_statement();
  44. NonnullRefPtr<Statement> parse_for_in_of_statement(NonnullRefPtr<ASTNode> lhs);
  45. NonnullRefPtr<IfStatement> parse_if_statement();
  46. NonnullRefPtr<ThrowStatement> parse_throw_statement();
  47. NonnullRefPtr<TryStatement> parse_try_statement();
  48. NonnullRefPtr<CatchClause> parse_catch_clause();
  49. NonnullRefPtr<SwitchStatement> parse_switch_statement();
  50. NonnullRefPtr<SwitchCase> parse_switch_case();
  51. NonnullRefPtr<BreakStatement> parse_break_statement();
  52. NonnullRefPtr<ContinueStatement> parse_continue_statement();
  53. NonnullRefPtr<DoWhileStatement> parse_do_while_statement();
  54. NonnullRefPtr<WhileStatement> parse_while_statement();
  55. NonnullRefPtr<WithStatement> parse_with_statement();
  56. NonnullRefPtr<DebuggerStatement> parse_debugger_statement();
  57. NonnullRefPtr<ConditionalExpression> parse_conditional_expression(NonnullRefPtr<Expression> test);
  58. NonnullRefPtr<Expression> parse_expression(int min_precedence, Associativity associate = Associativity::Right, const Vector<TokenType>& forbidden = {});
  59. NonnullRefPtr<Expression> parse_primary_expression();
  60. NonnullRefPtr<Expression> parse_unary_prefixed_expression();
  61. NonnullRefPtr<RegExpLiteral> parse_regexp_literal();
  62. NonnullRefPtr<ObjectExpression> parse_object_expression();
  63. NonnullRefPtr<ArrayExpression> parse_array_expression();
  64. NonnullRefPtr<StringLiteral> parse_string_literal(const Token& token, bool in_template_literal = false);
  65. NonnullRefPtr<TemplateLiteral> parse_template_literal(bool is_tagged);
  66. NonnullRefPtr<Expression> parse_secondary_expression(NonnullRefPtr<Expression>, int min_precedence, Associativity associate = Associativity::Right);
  67. NonnullRefPtr<CallExpression> parse_call_expression(NonnullRefPtr<Expression>);
  68. NonnullRefPtr<NewExpression> parse_new_expression();
  69. NonnullRefPtr<ClassDeclaration> parse_class_declaration();
  70. NonnullRefPtr<ClassExpression> parse_class_expression(bool expect_class_name);
  71. NonnullRefPtr<YieldExpression> parse_yield_expression();
  72. NonnullRefPtr<Expression> parse_property_key();
  73. NonnullRefPtr<AssignmentExpression> parse_assignment_expression(AssignmentOp, NonnullRefPtr<Expression> lhs, int min_precedence, Associativity);
  74. RefPtr<FunctionExpression> try_parse_arrow_function_expression(bool expect_parens);
  75. RefPtr<Statement> try_parse_labelled_statement();
  76. RefPtr<MetaProperty> try_parse_new_target_expression();
  77. struct Error {
  78. String message;
  79. Optional<Position> position;
  80. String to_string() const
  81. {
  82. if (!position.has_value())
  83. return message;
  84. return String::formatted("{} (line: {}, column: {})", message, position.value().line, position.value().column);
  85. }
  86. String source_location_hint(const StringView& source, const char spacer = ' ', const char indicator = '^') const
  87. {
  88. if (!position.has_value())
  89. return {};
  90. // We need to modify the source to match what the lexer considers one line - normalizing
  91. // line terminators to \n is easier than splitting using all different LT characters.
  92. String source_string { source };
  93. source_string.replace("\r\n", "\n");
  94. source_string.replace("\r", "\n");
  95. source_string.replace(LINE_SEPARATOR, "\n");
  96. source_string.replace(PARAGRAPH_SEPARATOR, "\n");
  97. StringBuilder builder;
  98. builder.append(source_string.split_view('\n', true)[position.value().line - 1]);
  99. builder.append('\n');
  100. for (size_t i = 0; i < position.value().column - 1; ++i)
  101. builder.append(spacer);
  102. builder.append(indicator);
  103. return builder.build();
  104. }
  105. };
  106. bool has_errors() const { return m_parser_state.m_errors.size(); }
  107. const Vector<Error>& errors() const { return m_parser_state.m_errors; }
  108. void print_errors() const
  109. {
  110. for (auto& error : m_parser_state.m_errors) {
  111. auto hint = error.source_location_hint(m_parser_state.m_lexer.source());
  112. if (!hint.is_empty())
  113. warnln("{}", hint);
  114. warnln("SyntaxError: {}", error.to_string());
  115. }
  116. }
  117. struct TokenMemoization {
  118. bool try_parse_arrow_function_expression_failed;
  119. };
  120. private:
  121. friend class ScopePusher;
  122. Associativity operator_associativity(TokenType) const;
  123. bool match_expression() const;
  124. bool match_unary_prefixed_expression() const;
  125. bool match_secondary_expression(const Vector<TokenType>& forbidden = {}) const;
  126. bool match_statement() const;
  127. bool match_declaration() const;
  128. bool match_variable_declaration() const;
  129. bool match_identifier_name() const;
  130. bool match_property_key() const;
  131. bool match(TokenType type) const;
  132. bool done() const;
  133. void expected(const char* what);
  134. void syntax_error(const String& message, Optional<Position> = {});
  135. Token consume();
  136. Token consume(TokenType type);
  137. Token consume_and_validate_numeric_literal();
  138. void consume_or_insert_semicolon();
  139. void save_state();
  140. void load_state();
  141. void discard_saved_state();
  142. Position position() const;
  143. bool try_parse_arrow_function_expression_failed_at_position(const Position&) const;
  144. void set_try_parse_arrow_function_expression_failed_at_position(const Position&, bool);
  145. struct RulePosition {
  146. AK_MAKE_NONCOPYABLE(RulePosition);
  147. AK_MAKE_NONMOVABLE(RulePosition);
  148. public:
  149. RulePosition(Parser& parser, Position position)
  150. : m_parser(parser)
  151. , m_position(position)
  152. {
  153. m_parser.m_rule_starts.append(position);
  154. }
  155. ~RulePosition()
  156. {
  157. auto last = m_parser.m_rule_starts.take_last();
  158. VERIFY(last.line == m_position.line);
  159. VERIFY(last.column == m_position.column);
  160. }
  161. const Position& position() const { return m_position; }
  162. private:
  163. Parser& m_parser;
  164. Position m_position;
  165. };
  166. [[nodiscard]] RulePosition push_start() { return { *this, position() }; }
  167. struct ParserState {
  168. Lexer m_lexer;
  169. Token m_current_token;
  170. Vector<Error> m_errors;
  171. Vector<NonnullRefPtrVector<VariableDeclaration>> m_var_scopes;
  172. Vector<NonnullRefPtrVector<VariableDeclaration>> m_let_scopes;
  173. Vector<NonnullRefPtrVector<FunctionDeclaration>> m_function_scopes;
  174. Vector<Vector<FunctionNode::Parameter>&> function_parameters;
  175. HashTable<StringView> m_labels_in_scope;
  176. bool m_strict_mode { false };
  177. bool m_allow_super_property_lookup { false };
  178. bool m_allow_super_constructor_call { false };
  179. bool m_in_function_context { false };
  180. bool m_in_generator_function_context { false };
  181. bool m_in_arrow_function_context { false };
  182. bool m_in_break_context { false };
  183. bool m_in_continue_context { false };
  184. bool m_string_legacy_octal_escape_sequence_in_scope { false };
  185. explicit ParserState(Lexer);
  186. };
  187. class PositionKeyTraits {
  188. public:
  189. static int hash(const Position& position)
  190. {
  191. return int_hash(position.line) ^ int_hash(position.column);
  192. }
  193. static bool equals(const Position& a, const Position& b)
  194. {
  195. return a.column == b.column && a.line == b.line;
  196. }
  197. };
  198. Vector<Position> m_rule_starts;
  199. ParserState m_parser_state;
  200. FlyString m_filename;
  201. Vector<ParserState> m_saved_state;
  202. HashMap<Position, TokenMemoization, PositionKeyTraits> m_token_memoizations;
  203. };
  204. }