mirror of
https://github.com/RGBCube/serenity
synced 2025-05-30 10:25:08 +00:00
adb4accab3
Adds fully functioning template literals. Because template literals
contain expressions, most of the work has to be done in the Lexer rather
than the Parser. And because of the complexity of template literals
(expressions, nesting, escapes, etc), the Lexer needs to have some
template-related state.
When entering a new template literal, a TemplateLiteralStart token is
emitted. When inside a literal, all text will be parsed up until a '${'
or '`' (or EOF, but that's a syntax error) is seen, and then a
TemplateLiteralExprStart token is emitted. At this point, the Lexer
proceeds as normal, however it keeps track of the number of opening
and closing curly braces it has seen in order to determine the close
of the expression. Once it finds a matching curly brace for the '${',
a TemplateLiteralExprEnd token is emitted and the state is updated
accordingly.
When the Lexer is inside of a template literal, but not an expression,
and sees a '`', this must be the closing grave: a TemplateLiteralEnd
token is emitted.
The state required to correctly parse template strings consists of a
vector (for nesting) of two pieces of information: whether or not we
are in a template expression (as opposed to a template string); and
the count of the number of unmatched open curly braces we have seen
(only applicable if the Lexer is currently in a template expression).
TODO: Add support for template literal newlines in the JS REPL (this will
cause a syntax error currently):
> `foo
> bar`
'foo
bar'
114 lines
4.7 KiB
C++
114 lines
4.7 KiB
C++
/*
|
|
* Copyright (c) 2020, Stephan Unverwerth <s.unverwerth@gmx.de>
|
|
* 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 <AK/NonnullRefPtr.h>
|
|
|
|
namespace JS {
|
|
|
|
enum class Associativity {
|
|
Left,
|
|
Right
|
|
};
|
|
|
|
class Parser {
|
|
public:
|
|
explicit Parser(Lexer lexer);
|
|
|
|
NonnullRefPtr<Program> parse_program();
|
|
|
|
template<typename FunctionNodeType>
|
|
NonnullRefPtr<FunctionNodeType> parse_function_node(bool need_function_keyword = true);
|
|
|
|
NonnullRefPtr<Statement> parse_statement();
|
|
NonnullRefPtr<BlockStatement> parse_block_statement();
|
|
NonnullRefPtr<ReturnStatement> parse_return_statement();
|
|
NonnullRefPtr<VariableDeclaration> parse_variable_declaration();
|
|
NonnullRefPtr<ForStatement> parse_for_statement();
|
|
NonnullRefPtr<IfStatement> parse_if_statement();
|
|
NonnullRefPtr<ThrowStatement> parse_throw_statement();
|
|
NonnullRefPtr<TryStatement> parse_try_statement();
|
|
NonnullRefPtr<CatchClause> parse_catch_clause();
|
|
NonnullRefPtr<SwitchStatement> parse_switch_statement();
|
|
NonnullRefPtr<SwitchCase> parse_switch_case();
|
|
NonnullRefPtr<BreakStatement> parse_break_statement();
|
|
NonnullRefPtr<ContinueStatement> parse_continue_statement();
|
|
NonnullRefPtr<DoWhileStatement> parse_do_while_statement();
|
|
NonnullRefPtr<WhileStatement> parse_while_statement();
|
|
NonnullRefPtr<DebuggerStatement> parse_debugger_statement();
|
|
NonnullRefPtr<ConditionalExpression> parse_conditional_expression(NonnullRefPtr<Expression> test);
|
|
|
|
NonnullRefPtr<Expression> parse_expression(int min_precedence, Associativity associate = Associativity::Right);
|
|
NonnullRefPtr<Expression> parse_primary_expression();
|
|
NonnullRefPtr<Expression> parse_unary_prefixed_expression();
|
|
NonnullRefPtr<ObjectExpression> parse_object_expression();
|
|
NonnullRefPtr<ArrayExpression> parse_array_expression();
|
|
NonnullRefPtr<TemplateLiteral> parse_template_literal();
|
|
NonnullRefPtr<Expression> parse_secondary_expression(NonnullRefPtr<Expression>, int min_precedence, Associativity associate = Associativity::Right);
|
|
NonnullRefPtr<CallExpression> parse_call_expression(NonnullRefPtr<Expression>);
|
|
NonnullRefPtr<NewExpression> parse_new_expression();
|
|
RefPtr<FunctionExpression> 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);
|
|
void syntax_error(const String& message, size_t line = 0, size_t column = 0);
|
|
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<NonnullRefPtrVector<VariableDeclaration>> m_var_scopes;
|
|
Vector<NonnullRefPtrVector<VariableDeclaration>> m_let_scopes;
|
|
|
|
explicit ParserState(Lexer);
|
|
};
|
|
|
|
ParserState m_parser_state;
|
|
Vector<ParserState> m_saved_state;
|
|
};
|
|
}
|