| OLD | NEW |
| 1 # Copyright 2013 the V8 project authors. All rights reserved. | 1 # Copyright 2013 the V8 project authors. All rights reserved. |
| 2 # Redistribution and use in source and binary forms, with or without | 2 # Redistribution and use in source and binary forms, with or without |
| 3 # modification, are permitted provided that the following conditions are | 3 # modification, are permitted provided that the following conditions are |
| 4 # met: | 4 # met: |
| 5 # | 5 # |
| 6 # * Redistributions of source code must retain the above copyright | 6 # * Redistributions of source code must retain the above copyright |
| 7 # notice, this list of conditions and the following disclaimer. | 7 # notice, this list of conditions and the following disclaimer. |
| 8 # * Redistributions in binary form must reproduce the above | 8 # * Redistributions in binary form must reproduce the above |
| 9 # copyright notice, this list of conditions and the following | 9 # copyright notice, this list of conditions and the following |
| 10 # disclaimer in the documentation and/or other materials provided | 10 # disclaimer in the documentation and/or other materials provided |
| (...skipping 13 matching lines...) Expand all Loading... |
| 24 # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 import ply.lex as lex | 28 import ply.lex as lex |
| 29 | 29 |
| 30 class RuleLexer: | 30 class RuleLexer: |
| 31 | 31 |
| 32 tokens = ( | 32 tokens = ( |
| 33 'ALIAS', | 33 'ALIAS', |
| 34 'CONDITION_TRANSITION', | 34 'EQUALS', |
| 35 'CONDITION' | 35 'REGEX', |
| 36 'CONDITION', |
| 37 'CONDITION_BEGIN', |
| 38 'CONDITION_END', |
| 39 'REGEX_AND_TRANSITION', |
| 40 'REGEX_AND_BODY', |
| 36 ) | 41 ) |
| 37 | 42 |
| 38 t_ignore = " \t\n" | 43 t_ANY_ignore = " \t\n" |
| 44 |
| 45 states = ( |
| 46 ('afterAlias', 'exclusive'), |
| 47 ('afterAliasEquals', 'exclusive'), |
| 48 ('inCondition', 'exclusive'), |
| 49 ('seenCondition', 'exclusive'), |
| 50 ('afterCondition', 'exclusive')) |
| 39 | 51 |
| 40 def t_ALIAS(self, t): | 52 def t_ALIAS(self, t): |
| 41 r'\s*(?P<name>[a-zA-Z0-9_]+)\s*=\s*(?P<regex>.+)\s*;\s*' | 53 r'[a-zA-Z0-9_]+' |
| 54 self.lexer.begin('afterAlias') |
| 42 return t | 55 return t |
| 43 | 56 |
| 44 def t_CONDITION_TRANSITION(self, t): | 57 def t_afterAlias_EQUALS(self, t): |
| 45 r'\s*<(?P<old>[a-zA-Z]+)>\s*(?P<regex>.+)\s*:=>\s*(?P<new>.+)\s*' | 58 r'=' |
| 59 self.lexer.begin('afterAliasEquals') |
| 46 return t | 60 return t |
| 47 | 61 |
| 48 def t_CONDITION(self, t): | 62 def t_afterAliasEquals_REGEX(self, t): |
| 49 r'\s*<(?P<old>[a-zA-Z]+)>\s*(?P<regex>.+)\s*{(?P<body>.+)}\s*' | 63 r'(?P<regex>.+)\s*;' |
| 64 self.lexer.begin('INITIAL') |
| 65 return t |
| 66 |
| 67 def t_CONDITION_BEGIN(self, t): |
| 68 r'<' |
| 69 self.lexer.begin('inCondition') |
| 70 return t |
| 71 |
| 72 def t_inCondition_CONDITION(self, t): |
| 73 r'[a-zA-Z0-9_]+' |
| 74 self.lexer.begin('seenCondition') |
| 75 return t |
| 76 |
| 77 def t_seenCondition_CONDITION_END(self, t): |
| 78 r'>' |
| 79 self.lexer.begin('afterCondition') |
| 80 return t |
| 81 |
| 82 def t_afterCondition_REGEX_AND_TRANSITION(self, t): |
| 83 r'(?P<regex>.+)\s*:=>\s*(?P<new>.+)\s*' |
| 84 self.lexer.begin('INITIAL') |
| 85 return t |
| 86 |
| 87 def t_afterCondition_REGEX_AND_BODY(self, t): |
| 88 r'(?P<regex>.+)\s*{\s*(?P<body>.+)\s*}\s*' |
| 89 self.lexer.begin('INITIAL') |
| 50 return t | 90 return t |
| 51 | 91 |
| 52 def t_error(self, t): | 92 def t_error(self, t): |
| 53 raise Exception("Illegal character '%s'" % t.value[0]) | 93 raise Exception("Illegal character '%s'" % t.value[0]) |
| 54 | 94 |
| 55 def build(self, **kwargs): | 95 def build(self, **kwargs): |
| 56 self.lexer = lex.lex(module=self, **kwargs) | 96 self.lexer = lex.lex(module=self, **kwargs) |
| OLD | NEW |