AST.h 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409
  1. /*
  2. * Copyright (c) 2023, Dan Klishch <danilklishch@gmail.com>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #pragma once
  7. #include <AK/Badge.h>
  8. #include <AK/RefCounted.h>
  9. #include <AK/RefPtr.h>
  10. #include <AK/Vector.h>
  11. #include "Forward.h"
  12. namespace JSSpecCompiler {
  13. template<typename T>
  14. RefPtr<T> as(NullableTree const& tree)
  15. {
  16. return dynamic_cast<T*>(tree.ptr());
  17. }
  18. class NodeSubtreePointer {
  19. public:
  20. NodeSubtreePointer(Tree* tree_ptr)
  21. : m_tree_ptr(tree_ptr)
  22. {
  23. }
  24. NodeSubtreePointer(NullableTree* tree_ptr)
  25. : m_tree_ptr(tree_ptr)
  26. {
  27. }
  28. Tree get(Badge<RecursiveASTVisitor>);
  29. void replace_subtree(Badge<RecursiveASTVisitor>, NullableTree replacement);
  30. private:
  31. Variant<Tree*, NullableTree*> m_tree_ptr;
  32. };
  33. // ===== Generic nodes =====
  34. class Node : public RefCounted<Node> {
  35. public:
  36. virtual ~Node() = default;
  37. void format_tree(StringBuilder& builder);
  38. // For expressions, order must be the same as the evaluation order.
  39. virtual Vector<NodeSubtreePointer> subtrees() { return {}; }
  40. virtual bool is_type() { return false; }
  41. protected:
  42. template<typename... Parameters>
  43. void dump_node(StringBuilder& builder, AK::CheckedFormatString<Parameters...>&& fmtstr, Parameters const&... parameters);
  44. virtual void dump_tree(StringBuilder& builder) = 0;
  45. };
  46. class ErrorNode : public Node {
  47. public:
  48. ErrorNode(StringView error = ""sv)
  49. : m_error(error)
  50. {
  51. }
  52. StringView m_error;
  53. protected:
  54. void dump_tree(StringBuilder& builder) override;
  55. };
  56. inline Tree const error_tree = make_ref_counted<ErrorNode>();
  57. // ===== Concrete evaluatable nodes =====
  58. class MathematicalConstant : public Node {
  59. public:
  60. MathematicalConstant(i64 number)
  61. : m_number(number)
  62. {
  63. }
  64. // TODO: This should be able to hold arbitrary number
  65. i64 m_number;
  66. protected:
  67. void dump_tree(StringBuilder& builder) override;
  68. };
  69. class StringLiteral : public Node {
  70. public:
  71. StringLiteral(StringView literal)
  72. : m_literal(literal)
  73. {
  74. }
  75. StringView m_literal;
  76. protected:
  77. void dump_tree(StringBuilder& builder) override;
  78. };
  79. #define ENUMERATE_UNARY_OPERATORS(F) \
  80. F(Invalid) \
  81. F(Minus) \
  82. F(AssertCompletion)
  83. #define ENUMERATE_BINARY_OPERATORS(F) \
  84. F(Invalid) \
  85. F(CompareLess) \
  86. F(CompareGreater) \
  87. F(CompareNotEqual) \
  88. F(CompareEqual) \
  89. F(Assignment) \
  90. F(Declaration) \
  91. F(Plus) \
  92. F(Minus) \
  93. F(Multiplication) \
  94. F(Division) \
  95. F(Comma) \
  96. F(MemberAccess) \
  97. F(FunctionCall) \
  98. F(ArraySubscript)
  99. #define NAME(name) name,
  100. #define STRINGIFY(name) #name##sv,
  101. enum class UnaryOperator {
  102. ENUMERATE_UNARY_OPERATORS(NAME)
  103. };
  104. inline constexpr StringView unary_operator_names[] = {
  105. ENUMERATE_UNARY_OPERATORS(STRINGIFY)
  106. };
  107. enum class BinaryOperator {
  108. #define NAME(name) name,
  109. ENUMERATE_BINARY_OPERATORS(NAME)
  110. };
  111. inline constexpr StringView binary_operator_names[] = {
  112. ENUMERATE_BINARY_OPERATORS(STRINGIFY)
  113. };
  114. #undef NAME
  115. #undef STRINGIFY
  116. class BinaryOperation : public Node {
  117. public:
  118. BinaryOperation(BinaryOperator operation, Tree left, Tree right)
  119. : m_operation(operation)
  120. , m_left(move(left))
  121. , m_right(move(right))
  122. {
  123. }
  124. Vector<NodeSubtreePointer> subtrees() override;
  125. BinaryOperator m_operation;
  126. Tree m_left;
  127. Tree m_right;
  128. protected:
  129. void dump_tree(StringBuilder& builder) override;
  130. };
  131. class UnaryOperation : public Node {
  132. public:
  133. UnaryOperation(UnaryOperator operation, Tree operand)
  134. : m_operation(operation)
  135. , m_operand(move(operand))
  136. {
  137. }
  138. Vector<NodeSubtreePointer> subtrees() override;
  139. UnaryOperator m_operation;
  140. Tree m_operand;
  141. protected:
  142. void dump_tree(StringBuilder& builder) override;
  143. };
  144. class IsOneOfOperation : public Node {
  145. public:
  146. IsOneOfOperation(Tree operand, Vector<Tree>&& compare_values)
  147. : m_operand(move(operand))
  148. , m_compare_values(move(compare_values))
  149. {
  150. }
  151. Vector<NodeSubtreePointer> subtrees() override;
  152. Tree m_operand;
  153. Vector<Tree> m_compare_values;
  154. protected:
  155. void dump_tree(StringBuilder& builder) override;
  156. };
  157. class UnresolvedReference : public Node {
  158. public:
  159. UnresolvedReference(StringView name)
  160. : m_name(name)
  161. {
  162. }
  163. StringView m_name;
  164. protected:
  165. void dump_tree(StringBuilder& builder) override;
  166. };
  167. class ReturnExpression : public Node {
  168. public:
  169. ReturnExpression(Tree return_value)
  170. : m_return_value(move(return_value))
  171. {
  172. }
  173. Vector<NodeSubtreePointer> subtrees() override;
  174. Tree m_return_value;
  175. protected:
  176. void dump_tree(StringBuilder& builder) override;
  177. };
  178. class AssertExpression : public Node {
  179. public:
  180. AssertExpression(Tree condition)
  181. : m_condition(move(condition))
  182. {
  183. }
  184. Vector<NodeSubtreePointer> subtrees() override;
  185. Tree m_condition;
  186. protected:
  187. void dump_tree(StringBuilder& builder) override;
  188. };
  189. class IfBranch : public Node {
  190. public:
  191. IfBranch(Tree condition, Tree branch)
  192. : m_condition(move(condition))
  193. , m_branch(move(branch))
  194. {
  195. }
  196. Vector<NodeSubtreePointer> subtrees() override;
  197. Tree m_condition;
  198. Tree m_branch;
  199. protected:
  200. void dump_tree(StringBuilder& builder) override;
  201. };
  202. class ElseIfBranch : public Node {
  203. public:
  204. ElseIfBranch(NullableTree condition, Tree branch)
  205. : m_condition(move(condition))
  206. , m_branch(move(branch))
  207. {
  208. }
  209. Vector<NodeSubtreePointer> subtrees() override;
  210. NullableTree m_condition;
  211. Tree m_branch;
  212. protected:
  213. void dump_tree(StringBuilder& builder) override;
  214. };
  215. class IfElseIfChain : public Node {
  216. public:
  217. IfElseIfChain(Vector<Tree>&& conditions, Vector<Tree>&& branches, NullableTree else_branch)
  218. : m_conditions(move(conditions))
  219. , m_branches(move(branches))
  220. , m_else_branch(move(else_branch))
  221. {
  222. VERIFY(m_branches.size() == m_conditions.size());
  223. }
  224. Vector<NodeSubtreePointer> subtrees() override;
  225. // Excluding else branch, if one is present
  226. size_t branches_count() const { return m_branches.size(); }
  227. Vector<Tree> m_conditions;
  228. Vector<Tree> m_branches;
  229. NullableTree m_else_branch;
  230. protected:
  231. void dump_tree(StringBuilder& builder) override;
  232. };
  233. class TreeList : public Node {
  234. public:
  235. TreeList(Vector<Tree>&& expressions_)
  236. : m_expressions(move(expressions_))
  237. {
  238. }
  239. Vector<NodeSubtreePointer> subtrees() override;
  240. Vector<Tree> m_expressions;
  241. protected:
  242. void dump_tree(StringBuilder& builder) override;
  243. };
  244. class RecordDirectListInitialization : public Node {
  245. public:
  246. struct Argument {
  247. Tree name;
  248. Tree value;
  249. };
  250. RecordDirectListInitialization(Tree type_reference, Vector<Argument>&& arguments)
  251. : m_type_reference(move(type_reference))
  252. , m_arguments(move(arguments))
  253. {
  254. }
  255. Vector<NodeSubtreePointer> subtrees() override;
  256. Tree m_type_reference;
  257. Vector<Argument> m_arguments;
  258. protected:
  259. void dump_tree(StringBuilder& builder) override;
  260. };
  261. class FunctionCall : public Node {
  262. public:
  263. FunctionCall(Tree name, Vector<Tree>&& arguments)
  264. : m_name(move(name))
  265. , m_arguments(move(arguments))
  266. {
  267. }
  268. Vector<NodeSubtreePointer> subtrees() override;
  269. Tree m_name;
  270. Vector<Tree> m_arguments;
  271. protected:
  272. void dump_tree(StringBuilder& builder) override;
  273. };
  274. class SlotName : public Node {
  275. public:
  276. SlotName(StringView member_name)
  277. : m_member_name(member_name)
  278. {
  279. }
  280. StringView m_member_name;
  281. protected:
  282. void dump_tree(StringBuilder& builder) override;
  283. };
  284. class Variable : public Node {
  285. public:
  286. Variable(StringView variable_name)
  287. : m_name(variable_name)
  288. {
  289. }
  290. StringView m_name;
  291. protected:
  292. void dump_tree(StringBuilder& builder) override;
  293. };
  294. class FunctionPointer : public Node {
  295. public:
  296. FunctionPointer(StringView function_name)
  297. : m_function(function_name)
  298. {
  299. }
  300. Variant<StringView, FunctionRef> m_function;
  301. protected:
  302. void dump_tree(StringBuilder& builder) override;
  303. };
  304. }
  305. namespace AK {
  306. template<>
  307. struct Formatter<JSSpecCompiler::Tree> : Formatter<StringView> {
  308. ErrorOr<void> format(FormatBuilder& builder, JSSpecCompiler::Tree const& tree)
  309. {
  310. tree->format_tree(builder.builder());
  311. return {};
  312. }
  313. };
  314. }