Parser.h 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  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. #pragma once
  27. #include "AST.h"
  28. #include "Lexer.h"
  29. #include <AK/NonnullRefPtr.h>
  30. namespace JS {
  31. enum class Associativity {
  32. Left,
  33. Right
  34. };
  35. class Parser {
  36. public:
  37. explicit Parser(Lexer lexer);
  38. NonnullRefPtr<Program> parse_program();
  39. template<typename FunctionNodeType>
  40. NonnullRefPtr<FunctionNodeType> parse_function_node();
  41. NonnullRefPtr<Statement> parse_statement();
  42. NonnullRefPtr<BlockStatement> parse_block_statement();
  43. NonnullRefPtr<ReturnStatement> parse_return_statement();
  44. NonnullRefPtr<VariableDeclaration> parse_variable_declaration();
  45. NonnullRefPtr<ForStatement> parse_for_statement();
  46. NonnullRefPtr<IfStatement> parse_if_statement();
  47. NonnullRefPtr<ThrowStatement> parse_throw_statement();
  48. NonnullRefPtr<TryStatement> parse_try_statement();
  49. NonnullRefPtr<CatchClause> parse_catch_clause();
  50. NonnullRefPtr<SwitchStatement> parse_switch_statement();
  51. NonnullRefPtr<SwitchCase> parse_switch_case();
  52. NonnullRefPtr<BreakStatement> parse_break_statement();
  53. NonnullRefPtr<ContinueStatement> parse_continue_statement();
  54. NonnullRefPtr<DoWhileStatement> parse_do_while_statement();
  55. NonnullRefPtr<WhileStatement> parse_while_statement();
  56. NonnullRefPtr<ConditionalExpression> parse_conditional_expression(NonnullRefPtr<Expression> test);
  57. NonnullRefPtr<Expression> parse_expression(int min_precedence, Associativity associate = Associativity::Right);
  58. NonnullRefPtr<Expression> parse_primary_expression();
  59. NonnullRefPtr<Expression> parse_unary_prefixed_expression();
  60. NonnullRefPtr<ObjectExpression> parse_object_expression();
  61. NonnullRefPtr<ArrayExpression> parse_array_expression();
  62. NonnullRefPtr<Expression> parse_secondary_expression(NonnullRefPtr<Expression>, int min_precedence, Associativity associate = Associativity::Right);
  63. NonnullRefPtr<CallExpression> parse_call_expression(NonnullRefPtr<Expression>);
  64. NonnullRefPtr<NewExpression> parse_new_expression();
  65. RefPtr<FunctionExpression> try_parse_arrow_function_expression(bool expect_parens);
  66. bool has_errors() const { return m_parser_state.m_lexer.has_errors() || m_parser_state.m_has_errors; }
  67. private:
  68. friend class ScopePusher;
  69. int operator_precedence(TokenType) const;
  70. Associativity operator_associativity(TokenType) const;
  71. bool match_expression() const;
  72. bool match_unary_prefixed_expression() const;
  73. bool match_secondary_expression() const;
  74. bool match_statement() const;
  75. bool match_variable_declaration() const;
  76. bool match_identifier_name() const;
  77. bool match(TokenType type) const;
  78. bool done() const;
  79. void expected(const char* what);
  80. Token consume();
  81. Token consume(TokenType type);
  82. void consume_or_insert_semicolon();
  83. void save_state();
  84. void load_state();
  85. struct ParserState {
  86. Lexer m_lexer;
  87. Token m_current_token;
  88. bool m_has_errors = false;
  89. Vector<NonnullRefPtrVector<VariableDeclaration>> m_var_scopes;
  90. Vector<NonnullRefPtrVector<VariableDeclaration>> m_let_scopes;
  91. explicit ParserState(Lexer);
  92. };
  93. ParserState m_parser_state;
  94. Optional<ParserState> m_saved_state;
  95. };
  96. }