compiler.py 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186
  1. import cPickle as pickle
  2. import os
  3. import sys
  4. from grammar_compiler_visitor import GrammarCompilerVisitor
  5. from hutnparser import Parser, Tree
  6. from meta_grammar import Grammar
  7. from cached_exception import CachedException
  8. global parsers
  9. parsers = {}
  10. sys.setrecursionlimit(2000)
  11. def read(filename):
  12. with open(filename, 'r') as f:
  13. return f.read()
  14. def do_parse(inputfile, grammarfile):
  15. new_grammar = True
  16. picklefile = grammarfile + ".pickle"
  17. if grammarfile not in parsers:
  18. try:
  19. if os.path.getmtime(picklefile) > os.path.getmtime(grammarfile):
  20. # Pickle is more recent than grammarfile, so use it
  21. with open(picklefile, 'rb') as f:
  22. grammar = pickle.load(f)
  23. new_grammar = False
  24. else:
  25. # Will be catched immediately
  26. raise Exception()
  27. except:
  28. result = parser = Parser(Grammar(), hide_implicit = True).parse(read(grammarfile))
  29. if result['status'] != Parser.Constants.Success:
  30. print 'not a valid grammar!'
  31. print result
  32. tree = result['tree']
  33. visitor = GrammarCompilerVisitor()
  34. structure = visitor.visit(tree)
  35. grammar = Grammar()
  36. grammar.rules = structure['rules']
  37. grammar.tokens = structure['tokens']
  38. with open(picklefile, 'wb') as f:
  39. pickle.dump(grammar, f, pickle.HIGHEST_PROTOCOL)
  40. parsers[grammarfile] = grammar
  41. else:
  42. new_grammar = False
  43. grammar = parsers[grammarfile]
  44. picklefile = inputfile + ".pickle"
  45. try:
  46. if os.path.getmtime(picklefile) > os.path.getmtime(inputfile):
  47. # Pickle is more recent than inputfile, so use it
  48. with open(picklefile, 'rb') as f:
  49. result = pickle.load(f)
  50. else:
  51. # Inputfile has changed
  52. raise Exception()
  53. except:
  54. result = Parser(grammar, line_position = True).parse(read(inputfile))
  55. if result['status'] != Parser.Constants.Success:
  56. msg = "%s:%s:%s: %s" % (inputfile, result["line"], result["column"], result["text"])
  57. raise Exception(msg)
  58. with open(picklefile, 'wb') as f:
  59. pickle.dump(result, f, pickle.HIGHEST_PROTOCOL)
  60. return result
  61. def find_file(filename, include_paths):
  62. import os.path
  63. include_paths = ["."] + \
  64. [os.path.abspath(os.path.dirname(working_file))] + \
  65. [os.path.abspath("%s/../includes/" % (os.path.dirname(os.path.abspath(__file__))))] + \
  66. include_paths + \
  67. []
  68. attempts = []
  69. for include in include_paths:
  70. testfile = include + os.sep + filename
  71. if os.path.isfile(os.path.abspath(testfile)):
  72. return os.path.abspath(testfile)
  73. else:
  74. attempts.append(os.path.abspath(testfile))
  75. else:
  76. raise Exception("Could not resolve file %s. Tried: %s" % (filename, attempts))
  77. def do_compile(inputfile, grammarfile, visitors=[], include_paths = []):
  78. import os.path
  79. global working_file
  80. working_file = os.path.abspath(inputfile)
  81. result = do_parse(inputfile, grammarfile)
  82. error = result["status"] != Parser.Constants.Success
  83. if error:
  84. msg = "%s:%s:%s: %s" % (inputfile, result["line"], result["column"], result["text"])
  85. raise Exception(msg)
  86. else:
  87. for child in result["tree"].tail:
  88. child.inputfile = inputfile
  89. included = set()
  90. while True:
  91. for i, v in enumerate(result["tree"].tail):
  92. if v.head == "include":
  93. # Expand this node
  94. for j in v.tail:
  95. if j.head == "STRVALUE":
  96. f = str(j.tail[0])[1:-1]
  97. if f in included:
  98. subtree = []
  99. else:
  100. name = str(j.tail[0])[1:-1]
  101. subtree = do_parse(find_file(name, include_paths), grammarfile)["tree"].tail
  102. if subtree is None:
  103. raise Exception("Parsing error for included file %s" % find_file(name, include_paths))
  104. for t in subtree:
  105. t.inputfile = name
  106. included.add(f)
  107. # Found the string value, so break from the inner for ("searching for element")
  108. break
  109. # Merge all nodes in
  110. before = result["tree"].tail[:i]
  111. after = result["tree"].tail[i+1:]
  112. result["tree"].tail = before + subtree + after
  113. # Found an include node, but to prevent corruption of the tree, we need to start over again, so break from the outer for loop
  114. break
  115. else:
  116. # The outer for finally finished, so there were no includes remaining, thus terminate the infinite while loop
  117. break
  118. result["tree"].fix_tracability(inputfile)
  119. for visitor in visitors:
  120. visitor.visit(result["tree"])
  121. if visitors:
  122. return visitors[-1].dump()
  123. def main(input_file, grammar_file, mode, args=[], symbols=None):
  124. from prettyprint_visitor import PrettyPrintVisitor
  125. from prettyprint_visitor import PrintVisitor
  126. from semantics_visitor import SemanticsVisitor
  127. from bootstrap_visitor import BootstrapVisitor
  128. from primitives_visitor import PrimitivesVisitor
  129. from primitives_object_visitor import PrimitivesObjectVisitor
  130. from constructors_visitor import ConstructorsVisitor
  131. from constructors_object_visitor import ConstructorsObjectVisitor
  132. from model_visitor import ModelVisitor
  133. from model_bootstrap_visitor import ModelBootstrapVisitor
  134. from model_object_visitor import ModelObjectVisitor
  135. modes = {
  136. "N" : [],
  137. "P" : [PrintVisitor],
  138. "PP" : [PrettyPrintVisitor],
  139. "S" : [SemanticsVisitor],
  140. "PS" : [SemanticsVisitor, PrimitivesVisitor],
  141. "PO" : [SemanticsVisitor, PrimitivesObjectVisitor],
  142. "BS" : [SemanticsVisitor, BootstrapVisitor],
  143. "CS" : [SemanticsVisitor, ConstructorsVisitor],
  144. "CO" : [SemanticsVisitor, ConstructorsObjectVisitor],
  145. "M" : [ModelVisitor],
  146. "MB" : [ModelBootstrapVisitor],
  147. "MO" : [ModelObjectVisitor],
  148. }
  149. try:
  150. visitors = [v(args) for v in modes[mode]]
  151. result = do_compile(input_file, grammar_file, visitors)
  152. if symbols is not None and mode == "BS":
  153. symbols.update(visitors[-1].object_symbols)
  154. except CachedException:
  155. return True
  156. return result
  157. if __name__ == "__main__":
  158. if len(sys.argv) <= 2:
  159. print("Invocation: ")
  160. print(" %s input_file grammar_file mode [mode_params]*" % sys.argv[0])
  161. sys.exit(1)
  162. else:
  163. value = main(sys.argv[1], sys.argv[2], sys.argv[3], sys.argv[4:])
  164. if value is not None:
  165. print(value)