Experimental lexer generator: refactor(TransitionKey) += comments.

tools/lexer_generator/nfa.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 87 matching lines @@
       self.__add_transition(TransitionKey.epsilon(), end)
 
   def __matches(self, match_func, value):
     f = lambda acc, (k, vs): acc | vs if match_func(k, value) else acc
     return reduce(f, self.__transitions.items(), set())
 
   def char_matches(self, value):
     return self.__matches(lambda k, v : k.matches_char(v), value)
 
   def key_matches(self, value):
-    return self.__matches(lambda k, v : k.matches_key(v), value)
+    return self.__matches(lambda k, v : k.is_superset_of_key(v), value)
 
 class Nfa(Automaton):
 
   def __init__(self, start, end, nodes_created):
     super(Nfa, self).__init__()
     self.__start = start
     self.__end = end
     self.__verify(nodes_created)
 
   def start_set(self):
@@ skipping 62 matching lines @@
       for state in reduce(f, nfa_state_set, set()):
         match_states.add(state)
       transition_state = Nfa.__to_dfa(match_states, dfa_nodes, end_node)
       dfa_nodes[name]['transitions'][key] = transition_state
     return name
 
   def compute_dfa(self):
     dfa_nodes = {}
     start_name = self.__to_dfa(set([self.__start]), dfa_nodes, self.__end)
     return (start_name, dfa_nodes)