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.

182 lines
6.1 KiB

  1. import re
  2. from .utils import get_regexp_width
  3. from .parsers.grammar_analysis import GrammarAnalyzer
  4. from .lexer import Lexer, ContextualLexer, Token
  5. from .common import GrammarError
  6. from .parsers import lalr_parser, earley, xearley, resolve_ambig, cyk
  7. from .tree import Tree
  8. class WithLexer:
  9. def init_traditional_lexer(self, lexer_conf):
  10. self.lexer_conf = lexer_conf
  11. self.lexer = Lexer(lexer_conf.tokens, ignore=lexer_conf.ignore, user_callbacks=lexer_conf.callbacks)
  12. def init_contextual_lexer(self, lexer_conf, parser_conf):
  13. self.lexer_conf = lexer_conf
  14. states = {idx:list(t.keys()) for idx, t in self.parser._parse_table.states.items()}
  15. always_accept = lexer_conf.postlex.always_accept if lexer_conf.postlex else ()
  16. self.lexer = ContextualLexer(lexer_conf.tokens, states,
  17. ignore=lexer_conf.ignore,
  18. always_accept=always_accept,
  19. user_callbacks=lexer_conf.callbacks)
  20. def lex(self, text):
  21. stream = self.lexer.lex(text)
  22. if self.lexer_conf.postlex:
  23. return self.lexer_conf.postlex.process(stream)
  24. else:
  25. return stream
  26. class LALR(WithLexer):
  27. def __init__(self, lexer_conf, parser_conf, options=None):
  28. self.parser = lalr_parser.Parser(parser_conf)
  29. self.init_traditional_lexer(lexer_conf)
  30. def parse(self, text):
  31. token_stream = self.lex(text)
  32. return self.parser.parse(token_stream)
  33. class LALR_ContextualLexer(WithLexer):
  34. def __init__(self, lexer_conf, parser_conf, options=None):
  35. self.parser = lalr_parser.Parser(parser_conf)
  36. self.init_contextual_lexer(lexer_conf, parser_conf)
  37. def parse(self, text):
  38. token_stream = self.lex(text)
  39. return self.parser.parse(token_stream, self.lexer.set_parser_state)
  40. def get_ambiguity_resolver(options):
  41. if not options or options.ambiguity == 'resolve':
  42. return resolve_ambig.standard_resolve_ambig
  43. elif options.ambiguity == 'resolve__antiscore_sum':
  44. return resolve_ambig.antiscore_sum_resolve_ambig
  45. elif options.ambiguity == 'explicit':
  46. return None
  47. raise ValueError(options)
  48. def tokenize_text(text):
  49. line = 1
  50. col_start_pos = 0
  51. for i, ch in enumerate(text):
  52. if '\n' in ch:
  53. line += ch.count('\n')
  54. col_start_pos = i + ch.rindex('\n')
  55. yield Token('CHAR', ch, line=line, column=i - col_start_pos)
  56. class Earley(WithLexer):
  57. def __init__(self, lexer_conf, parser_conf, options=None):
  58. self.init_traditional_lexer(lexer_conf)
  59. self.parser = earley.Parser(parser_conf, self.match,
  60. resolve_ambiguity=get_ambiguity_resolver(options))
  61. def match(self, term, token):
  62. return term.name == token.type
  63. def parse(self, text):
  64. tokens = self.lex(text)
  65. return self.parser.parse(tokens)
  66. class XEarley:
  67. def __init__(self, lexer_conf, parser_conf, options=None):
  68. self.token_by_name = {t.name:t for t in lexer_conf.tokens}
  69. self._prepare_match(lexer_conf)
  70. self.parser = xearley.Parser(parser_conf,
  71. self.match,
  72. resolve_ambiguity=get_ambiguity_resolver(options),
  73. ignore=lexer_conf.ignore,
  74. predict_all=options.earley__predict_all
  75. )
  76. def match(self, term, text, index=0):
  77. return self.regexps[term.name].match(text, index)
  78. def _prepare_match(self, lexer_conf):
  79. self.regexps = {}
  80. for t in lexer_conf.tokens:
  81. regexp = t.pattern.to_regexp()
  82. try:
  83. width = get_regexp_width(regexp)[0]
  84. except ValueError:
  85. raise ValueError("Bad regexp in token %s: %s" % (t.name, regexp))
  86. else:
  87. if width == 0:
  88. raise ValueError("Dynamic Earley doesn't allow zero-width regexps", t)
  89. self.regexps[t.name] = re.compile(regexp)
  90. def parse(self, text):
  91. return self.parser.parse(text)
  92. class CYK(WithLexer):
  93. def __init__(self, lexer_conf, parser_conf, options=None):
  94. self.init_traditional_lexer(lexer_conf)
  95. self._analysis = GrammarAnalyzer(parser_conf)
  96. self._parser = cyk.Parser(parser_conf.rules, parser_conf.start)
  97. self._postprocess = {}
  98. for rule in parser_conf.rules:
  99. a = rule.alias
  100. self._postprocess[a] = a if callable(a) else (a and getattr(parser_conf.callback, a))
  101. def parse(self, text):
  102. tokens = list(self.lex(text))
  103. parse = self._parser.parse(tokens)
  104. parse = self._transform(parse)
  105. return parse
  106. def _transform(self, tree):
  107. subtrees = list(tree.iter_subtrees())
  108. for subtree in subtrees:
  109. subtree.children = [self._apply_callback(c) if isinstance(c, Tree) else c for c in subtree.children]
  110. return self._apply_callback(tree)
  111. def _apply_callback(self, tree):
  112. children = tree.children
  113. callback = self._postprocess[tree.rule.alias]
  114. assert callback, tree.rule.alias
  115. r = callback(children)
  116. return r
  117. def get_frontend(parser, lexer):
  118. if parser=='lalr':
  119. if lexer is None:
  120. raise ValueError('The LALR parser requires use of a lexer')
  121. elif lexer == 'standard':
  122. return LALR
  123. elif lexer == 'contextual':
  124. return LALR_ContextualLexer
  125. else:
  126. raise ValueError('Unknown lexer: %s' % lexer)
  127. elif parser=='earley':
  128. if lexer=='standard':
  129. return Earley
  130. elif lexer=='dynamic':
  131. return XEarley
  132. elif lexer=='contextual':
  133. raise ValueError('The Earley parser does not support the contextual parser')
  134. else:
  135. raise ValueError('Unknown lexer: %s' % lexer)
  136. elif parser == 'cyk':
  137. if lexer == 'standard':
  138. return CYK
  139. else:
  140. raise ValueError('CYK parser requires using standard parser.')
  141. else:
  142. raise ValueError('Unknown parser: %s' % parser)