feat: Tidy the fuel functionality (#20)

Author: zharinov

crates/plotnik-lib/src/ast/parser/core.rs

@@ -17,7 +17,7 @@ use crate::ast::syntax_kind::token_sets::ROOT_EXPR_FIRST;
 use crate::ast::syntax_kind::{SyntaxKind, TokenSet};
 
 const DEFAULT_EXEC_FUEL: u32 = 1_000_000;
-const DEFAULT_RECURSION_FUEL: u32 = 512;
+const DEFAULT_RECURSION_FUEL: u32 = 4096;
 
 /// Parse result containing the green tree and any errors.
 ///

crates/plotnik-lib/src/ast/parser/tests/recovery/coverage.rs

@@ -320,17 +320,18 @@ fn capture_at_start_of_alternation() {
 
 #[test]
 fn deeply_nested_trees_hit_recursion_limit() {
-    // Test just over recursion limit (default is 512)
-    let depth = 513;
+    let depth = 128;
     let mut input = String::new();
-    for _ in 0..depth {
+    for _ in 0..depth + 1 {
         input.push_str("(a ");
     }
     for _ in 0..depth {
         input.push(')');
     }
 
-    let result = Query::builder(&input).build();
+    let result = Query::builder(&input)
+        .with_recursion_fuel(Some(depth))
+        .build();
 
     assert!(
         matches!(result, Err(crate::Error::RecursionLimitExceeded)),
@@ -341,17 +342,18 @@ fn deeply_nested_trees_hit_recursion_limit() {
 
 #[test]
 fn deeply_nested_sequences_hit_recursion_limit() {
-    // Test just over recursion limit (default is 512)
-    let depth = 513;
+    let depth = 128;
     let mut input = String::new();
-    for _ in 0..depth {
+    for _ in 0..depth + 1 {
         input.push_str("{(a) ");
     }
     for _ in 0..depth {
         input.push('}');
     }
 
-    let result = Query::builder(&input).build();
+    let result = Query::builder(&input)
+        .with_recursion_fuel(Some(depth))
+        .build();
 
     assert!(
         matches!(result, Err(crate::Error::RecursionLimitExceeded)),
@@ -362,17 +364,18 @@ fn deeply_nested_sequences_hit_recursion_limit() {
 
 #[test]
 fn deeply_nested_alternations_hit_recursion_limit() {
-    // Test just over recursion limit (default is 512)
-    let depth = 513;
+    let depth = 128;
     let mut input = String::new();
-    for _ in 0..depth {
+    for _ in 0..depth + 1 {
         input.push_str("[(a) ");
     }
     for _ in 0..depth {
         input.push(']');
     }
 
-    let result = Query::builder(&input).build();
+    let result = Query::builder(&input)
+        .with_recursion_fuel(Some(depth))
+        .build();
 
     assert!(
         matches!(result, Err(crate::Error::RecursionLimitExceeded)),
@@ -964,3 +967,64 @@ fn paren_close_inside_sequence() {
       | ^^^^ unnamed definition must be last in file; add a name: `Name = {(a)`
     "#);
 }
+
+#[test]
+fn many_trees_exhaust_exec_fuel() {
+    let count = 500;
+    let mut input = String::new();
+    for _ in 0..count {
+        input.push_str("(a) ");
+    }
+
+    let result = Query::builder(&input).with_exec_fuel(Some(100)).build();
+
+    assert!(
+        matches!(result, Err(crate::Error::ExecFuelExhausted)),
+        "expected ExecFuelExhausted error, got {:?}",
+        result
+    );
+}
+
+#[test]
+fn many_branches_exhaust_exec_fuel() {
+    let count = 500;
+    let mut input = String::new();
+    input.push('[');
+    for i in 0..count {
+        if i > 0 {
+            input.push(' ');
+        }
+        input.push_str("(a)");
+    }
+    input.push(']');
+
+    let result = Query::builder(&input).with_exec_fuel(Some(100)).build();
+
+    assert!(
+        matches!(result, Err(crate::Error::ExecFuelExhausted)),
+        "expected ExecFuelExhausted error, got {:?}",
+        result
+    );
+}
+
+#[test]
+fn many_fields_exhaust_exec_fuel() {
+    let count = 500;
+    let mut input = String::new();
+    input.push('(');
+    for i in 0..count {
+        if i > 0 {
+            input.push(' ');
+        }
+        input.push_str("a: (b)");
+    }
+    input.push(')');
+
+    let result = Query::builder(&input).with_exec_fuel(Some(100)).build();
+
+    assert!(
+        matches!(result, Err(crate::Error::ExecFuelExhausted)),
+        "expected ExecFuelExhausted error, got {:?}",
+        result
+    );
+}

crates/plotnik-lib/src/ast/parser/tests/recovery/incomplete.rs

@@ -208,23 +208,3 @@ fn bare_missing_keyword() {
       | ^^^^^^^ ERROR and MISSING must be inside parentheses: (ERROR) or (MISSING ...)
     "#);
 }
-
-#[test]
-fn deep_nesting_within_limit() {
-    let depth = 100;
-    let mut input = String::new();
-    for _ in 0..depth {
-        input.push_str("(a ");
-    }
-    for _ in 0..depth {
-        input.push(')');
-    }
-
-    let result = crate::ast::parser::parse(&input).unwrap();
-    assert!(
-        result.is_valid(),
-        "expected no errors for depth {}, got: {:?}",
-        depth,
-        result.errors()
-    );
-}