Experimental lexer generator: DfaState += __str__

tools/lexer_generator/dfa.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 28 matching lines @@
   def name(self):
     return self.__name
 
   def add_transition(self, key, action, state):
     assert not self.__transitions.has_key(key)
     self.__transitions[key] = (state, action)
 
   def transitions(self):
     return self.__transitions
 
+  def __str__(self):
+    return str(self.node_number())
+
 class Dfa(Automaton):
 
   def __init__(self, start_name, mapping):
     super(Dfa, self).__init__()
     self.__terminal_set = set()
     name_map = {}
     action_map = {}
     for i, name in enumerate(mapping.keys()):
       name_map[name] = DfaState(name, i)
     for name, node_data in mapping.items():
@@ skipping 74 matching lines @@
 
   def __visit_all_edges(self, visitor, state):
     edge = set([self.__start])
     first = lambda v: set([x[0] for x in v])
     next_edge = lambda node: first(node.transitions().values())
     return self.visit_edges(edge, next_edge, visitor, state)
 
   def to_dot(self):
     iterator = lambda visitor, state: self.__visit_all_edges(visitor, state)
     return self.generate_dot(self.__start, self.__terminal_set, iterator)