Revert "Update unit tests to handle platforms with larger default stack sizes (#69164)"

This reverts commit 7b2a384.

Author: mark-vieira

x-pack/plugin/sql/src/test/java/org/elasticsearch/xpack/sql/parser/SqlParserTests.java

@@ -255,9 +255,9 @@ public void testLimitToPreventStackOverflowFromLargeBinaryBooleanExpression() {
         // 1000 elements is ok
         new SqlParser().createExpression(join(" OR ", nCopies(1000, "a = b")));
 
-        // 10000 elements cause stack overflow
+        // 5000 elements cause stack overflow
         ParsingException e = expectThrows(ParsingException.class, () ->
-            new SqlParser().createExpression(join(" OR ", nCopies(10000, "a = b"))));
+            new SqlParser().createExpression(join(" OR ", nCopies(5000, "a = b"))));
         assertThat(e.getMessage(),
             startsWith("line -1:0: SQL statement is too large, causing stack overflow when generating the parsing tree: ["));
     }
@@ -271,7 +271,7 @@ public void testLimitToPreventStackOverflowFromLargeUnaryArithmeticExpression()
 
         // 5000 elements cause stack overflow
         ParsingException e = expectThrows(ParsingException.class, () -> new SqlParser().createExpression(
-            join("", nCopies(5000, "abs(")).concat("i").concat(join("", nCopies(5000, ")")))));
+            join("", nCopies(1000, "abs(")).concat("i").concat(join("", nCopies(1000, ")")))));
         assertThat(e.getMessage(),
             startsWith("line -1:0: SQL statement is too large, causing stack overflow when generating the parsing tree: ["));
     }
@@ -282,9 +282,9 @@ public void testLimitToPreventStackOverflowFromLargeBinaryArithmeticExpression()
         // 1000 elements is ok
         new SqlParser().createExpression(join(" + ", nCopies(1000, "a")));
 
-        // 10000 elements cause stack overflow
+        // 5000 elements cause stack overflow
         ParsingException e = expectThrows(ParsingException.class, () ->
-            new SqlParser().createExpression(join(" + ", nCopies(10000, "a"))));
+            new SqlParser().createExpression(join(" + ", nCopies(5000, "a"))));
         assertThat(e.getMessage(),
             startsWith("line -1:0: SQL statement is too large, causing stack overflow when generating the parsing tree: ["));
     }
@@ -298,11 +298,11 @@ public void testLimitToPreventStackOverflowFromLargeSubselectTree() {
                 .concat("t")
                 .concat(join("", nCopies(199, ")"))));
 
-        // 1000 elements cause stack overflow
+        // 500 elements cause stack overflow
         ParsingException e = expectThrows(ParsingException.class, () -> new SqlParser().createStatement(
-            join(" (", nCopies(1000, "SELECT * FROM"))
+            join(" (", nCopies(500, "SELECT * FROM"))
                 .concat("t")
-                .concat(join("", nCopies(999, ")")))));
+                .concat(join("", nCopies(499, ")")))));
         assertThat(e.getMessage(),
             startsWith("line -1:0: SQL statement is too large, causing stack overflow when generating the parsing tree: ["));
     }