diff --git a/src/protocol/parser/pass_tokenizer.rs b/src/protocol/parser/pass_tokenizer.rs
index 86649664d3562b13ba6bf7e31a3c513dd9bc386c..d6f457a90a4963c90a0f36bb011df94335f6e695 100644
--- a/src/protocol/parser/pass_tokenizer.rs
+++ b/src/protocol/parser/pass_tokenizer.rs
@@ -157,36 +157,6 @@ impl PassTokenizer {
             self.add_code_range(target, 0, last_registered_idx, last_token_idx, NO_RELATION);
         }
 
-        // TODO: @remove once I'm sure the algorithm works. For now it is better
-        //  if the debugging is a little more expedient
-        if cfg!(debug_assertions) {
-            // For each range make sure its children make sense
-            for parent_idx in 0..target.ranges.len() {
-                let cur_range = &target.ranges[parent_idx];
-                if cur_range.num_child_ranges == 0 {
-                    assert_eq!(cur_range.first_child_idx, NO_RELATION);
-                    assert_eq!(cur_range.last_child_idx, NO_RELATION);
-                } else {
-                    assert_ne!(cur_range.first_child_idx, NO_RELATION);
-                    assert_ne!(cur_range.last_child_idx, NO_RELATION);
-
-                    let mut child_counter = 0u32;
-                    let mut last_valid_child_idx = cur_range.first_child_idx;
-                    let mut child_idx = cur_range.first_child_idx;
-                    while child_idx != NO_RELATION {
-                        let child_range = &target.ranges[child_idx as usize];
-                        assert_eq!(child_range.parent_idx, parent_idx as i32);
-                        last_valid_child_idx = child_idx;
-                        child_idx = child_range.next_sibling_idx;
-                        child_counter += 1;
-                    }
-
-                    assert_eq!(cur_range.last_child_idx, last_valid_child_idx);
-                    assert_eq!(cur_range.num_child_ranges, child_counter);
-                }
-            }
-        }
-
         Ok(())
     }