This repo contains code to mirror other repos. It also contains the code that is getting mirrored.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

246 lines
8.6 KiB

  1. from .utils import get_regexp_width, Serialize
  2. from .parsers.grammar_analysis import GrammarAnalyzer
  3. from .lexer import TraditionalLexer, ContextualLexer, Lexer, Token, TerminalDef
  4. from .parsers import earley, xearley, cyk
  5. from .parsers.lalr_parser import LALR_Parser
  6. from .grammar import Rule
  7. from .tree import Tree
  8. from .common import LexerConf
  9. ###{standalone
  10. def get_frontend(parser, lexer):
  11. if parser=='lalr':
  12. if lexer is None:
  13. raise ValueError('The LALR parser requires use of a lexer')
  14. elif lexer == 'standard':
  15. return LALR_TraditionalLexer
  16. elif lexer == 'contextual':
  17. return LALR_ContextualLexer
  18. elif issubclass(lexer, Lexer):
  19. class LALR_CustomLexerWrapper(LALR_CustomLexer):
  20. def __init__(self, lexer_conf, parser_conf, options=None):
  21. super(LALR_CustomLexerWrapper, self).__init__(
  22. lexer, lexer_conf, parser_conf, options=options)
  23. def init_lexer(self):
  24. self.lexer = lexer(self.lexer_conf)
  25. return LALR_CustomLexerWrapper
  26. else:
  27. raise ValueError('Unknown lexer: %s' % lexer)
  28. elif parser=='earley':
  29. if lexer=='standard':
  30. return Earley
  31. elif lexer=='dynamic':
  32. return XEarley
  33. elif lexer=='dynamic_complete':
  34. return XEarley_CompleteLex
  35. elif lexer=='contextual':
  36. raise ValueError('The Earley parser does not support the contextual parser')
  37. else:
  38. raise ValueError('Unknown lexer: %s' % lexer)
  39. elif parser == 'cyk':
  40. if lexer == 'standard':
  41. return CYK
  42. else:
  43. raise ValueError('CYK parser requires using standard parser.')
  44. else:
  45. raise ValueError('Unknown parser: %s' % parser)
  46. class _ParserFrontend(Serialize):
  47. def _parse(self, input, start, *args):
  48. if start is None:
  49. start = self.start
  50. if len(start) > 1:
  51. raise ValueError("Lark initialized with more than 1 possible start rule. Must specify which start rule to parse", start)
  52. start ,= start
  53. return self.parser.parse(input, start, *args)
  54. def _get_lexer_callbacks(transformer, terminals):
  55. result = {}
  56. for terminal in terminals:
  57. callback = getattr(transformer, terminal.name, None)
  58. if callback is not None:
  59. result[terminal.name] = callback
  60. return result
  61. class WithLexer(_ParserFrontend):
  62. lexer = None
  63. parser = None
  64. lexer_conf = None
  65. start = None
  66. __serialize_fields__ = 'parser', 'lexer_conf', 'start'
  67. __serialize_namespace__ = LexerConf,
  68. def __init__(self, lexer_conf, parser_conf, options=None):
  69. self.lexer_conf = lexer_conf
  70. self.start = parser_conf.start
  71. self.postlex = lexer_conf.postlex
  72. @classmethod
  73. def deserialize(cls, data, memo, callbacks, postlex, transformer, re_module):
  74. inst = super(WithLexer, cls).deserialize(data, memo)
  75. inst.postlex = postlex
  76. inst.parser = LALR_Parser.deserialize(inst.parser, memo, callbacks)
  77. terminals = [item for item in memo.values() if isinstance(item, TerminalDef)]
  78. inst.lexer_conf.callbacks = _get_lexer_callbacks(transformer, terminals)
  79. inst.lexer_conf.re_module = re_module
  80. inst.lexer_conf.skip_validation=True
  81. inst.init_lexer()
  82. return inst
  83. def _serialize(self, data, memo):
  84. data['parser'] = data['parser'].serialize(memo)
  85. def lex(self, *args):
  86. stream = self.lexer.lex(*args)
  87. return self.postlex.process(stream) if self.postlex else stream
  88. def parse(self, text, start=None):
  89. token_stream = self.lex(text)
  90. return self._parse(token_stream, start)
  91. def init_traditional_lexer(self):
  92. self.lexer = TraditionalLexer(self.lexer_conf)
  93. class LALR_WithLexer(WithLexer):
  94. def __init__(self, lexer_conf, parser_conf, options=None):
  95. debug = options.debug if options else False
  96. self.parser = LALR_Parser(parser_conf, debug=debug)
  97. WithLexer.__init__(self, lexer_conf, parser_conf, options)
  98. self.init_lexer()
  99. def init_lexer(self, **kw):
  100. raise NotImplementedError()
  101. class LALR_TraditionalLexer(LALR_WithLexer):
  102. def init_lexer(self):
  103. self.init_traditional_lexer()
  104. class LALR_ContextualLexer(LALR_WithLexer):
  105. def init_lexer(self):
  106. states = {idx:list(t.keys()) for idx, t in self.parser._parse_table.states.items()}
  107. always_accept = self.postlex.always_accept if self.postlex else ()
  108. self.lexer = ContextualLexer(self.lexer_conf, states, always_accept=always_accept)
  109. def parse(self, text, start=None):
  110. parser_state = [None]
  111. def set_parser_state(s):
  112. parser_state[0] = s
  113. token_stream = self.lex(text, lambda: parser_state[0])
  114. return self._parse(token_stream, start, set_parser_state)
  115. ###}
  116. class LALR_CustomLexer(LALR_WithLexer):
  117. def __init__(self, lexer_cls, lexer_conf, parser_conf, options=None):
  118. self.lexer = lexer_cls(lexer_conf)
  119. debug = options.debug if options else False
  120. self.parser = LALR_Parser(parser_conf, debug=debug)
  121. WithLexer.__init__(self, lexer_conf, parser_conf, options)
  122. def tokenize_text(text):
  123. line = 1
  124. col_start_pos = 0
  125. for i, ch in enumerate(text):
  126. if '\n' in ch:
  127. line += ch.count('\n')
  128. col_start_pos = i + ch.rindex('\n')
  129. yield Token('CHAR', ch, line=line, column=i - col_start_pos)
  130. class Earley(WithLexer):
  131. def __init__(self, lexer_conf, parser_conf, options=None):
  132. WithLexer.__init__(self, lexer_conf, parser_conf, options)
  133. self.init_traditional_lexer()
  134. resolve_ambiguity = options.ambiguity == 'resolve'
  135. debug = options.debug if options else False
  136. self.parser = earley.Parser(parser_conf, self.match, resolve_ambiguity=resolve_ambiguity, debug=debug)
  137. def match(self, term, token):
  138. return term.name == token.type
  139. class XEarley(_ParserFrontend):
  140. def __init__(self, lexer_conf, parser_conf, options=None, **kw):
  141. self.token_by_name = {t.name:t for t in lexer_conf.tokens}
  142. self.start = parser_conf.start
  143. self._prepare_match(lexer_conf)
  144. resolve_ambiguity = options.ambiguity == 'resolve'
  145. debug = options.debug if options else False
  146. self.parser = xearley.Parser(parser_conf,
  147. self.match,
  148. ignore=lexer_conf.ignore,
  149. resolve_ambiguity=resolve_ambiguity,
  150. debug=debug,
  151. **kw
  152. )
  153. def match(self, term, text, index=0):
  154. return self.regexps[term.name].match(text, index)
  155. def _prepare_match(self, lexer_conf):
  156. self.regexps = {}
  157. for t in lexer_conf.tokens:
  158. if t.priority != 1:
  159. raise ValueError("Dynamic Earley doesn't support weights on terminals", t, t.priority)
  160. regexp = t.pattern.to_regexp()
  161. try:
  162. width = get_regexp_width(regexp)[0]
  163. except ValueError:
  164. raise ValueError("Bad regexp in token %s: %s" % (t.name, regexp))
  165. else:
  166. if width == 0:
  167. raise ValueError("Dynamic Earley doesn't allow zero-width regexps", t)
  168. if lexer_conf.use_bytes:
  169. regexp = regexp.encode('utf-8')
  170. self.regexps[t.name] = lexer_conf.re_module.compile(regexp, lexer_conf.g_regex_flags)
  171. def parse(self, text, start):
  172. return self._parse(text, start)
  173. class XEarley_CompleteLex(XEarley):
  174. def __init__(self, *args, **kw):
  175. XEarley.__init__(self, *args, complete_lex=True, **kw)
  176. class CYK(WithLexer):
  177. def __init__(self, lexer_conf, parser_conf, options=None):
  178. WithLexer.__init__(self, lexer_conf, parser_conf, options)
  179. self.init_traditional_lexer()
  180. self._analysis = GrammarAnalyzer(parser_conf)
  181. self.parser = cyk.Parser(parser_conf.rules)
  182. self.callbacks = parser_conf.callbacks
  183. def parse(self, text, start):
  184. tokens = list(self.lex(text))
  185. parse = self._parse(tokens, start)
  186. parse = self._transform(parse)
  187. return parse
  188. def _transform(self, tree):
  189. subtrees = list(tree.iter_subtrees())
  190. for subtree in subtrees:
  191. subtree.children = [self._apply_callback(c) if isinstance(c, Tree) else c for c in subtree.children]
  192. return self._apply_callback(tree)
  193. def _apply_callback(self, tree):
  194. return self.callbacks[tree.rule](tree.children)