Adjust tests.

test/libsolidity/semanticTests/array/delete/bytes_delete_element.sol

@@ -15,6 +15,7 @@ contract c {
     }
 }
 // ====
+// requiresYulOptimizer: minimalStack
 // compileViaYul: also
 // ----
 // test1() -> true

test/libsolidity/semanticTests/array/delete/delete_bytes_array.sol

@@ -31,6 +31,7 @@ contract C {
 }
 
 // ====
+// requiresYulOptimizer: minimalStack
 // compileViaYul: also
 // ----
 // f() -> 0

test/libsolidity/semanticTests/array/delete/delete_memory_array.sol

@@ -12,6 +12,7 @@ contract C {
 }
 
 // ====
+// requiresYulOptimizer: minimalStack
 // compileViaYul: also
 // ----
 // len() -> 0

test/libsolidity/semanticTests/array/delete/delete_on_array_of_structs.sol

@@ -17,6 +17,7 @@ contract C {
 }
 
 // ====
+// requiresYulOptimizer: minimalStack
 // compileViaYul: also
 // ----
 // f() -> true # This code interprets x as an array length and thus will go out of gas. neither of the two should throw due to out-of-bounds access #

test/libsolidity/semanticTests/array/delete/delete_storage_array.sol

@@ -34,6 +34,7 @@ contract C {
 }
 
 // ====
+// requiresYulOptimizer: minimalStack
 // compileViaYul: also
 // ----
 // len() -> 0

test/libsolidity/semanticTests/array/delete/delete_storage_array_packed.sol

@@ -13,6 +13,7 @@ contract C {
     }
 }
 // ====
+// requiresYulOptimizer: minimalStack
 // compileViaYul: also
 // ----
 // f() -> 0, 0, 0

test/libsolidity/semanticTests/array/delete/memory_arrays_delete.sol

@@ -10,6 +10,7 @@ contract Test {
     }
 }
 // ====
+// requiresYulOptimizer: minimalStack
 // compileViaYul: also
 // ----
 // del() -> 0, 1, 2, 0, 0, 0, 0x20, 0x21, 0x22, 0x30, 0x31, 0