Experimental parser: more escaping

tools/lexer_generator/rule_parser.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 151 matching lines @@
 
   def p_regex_string_literal(self, p):
     'regex_string_literal : STRING'
     string = p[1][1:-1]
     escape_char = lambda string, char: string.replace(char, "\\" + char)
     string = reduce(escape_char, "+?*|.[](){}", string).replace("\\\"", "\"")
     p[0] = RegexParser.parse(string)
 
   def p_regex(self, p):
     'regex : REGEX'
-    p[0] = RegexParser.parse(p[1][1:-1])
+    string = p[1][1:-1].replace("\\/", "/")
+    p[0] = RegexParser.parse(string)
 
   def p_regex_class(self, p):
     'regex_class : CHARACTER_CLASS_REGEX'
     p[0] = RegexParser.parse(p[1])
 
   def p_regex_alias(self, p):
     'regex_alias : IDENTIFIER'
     p[0] = self.__state.aliases[p[1]]
 
   def p_modifier(self, p):
@@ skipping 127 matching lines @@
     for k, v in parser_state.rules.items():
       if k == 'default': continue
       process(k, v)
     process('default', parser_state.rules['default'])
     # build the automata
     for rule_name, graph in rule_map.items():
       self.__automata[rule_name] = RuleProcessor.Automata(builder, graph)
 
     default_action = parser_state.rules['default']['default_action']
     self.default_action = Action(default_action[0], default_action[1]) if default_action else None