Research portable Memory game | Исследовать портируемую игру Память
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.

101 lines
2.5KB

  1. from Function import *
  2. def translateParameter(s):
  3. # name: type -> type name
  4. parts = s.split(": ")
  5. indent = len(s) - len(s.lstrip())
  6. name = parts[0].lstrip()
  7. t = translateType(parts[1])
  8. indentation = "".join(" " * indent)
  9. return f"{indentation}{t} {name}"
  10. def translateStatement(s):
  11. indent = len(s) - len(s.lstrip())
  12. indentation = "".join(" " * indent)
  13. ss = s.lstrip()
  14. posColon = ss.find(": ")
  15. posComma = ss.find(", ")
  16. posEqual = ss.find(" = ")
  17. posFor = ss.find("for ")
  18. posIn = ss.find(" in ")
  19. posRange = ss.find("range(")
  20. posRangeEnd = ss.find("):")
  21. posClosingScope = ss.find("#}")
  22. # #} -> }
  23. if posClosingScope != -1:
  24. return f"{indentation}}}"
  25. # for name in range(x, y): -> for (auto name = x; name < y; ++name) {
  26. if (
  27. posFor >= 0 and
  28. posIn >= 0 and
  29. posRange >= 0
  30. ):
  31. name = ss[posFor + len("for "):posIn]
  32. x = ss[posRange + len("range("):posComma]
  33. y = ss[posComma + len(", "):posRangeEnd]
  34. return f"{indentation}for (auto {name} = {x}; {name} < {y}; ++{name}) {{"
  35. # name: type = value -> type name = value
  36. if (
  37. posColon >= 0 and
  38. posEqual >= 0
  39. ):
  40. name = ss[:posColon]
  41. type = ss[posColon + len(": "):posEqual]
  42. t = translateType(type)
  43. value = ss[posEqual + len(" = "):]
  44. return f"{indentation}{t} {name} = {value};"
  45. # name = value -> auto name = value
  46. if (
  47. posColon == -1 and
  48. posEqual >= 0
  49. ):
  50. name = ss[:posEqual]
  51. value = ss[posEqual + len(" = "):]
  52. return f"{indentation}auto {name} = {value};"
  53. # Unknown. Return as is.
  54. return s
  55. def translateType(s):
  56. # dict[X, Y] -> std::map<X, Y>
  57. if s.startswith("dict["):
  58. kv = s[len("dict["):-len("]")]
  59. parts = kv.split(", ")
  60. return f"std::map<{parts[0]}, {parts[1]}>"
  61. # Unknown. Return as is.
  62. return s
  63. class CPP:
  64. def __init__(self, fn):
  65. self.fn = fn
  66. def translate(self):
  67. returnType = translateType(self.fn.returnType)
  68. # Parameters.
  69. params = []
  70. for i in range(0, len(self.fn.parameters)):
  71. p = translateParameter(self.fn.parameters[i])
  72. params.append(p)
  73. strparams = "\n".join(params)
  74. # Statements.
  75. sts = []
  76. for i in range(0, len(self.fn.statements)):
  77. s = translateStatement(self.fn.statements[i])
  78. sts.append(s)
  79. strstatements = "\n".join(sts)
  80. return f"""{returnType} {self.fn.name}(
  81. {strparams}
  82. ) {{
  83. {strstatements}
  84. }}
  85. """