Experimental parser: more assertions

tools/lexer_generator/transition_keys.py

 # Copyright 2013 the V8 project authors. All rights reserved.
 # Redistribution and use in source and binary forms, with or without
 # modification, are permitted provided that the following conditions are
 # met:
 #
 #     * Redistributions of source code must retain the above copyright
 #       notice, this list of conditions and the following disclaimer.
 #     * Redistributions in binary form must reproduce the above
 #       copyright notice, this list of conditions and the following
 #       disclaimer in the documentation and/or other materials provided
@@ skipping 148 matching lines @@
 
   def matches_char(self, char):
     char = ord(char)
     # TODO class checks
     for r in self.__ranges:
       if r[0] <= char and char <= r[1]: return True
     return False
 
   def matches_key(self, key):
     assert isinstance(key, self.__class__)
-    assert key != TransitionKey.epsilon()
+    assert key != TransitionKey.epsilon() and not key.__is_unique()
     assert len(key.__ranges) == 1
     subkey = key.__ranges[0]
+    matches = False
     for k in self.__ranges:
-      if k[0] <= subkey[0] and k[1] >= subkey[1]: return True
-    # TODO assert disjoint
-    return False
+      if k[0] <= subkey[0]:
+        assert subkey[1] <= k[1] or subkey[0] > k[1]
+      if subkey[0] < k[0]:
+        assert subkey[1] < k[0]
+      if k[0] <= subkey[0] and k[1] >= subkey[1]:
+        assert not matches
+        matches = True
+    return matches
 
   def __hash__(self):
     if self.__cached_hash == None:
       initial_hash = hash((-1, TransitionKey.__upper_bound + 1))
       f = lambda acc, r: acc ^ hash(r)
       self.__cached_hash = reduce(f, self.__ranges, initial_hash)
     return self.__cached_hash
 
   def __eq__(self, other):
     return isinstance(other, self.__class__) and self.__ranges == other.__ranges
@@ skipping 146 matching lines @@
       elif last[1] + 1 < r[0]:
         inverted.append((last[1] + 1, r[0] - 1))
       last = r
     upper_bound = latin_1[1]
     if last == None:
       inverted.append(latin_1)
     elif last[1] < upper_bound:
       inverted.append((last[1] + 1, upper_bound))
     inverted += list(classes)
     return inverted