Fix incorrect lookup when parsing grouped expressions

asynchroza · Nov 6, 2023 · f1913fd · f1913fd
1 parent deb5899
commit f1913fd
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 4 deletions.
diff --git a/nulascript/parser/parser.cc b/nulascript/parser/parser.cc
@@ -222,9 +222,8 @@ Expression* Parser::parseParensExpressions() {
     getNextToken();
 
     auto expression = parseExpression(Precedence::LOWEST);
-    std::cout << expression->toString() << std::endl;
 
-    if (!isEqualToPeekedTokenType(TokenType::RPAR)) {
+    if (!peekAndLoadExpectedToken(TokenType::RPAR)) {
         return nullptr;
     }
 

diff --git a/nulascript/tests/parser_test.cc b/nulascript/tests/parser_test.cc
@@ -267,7 +267,7 @@ TEST(ParserSuite, TestAstToString) {
         return a;
     );
 
-    std::string expectedResult = "let a = ;\nreturn ;\n";
+    std::string expectedResult = "let a = ;return ;";
     // clang-format on
 
     Lexer l(input);
@@ -475,7 +475,7 @@ TEST(ParserSuite, TestOperatorPrecedence) {
         {"a + b * c is not a * d + p * q",
          "((a + (b * c)) is not ((a * d) + (p * q)))"},
         {"false == a + b", "(false == (a + b))"},
-        {"a + (b + c) + d", "(a + (b + c)) + d)"}};
+        {"a + (b + c) + d", "((a + (b + c)) + d)"}};
 
     for (auto test : precedenceTests) {
         Lexer l(test.input);