/* * Copyright (c) 2020, Stephan Unverwerth * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this * list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #pragma once #include "AST.h" #include "Lexer.h" #include namespace JS { enum class Associativity { Left, Right }; class Parser { public: explicit Parser(Lexer lexer); NonnullRefPtr parse_program(); template NonnullRefPtr parse_function_node(); NonnullRefPtr parse_statement(); NonnullRefPtr parse_block_statement(); NonnullRefPtr parse_return_statement(); NonnullRefPtr parse_variable_declaration(); NonnullRefPtr parse_for_statement(); NonnullRefPtr parse_if_statement(); NonnullRefPtr parse_throw_statement(); NonnullRefPtr parse_try_statement(); NonnullRefPtr parse_catch_clause(); NonnullRefPtr parse_switch_statement(); NonnullRefPtr parse_switch_case(); NonnullRefPtr parse_break_statement(); NonnullRefPtr parse_continue_statement(); NonnullRefPtr parse_do_while_statement(); NonnullRefPtr parse_conditional_expression(NonnullRefPtr test); NonnullRefPtr parse_expression(int min_precedence, Associativity associate = Associativity::Right); NonnullRefPtr parse_primary_expression(); NonnullRefPtr parse_unary_prefixed_expression(); NonnullRefPtr parse_object_expression(); NonnullRefPtr parse_array_expression(); NonnullRefPtr parse_secondary_expression(NonnullRefPtr, int min_precedence, Associativity associate = Associativity::Right); NonnullRefPtr parse_call_expression(NonnullRefPtr); NonnullRefPtr parse_new_expression(); RefPtr try_parse_arrow_function_expression(bool expect_parens); bool has_errors() const { return m_parser_state.m_lexer.has_errors() || m_parser_state.m_has_errors; } private: friend class ScopePusher; int operator_precedence(TokenType) const; Associativity operator_associativity(TokenType) const; bool match_expression() const; bool match_unary_prefixed_expression() const; bool match_secondary_expression() const; bool match_statement() const; bool match_variable_declaration() const; bool match_identifier_name() const; bool match(TokenType type) const; bool done() const; void expected(const char* what); Token consume(); Token consume(TokenType type); void consume_or_insert_semicolon(); void save_state(); void load_state(); struct ParserState { Lexer m_lexer; Token m_current_token; bool m_has_errors = false; Vector> m_var_scopes; Vector> m_let_scopes; explicit ParserState(Lexer); }; ParserState m_parser_state; Optional m_saved_state; }; }