Parser.cpp 40 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113
  1. /*
  2. * Copyright (c) 2021, Tim Flynn <trflynn89@pm.me>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include "Parser.h"
  7. #include <AK/ScopeGuard.h>
  8. #include <AK/TypeCasts.h>
  9. namespace SQL::AST {
  10. Parser::Parser(Lexer lexer)
  11. : m_parser_state(move(lexer))
  12. {
  13. }
  14. NonnullRefPtr<Statement> Parser::next_statement()
  15. {
  16. auto terminate_statement = [this](auto statement) {
  17. consume(TokenType::SemiColon);
  18. return statement;
  19. };
  20. if (match(TokenType::With)) {
  21. auto common_table_expression_list = parse_common_table_expression_list();
  22. if (!common_table_expression_list)
  23. return create_ast_node<ErrorStatement>();
  24. return terminate_statement(parse_statement_with_expression_list(move(common_table_expression_list)));
  25. }
  26. return terminate_statement(parse_statement());
  27. }
  28. NonnullRefPtr<Statement> Parser::parse_statement()
  29. {
  30. switch (m_parser_state.m_token.type()) {
  31. case TokenType::Create:
  32. consume();
  33. if (match(TokenType::Schema))
  34. return parse_create_schema_statement();
  35. else
  36. return parse_create_table_statement();
  37. case TokenType::Alter:
  38. return parse_alter_table_statement();
  39. case TokenType::Drop:
  40. return parse_drop_table_statement();
  41. case TokenType::Insert:
  42. return parse_insert_statement({});
  43. case TokenType::Update:
  44. return parse_update_statement({});
  45. case TokenType::Delete:
  46. return parse_delete_statement({});
  47. case TokenType::Select:
  48. return parse_select_statement({});
  49. default:
  50. expected("CREATE, ALTER, DROP, INSERT, UPDATE, DELETE, or SELECT");
  51. return create_ast_node<ErrorStatement>();
  52. }
  53. }
  54. NonnullRefPtr<Statement> Parser::parse_statement_with_expression_list(RefPtr<CommonTableExpressionList> common_table_expression_list)
  55. {
  56. switch (m_parser_state.m_token.type()) {
  57. case TokenType::Insert:
  58. return parse_insert_statement(move(common_table_expression_list));
  59. case TokenType::Update:
  60. return parse_update_statement(move(common_table_expression_list));
  61. case TokenType::Delete:
  62. return parse_delete_statement(move(common_table_expression_list));
  63. case TokenType::Select:
  64. return parse_select_statement(move(common_table_expression_list));
  65. default:
  66. expected("INSERT, UPDATE, DELETE or SELECT");
  67. return create_ast_node<ErrorStatement>();
  68. }
  69. }
  70. NonnullRefPtr<CreateSchema> Parser::parse_create_schema_statement()
  71. {
  72. consume(TokenType::Schema);
  73. bool is_error_if_exists = true;
  74. if (consume_if(TokenType::If)) {
  75. consume(TokenType::Not);
  76. consume(TokenType::Exists);
  77. is_error_if_exists = false;
  78. }
  79. String schema_name = consume(TokenType::Identifier).value();
  80. return create_ast_node<CreateSchema>(move(schema_name), is_error_if_exists);
  81. }
  82. NonnullRefPtr<CreateTable> Parser::parse_create_table_statement()
  83. {
  84. // https://sqlite.org/lang_createtable.html
  85. bool is_temporary = false;
  86. if (consume_if(TokenType::Temp) || consume_if(TokenType::Temporary))
  87. is_temporary = true;
  88. consume(TokenType::Table);
  89. bool is_error_if_table_exists = true;
  90. if (consume_if(TokenType::If)) {
  91. consume(TokenType::Not);
  92. consume(TokenType::Exists);
  93. is_error_if_table_exists = false;
  94. }
  95. String schema_name;
  96. String table_name;
  97. parse_schema_and_table_name(schema_name, table_name);
  98. if (consume_if(TokenType::As)) {
  99. auto select_statement = parse_select_statement({});
  100. return create_ast_node<CreateTable>(move(schema_name), move(table_name), move(select_statement), is_temporary, is_error_if_table_exists);
  101. }
  102. NonnullRefPtrVector<ColumnDefinition> column_definitions;
  103. parse_comma_separated_list(true, [&]() { column_definitions.append(parse_column_definition()); });
  104. // FIXME: Parse "table-constraint".
  105. return create_ast_node<CreateTable>(move(schema_name), move(table_name), move(column_definitions), is_temporary, is_error_if_table_exists);
  106. }
  107. NonnullRefPtr<AlterTable> Parser::parse_alter_table_statement()
  108. {
  109. // https://sqlite.org/lang_altertable.html
  110. consume(TokenType::Alter);
  111. consume(TokenType::Table);
  112. String schema_name;
  113. String table_name;
  114. parse_schema_and_table_name(schema_name, table_name);
  115. if (consume_if(TokenType::Add)) {
  116. consume_if(TokenType::Column); // COLUMN is optional.
  117. auto column = parse_column_definition();
  118. return create_ast_node<AddColumn>(move(schema_name), move(table_name), move(column));
  119. }
  120. if (consume_if(TokenType::Drop)) {
  121. consume_if(TokenType::Column); // COLUMN is optional.
  122. auto column = consume(TokenType::Identifier).value();
  123. return create_ast_node<DropColumn>(move(schema_name), move(table_name), move(column));
  124. }
  125. consume(TokenType::Rename);
  126. if (consume_if(TokenType::To)) {
  127. auto new_table_name = consume(TokenType::Identifier).value();
  128. return create_ast_node<RenameTable>(move(schema_name), move(table_name), move(new_table_name));
  129. }
  130. consume_if(TokenType::Column); // COLUMN is optional.
  131. auto column_name = consume(TokenType::Identifier).value();
  132. consume(TokenType::To);
  133. auto new_column_name = consume(TokenType::Identifier).value();
  134. return create_ast_node<RenameColumn>(move(schema_name), move(table_name), move(column_name), move(new_column_name));
  135. }
  136. NonnullRefPtr<DropTable> Parser::parse_drop_table_statement()
  137. {
  138. // https://sqlite.org/lang_droptable.html
  139. consume(TokenType::Drop);
  140. consume(TokenType::Table);
  141. bool is_error_if_table_does_not_exist = true;
  142. if (consume_if(TokenType::If)) {
  143. consume(TokenType::Exists);
  144. is_error_if_table_does_not_exist = false;
  145. }
  146. String schema_name;
  147. String table_name;
  148. parse_schema_and_table_name(schema_name, table_name);
  149. return create_ast_node<DropTable>(move(schema_name), move(table_name), is_error_if_table_does_not_exist);
  150. }
  151. NonnullRefPtr<Insert> Parser::parse_insert_statement(RefPtr<CommonTableExpressionList> common_table_expression_list)
  152. {
  153. // https://sqlite.org/lang_insert.html
  154. consume(TokenType::Insert);
  155. auto conflict_resolution = parse_conflict_resolution();
  156. consume(TokenType::Into);
  157. String schema_name;
  158. String table_name;
  159. parse_schema_and_table_name(schema_name, table_name);
  160. String alias;
  161. if (consume_if(TokenType::As))
  162. alias = consume(TokenType::Identifier).value();
  163. Vector<String> column_names;
  164. if (match(TokenType::ParenOpen))
  165. parse_comma_separated_list(true, [&]() { column_names.append(consume(TokenType::Identifier).value()); });
  166. NonnullRefPtrVector<ChainedExpression> chained_expressions;
  167. RefPtr<Select> select_statement;
  168. if (consume_if(TokenType::Values)) {
  169. parse_comma_separated_list(false, [&]() {
  170. if (auto chained_expression = parse_chained_expression(); chained_expression.has_value()) {
  171. auto chained_expr = dynamic_cast<ChainedExpression*>(chained_expression->ptr());
  172. if ((column_names.size() > 0) && (chained_expr->expressions().size() != column_names.size())) {
  173. syntax_error("Number of expressions does not match number of columns");
  174. } else {
  175. chained_expressions.append(move(chained_expression.value()));
  176. }
  177. } else {
  178. expected("Chained expression");
  179. }
  180. });
  181. } else if (match(TokenType::Select)) {
  182. select_statement = parse_select_statement({});
  183. } else {
  184. consume(TokenType::Default);
  185. consume(TokenType::Values);
  186. }
  187. RefPtr<ReturningClause> returning_clause;
  188. if (match(TokenType::Returning))
  189. returning_clause = parse_returning_clause();
  190. // FIXME: Parse 'upsert-clause'.
  191. if (!chained_expressions.is_empty())
  192. return create_ast_node<Insert>(move(common_table_expression_list), conflict_resolution, move(schema_name), move(table_name), move(alias), move(column_names), move(chained_expressions));
  193. if (!select_statement.is_null())
  194. return create_ast_node<Insert>(move(common_table_expression_list), conflict_resolution, move(schema_name), move(table_name), move(alias), move(column_names), move(select_statement));
  195. return create_ast_node<Insert>(move(common_table_expression_list), conflict_resolution, move(schema_name), move(table_name), move(alias), move(column_names));
  196. }
  197. NonnullRefPtr<Update> Parser::parse_update_statement(RefPtr<CommonTableExpressionList> common_table_expression_list)
  198. {
  199. // https://sqlite.org/lang_update.html
  200. consume(TokenType::Update);
  201. auto conflict_resolution = parse_conflict_resolution();
  202. auto qualified_table_name = parse_qualified_table_name();
  203. consume(TokenType::Set);
  204. Vector<Update::UpdateColumns> update_columns;
  205. parse_comma_separated_list(false, [&]() {
  206. Vector<String> column_names;
  207. if (match(TokenType::ParenOpen)) {
  208. parse_comma_separated_list(true, [&]() { column_names.append(consume(TokenType::Identifier).value()); });
  209. } else {
  210. column_names.append(consume(TokenType::Identifier).value());
  211. }
  212. consume(TokenType::Equals);
  213. update_columns.append({ move(column_names), parse_expression() });
  214. });
  215. NonnullRefPtrVector<TableOrSubquery> table_or_subquery_list;
  216. if (consume_if(TokenType::From)) {
  217. // FIXME: Parse join-clause.
  218. parse_comma_separated_list(false, [&]() { table_or_subquery_list.append(parse_table_or_subquery()); });
  219. }
  220. RefPtr<Expression> where_clause;
  221. if (consume_if(TokenType::Where))
  222. where_clause = parse_expression();
  223. RefPtr<ReturningClause> returning_clause;
  224. if (match(TokenType::Returning))
  225. returning_clause = parse_returning_clause();
  226. return create_ast_node<Update>(move(common_table_expression_list), conflict_resolution, move(qualified_table_name), move(update_columns), move(table_or_subquery_list), move(where_clause), move(returning_clause));
  227. }
  228. NonnullRefPtr<Delete> Parser::parse_delete_statement(RefPtr<CommonTableExpressionList> common_table_expression_list)
  229. {
  230. // https://sqlite.org/lang_delete.html
  231. consume(TokenType::Delete);
  232. consume(TokenType::From);
  233. auto qualified_table_name = parse_qualified_table_name();
  234. RefPtr<Expression> where_clause;
  235. if (consume_if(TokenType::Where))
  236. where_clause = parse_expression();
  237. RefPtr<ReturningClause> returning_clause;
  238. if (match(TokenType::Returning))
  239. returning_clause = parse_returning_clause();
  240. return create_ast_node<Delete>(move(common_table_expression_list), move(qualified_table_name), move(where_clause), move(returning_clause));
  241. }
  242. NonnullRefPtr<Select> Parser::parse_select_statement(RefPtr<CommonTableExpressionList> common_table_expression_list)
  243. {
  244. // https://sqlite.org/lang_select.html
  245. consume(TokenType::Select);
  246. bool select_all = !consume_if(TokenType::Distinct);
  247. consume_if(TokenType::All); // ALL is the default, so ignore it if specified.
  248. NonnullRefPtrVector<ResultColumn> result_column_list;
  249. parse_comma_separated_list(false, [&]() { result_column_list.append(parse_result_column()); });
  250. NonnullRefPtrVector<TableOrSubquery> table_or_subquery_list;
  251. if (consume_if(TokenType::From)) {
  252. // FIXME: Parse join-clause.
  253. parse_comma_separated_list(false, [&]() { table_or_subquery_list.append(parse_table_or_subquery()); });
  254. }
  255. RefPtr<Expression> where_clause;
  256. if (consume_if(TokenType::Where))
  257. where_clause = parse_expression();
  258. RefPtr<GroupByClause> group_by_clause;
  259. if (consume_if(TokenType::Group)) {
  260. consume(TokenType::By);
  261. NonnullRefPtrVector<Expression> group_by_list;
  262. parse_comma_separated_list(false, [&]() { group_by_list.append(parse_expression()); });
  263. if (!group_by_list.is_empty()) {
  264. RefPtr<Expression> having_clause;
  265. if (consume_if(TokenType::Having))
  266. having_clause = parse_expression();
  267. group_by_clause = create_ast_node<GroupByClause>(move(group_by_list), move(having_clause));
  268. }
  269. }
  270. // FIXME: Parse 'WINDOW window-name AS window-defn'.
  271. // FIXME: Parse 'compound-operator'.
  272. NonnullRefPtrVector<OrderingTerm> ordering_term_list;
  273. if (consume_if(TokenType::Order)) {
  274. consume(TokenType::By);
  275. parse_comma_separated_list(false, [&]() { ordering_term_list.append(parse_ordering_term()); });
  276. }
  277. RefPtr<LimitClause> limit_clause;
  278. if (consume_if(TokenType::Limit)) {
  279. auto limit_expression = parse_expression();
  280. RefPtr<Expression> offset_expression;
  281. if (consume_if(TokenType::Offset)) {
  282. offset_expression = parse_expression();
  283. } else if (consume_if(TokenType::Comma)) {
  284. // Note: The limit clause may instead be defined as "offset-expression, limit-expression", effectively reversing the
  285. // order of the expressions. SQLite notes "this is counter-intuitive" and "to avoid confusion, programmers are strongly
  286. // encouraged to ... avoid using a LIMIT clause with a comma-separated offset."
  287. syntax_error("LIMIT clauses of the form 'LIMIT <expr>, <expr>' are not supported");
  288. }
  289. limit_clause = create_ast_node<LimitClause>(move(limit_expression), move(offset_expression));
  290. }
  291. return create_ast_node<Select>(move(common_table_expression_list), select_all, move(result_column_list), move(table_or_subquery_list), move(where_clause), move(group_by_clause), move(ordering_term_list), move(limit_clause));
  292. }
  293. RefPtr<CommonTableExpressionList> Parser::parse_common_table_expression_list()
  294. {
  295. consume(TokenType::With);
  296. bool recursive = consume_if(TokenType::Recursive);
  297. NonnullRefPtrVector<CommonTableExpression> common_table_expression;
  298. parse_comma_separated_list(false, [&]() { common_table_expression.append(parse_common_table_expression()); });
  299. if (common_table_expression.is_empty()) {
  300. expected("Common table expression list");
  301. return {};
  302. }
  303. return create_ast_node<CommonTableExpressionList>(recursive, move(common_table_expression));
  304. }
  305. NonnullRefPtr<Expression> Parser::parse_expression()
  306. {
  307. if (++m_parser_state.m_current_expression_depth > Limits::maximum_expression_tree_depth) {
  308. syntax_error(String::formatted("Exceeded maximum expression tree depth of {}", Limits::maximum_expression_tree_depth));
  309. return create_ast_node<ErrorExpression>();
  310. }
  311. // https://sqlite.org/lang_expr.html
  312. auto expression = parse_primary_expression();
  313. if (match_secondary_expression())
  314. expression = parse_secondary_expression(move(expression));
  315. // FIXME: Parse 'bind-parameter'.
  316. // FIXME: Parse 'function-name'.
  317. // FIXME: Parse 'raise-function'.
  318. --m_parser_state.m_current_expression_depth;
  319. return expression;
  320. }
  321. NonnullRefPtr<Expression> Parser::parse_primary_expression()
  322. {
  323. if (auto expression = parse_literal_value_expression(); expression.has_value())
  324. return move(expression.value());
  325. if (auto expression = parse_column_name_expression(); expression.has_value())
  326. return move(expression.value());
  327. if (auto expression = parse_unary_operator_expression(); expression.has_value())
  328. return move(expression.value());
  329. if (auto expression = parse_chained_expression(); expression.has_value())
  330. return move(expression.value());
  331. if (auto expression = parse_cast_expression(); expression.has_value())
  332. return move(expression.value());
  333. if (auto expression = parse_case_expression(); expression.has_value())
  334. return move(expression.value());
  335. if (auto expression = parse_exists_expression(false); expression.has_value())
  336. return move(expression.value());
  337. expected("Primary Expression");
  338. consume();
  339. return create_ast_node<ErrorExpression>();
  340. }
  341. NonnullRefPtr<Expression> Parser::parse_secondary_expression(NonnullRefPtr<Expression> primary)
  342. {
  343. if (auto expression = parse_binary_operator_expression(primary); expression.has_value())
  344. return move(expression.value());
  345. if (auto expression = parse_collate_expression(primary); expression.has_value())
  346. return move(expression.value());
  347. if (auto expression = parse_is_expression(primary); expression.has_value())
  348. return move(expression.value());
  349. bool invert_expression = false;
  350. if (consume_if(TokenType::Not))
  351. invert_expression = true;
  352. if (auto expression = parse_match_expression(primary, invert_expression); expression.has_value())
  353. return move(expression.value());
  354. if (auto expression = parse_null_expression(primary, invert_expression); expression.has_value())
  355. return move(expression.value());
  356. if (auto expression = parse_between_expression(primary, invert_expression); expression.has_value())
  357. return move(expression.value());
  358. if (auto expression = parse_in_expression(primary, invert_expression); expression.has_value())
  359. return move(expression.value());
  360. expected("Secondary Expression");
  361. consume();
  362. return create_ast_node<ErrorExpression>();
  363. }
  364. bool Parser::match_secondary_expression() const
  365. {
  366. return match(TokenType::Not)
  367. || match(TokenType::DoublePipe)
  368. || match(TokenType::Asterisk)
  369. || match(TokenType::Divide)
  370. || match(TokenType::Modulus)
  371. || match(TokenType::Plus)
  372. || match(TokenType::Minus)
  373. || match(TokenType::ShiftLeft)
  374. || match(TokenType::ShiftRight)
  375. || match(TokenType::Ampersand)
  376. || match(TokenType::Pipe)
  377. || match(TokenType::LessThan)
  378. || match(TokenType::LessThanEquals)
  379. || match(TokenType::GreaterThan)
  380. || match(TokenType::GreaterThanEquals)
  381. || match(TokenType::Equals)
  382. || match(TokenType::EqualsEquals)
  383. || match(TokenType::NotEquals1)
  384. || match(TokenType::NotEquals2)
  385. || match(TokenType::And)
  386. || match(TokenType::Or)
  387. || match(TokenType::Collate)
  388. || match(TokenType::Is)
  389. || match(TokenType::Like)
  390. || match(TokenType::Glob)
  391. || match(TokenType::Match)
  392. || match(TokenType::Regexp)
  393. || match(TokenType::Isnull)
  394. || match(TokenType::Notnull)
  395. || match(TokenType::Between)
  396. || match(TokenType::In);
  397. }
  398. Optional<NonnullRefPtr<Expression>> Parser::parse_literal_value_expression()
  399. {
  400. if (match(TokenType::NumericLiteral)) {
  401. auto value = consume().double_value();
  402. return create_ast_node<NumericLiteral>(value);
  403. }
  404. if (match(TokenType::StringLiteral)) {
  405. // TODO: Should the surrounding ' ' be removed here?
  406. auto value = consume().value();
  407. return create_ast_node<StringLiteral>(value);
  408. }
  409. if (match(TokenType::BlobLiteral)) {
  410. // TODO: Should the surrounding x' ' be removed here?
  411. auto value = consume().value();
  412. return create_ast_node<BlobLiteral>(value);
  413. }
  414. if (consume_if(TokenType::Null))
  415. return create_ast_node<NullLiteral>();
  416. return {};
  417. }
  418. Optional<NonnullRefPtr<Expression>> Parser::parse_column_name_expression(String with_parsed_identifier, bool with_parsed_period)
  419. {
  420. if (with_parsed_identifier.is_null() && !match(TokenType::Identifier))
  421. return {};
  422. String first_identifier;
  423. if (with_parsed_identifier.is_null())
  424. first_identifier = consume(TokenType::Identifier).value();
  425. else
  426. first_identifier = move(with_parsed_identifier);
  427. String schema_name;
  428. String table_name;
  429. String column_name;
  430. if (with_parsed_period || consume_if(TokenType::Period)) {
  431. String second_identifier = consume(TokenType::Identifier).value();
  432. if (consume_if(TokenType::Period)) {
  433. schema_name = move(first_identifier);
  434. table_name = move(second_identifier);
  435. column_name = consume(TokenType::Identifier).value();
  436. } else {
  437. table_name = move(first_identifier);
  438. column_name = move(second_identifier);
  439. }
  440. } else {
  441. column_name = move(first_identifier);
  442. }
  443. return create_ast_node<ColumnNameExpression>(move(schema_name), move(table_name), move(column_name));
  444. }
  445. Optional<NonnullRefPtr<Expression>> Parser::parse_unary_operator_expression()
  446. {
  447. if (consume_if(TokenType::Minus))
  448. return create_ast_node<UnaryOperatorExpression>(UnaryOperator::Minus, parse_expression());
  449. if (consume_if(TokenType::Plus))
  450. return create_ast_node<UnaryOperatorExpression>(UnaryOperator::Plus, parse_expression());
  451. if (consume_if(TokenType::Tilde))
  452. return create_ast_node<UnaryOperatorExpression>(UnaryOperator::BitwiseNot, parse_expression());
  453. if (consume_if(TokenType::Not)) {
  454. if (match(TokenType::Exists))
  455. return parse_exists_expression(true);
  456. else
  457. return create_ast_node<UnaryOperatorExpression>(UnaryOperator::Not, parse_expression());
  458. }
  459. return {};
  460. }
  461. Optional<NonnullRefPtr<Expression>> Parser::parse_binary_operator_expression(NonnullRefPtr<Expression> lhs)
  462. {
  463. if (consume_if(TokenType::DoublePipe))
  464. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Concatenate, move(lhs), parse_expression());
  465. if (consume_if(TokenType::Asterisk))
  466. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Multiplication, move(lhs), parse_expression());
  467. if (consume_if(TokenType::Divide))
  468. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Division, move(lhs), parse_expression());
  469. if (consume_if(TokenType::Modulus))
  470. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Modulo, move(lhs), parse_expression());
  471. if (consume_if(TokenType::Plus))
  472. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Plus, move(lhs), parse_expression());
  473. if (consume_if(TokenType::Minus))
  474. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Minus, move(lhs), parse_expression());
  475. if (consume_if(TokenType::ShiftLeft))
  476. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::ShiftLeft, move(lhs), parse_expression());
  477. if (consume_if(TokenType::ShiftRight))
  478. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::ShiftRight, move(lhs), parse_expression());
  479. if (consume_if(TokenType::Ampersand))
  480. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::BitwiseAnd, move(lhs), parse_expression());
  481. if (consume_if(TokenType::Pipe))
  482. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::BitwiseOr, move(lhs), parse_expression());
  483. if (consume_if(TokenType::LessThan))
  484. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::LessThan, move(lhs), parse_expression());
  485. if (consume_if(TokenType::LessThanEquals))
  486. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::LessThanEquals, move(lhs), parse_expression());
  487. if (consume_if(TokenType::GreaterThan))
  488. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::GreaterThan, move(lhs), parse_expression());
  489. if (consume_if(TokenType::GreaterThanEquals))
  490. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::GreaterThanEquals, move(lhs), parse_expression());
  491. if (consume_if(TokenType::Equals) || consume_if(TokenType::EqualsEquals))
  492. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Equals, move(lhs), parse_expression());
  493. if (consume_if(TokenType::NotEquals1) || consume_if(TokenType::NotEquals2))
  494. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::NotEquals, move(lhs), parse_expression());
  495. if (consume_if(TokenType::And))
  496. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::And, move(lhs), parse_expression());
  497. if (consume_if(TokenType::Or))
  498. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Or, move(lhs), parse_expression());
  499. return {};
  500. }
  501. Optional<NonnullRefPtr<Expression>> Parser::parse_chained_expression()
  502. {
  503. if (!consume_if(TokenType::ParenOpen))
  504. return {};
  505. if (match(TokenType::Select))
  506. return parse_exists_expression(false, TokenType::Select);
  507. NonnullRefPtrVector<Expression> expressions;
  508. parse_comma_separated_list(false, [&]() { expressions.append(parse_expression()); });
  509. consume(TokenType::ParenClose);
  510. return create_ast_node<ChainedExpression>(move(expressions));
  511. }
  512. Optional<NonnullRefPtr<Expression>> Parser::parse_cast_expression()
  513. {
  514. if (!match(TokenType::Cast))
  515. return {};
  516. consume(TokenType::Cast);
  517. consume(TokenType::ParenOpen);
  518. auto expression = parse_expression();
  519. consume(TokenType::As);
  520. auto type_name = parse_type_name();
  521. consume(TokenType::ParenClose);
  522. return create_ast_node<CastExpression>(move(expression), move(type_name));
  523. }
  524. Optional<NonnullRefPtr<Expression>> Parser::parse_case_expression()
  525. {
  526. if (!match(TokenType::Case))
  527. return {};
  528. consume();
  529. RefPtr<Expression> case_expression;
  530. if (!match(TokenType::When)) {
  531. case_expression = parse_expression();
  532. }
  533. Vector<CaseExpression::WhenThenClause> when_then_clauses;
  534. do {
  535. consume(TokenType::When);
  536. auto when = parse_expression();
  537. consume(TokenType::Then);
  538. auto then = parse_expression();
  539. when_then_clauses.append({ move(when), move(then) });
  540. if (!match(TokenType::When))
  541. break;
  542. } while (!match(TokenType::Eof));
  543. RefPtr<Expression> else_expression;
  544. if (consume_if(TokenType::Else))
  545. else_expression = parse_expression();
  546. consume(TokenType::End);
  547. return create_ast_node<CaseExpression>(move(case_expression), move(when_then_clauses), move(else_expression));
  548. }
  549. Optional<NonnullRefPtr<Expression>> Parser::parse_exists_expression(bool invert_expression, TokenType opening_token)
  550. {
  551. VERIFY((opening_token == TokenType::Exists) || (opening_token == TokenType::Select));
  552. if ((opening_token == TokenType::Exists) && !consume_if(TokenType::Exists))
  553. return {};
  554. if (opening_token == TokenType::Exists)
  555. consume(TokenType::ParenOpen);
  556. auto select_statement = parse_select_statement({});
  557. consume(TokenType::ParenClose);
  558. return create_ast_node<ExistsExpression>(move(select_statement), invert_expression);
  559. }
  560. Optional<NonnullRefPtr<Expression>> Parser::parse_collate_expression(NonnullRefPtr<Expression> expression)
  561. {
  562. if (!match(TokenType::Collate))
  563. return {};
  564. consume();
  565. String collation_name = consume(TokenType::Identifier).value();
  566. return create_ast_node<CollateExpression>(move(expression), move(collation_name));
  567. }
  568. Optional<NonnullRefPtr<Expression>> Parser::parse_is_expression(NonnullRefPtr<Expression> expression)
  569. {
  570. if (!match(TokenType::Is))
  571. return {};
  572. consume();
  573. bool invert_expression = false;
  574. if (match(TokenType::Not)) {
  575. consume();
  576. invert_expression = true;
  577. }
  578. auto rhs = parse_expression();
  579. return create_ast_node<IsExpression>(move(expression), move(rhs), invert_expression);
  580. }
  581. Optional<NonnullRefPtr<Expression>> Parser::parse_match_expression(NonnullRefPtr<Expression> lhs, bool invert_expression)
  582. {
  583. auto parse_escape = [this]() {
  584. RefPtr<Expression> escape;
  585. if (consume_if(TokenType::Escape))
  586. escape = parse_expression();
  587. return escape;
  588. };
  589. if (consume_if(TokenType::Like))
  590. return create_ast_node<MatchExpression>(MatchOperator::Like, move(lhs), parse_expression(), parse_escape(), invert_expression);
  591. if (consume_if(TokenType::Glob))
  592. return create_ast_node<MatchExpression>(MatchOperator::Glob, move(lhs), parse_expression(), parse_escape(), invert_expression);
  593. if (consume_if(TokenType::Match))
  594. return create_ast_node<MatchExpression>(MatchOperator::Match, move(lhs), parse_expression(), parse_escape(), invert_expression);
  595. if (consume_if(TokenType::Regexp))
  596. return create_ast_node<MatchExpression>(MatchOperator::Regexp, move(lhs), parse_expression(), parse_escape(), invert_expression);
  597. return {};
  598. }
  599. Optional<NonnullRefPtr<Expression>> Parser::parse_null_expression(NonnullRefPtr<Expression> expression, bool invert_expression)
  600. {
  601. if (!match(TokenType::Isnull) && !match(TokenType::Notnull) && !(invert_expression && match(TokenType::Null)))
  602. return {};
  603. auto type = consume().type();
  604. invert_expression |= (type == TokenType::Notnull);
  605. return create_ast_node<NullExpression>(move(expression), invert_expression);
  606. }
  607. Optional<NonnullRefPtr<Expression>> Parser::parse_between_expression(NonnullRefPtr<Expression> expression, bool invert_expression)
  608. {
  609. if (!match(TokenType::Between))
  610. return {};
  611. consume();
  612. auto nested = parse_expression();
  613. if (!is<BinaryOperatorExpression>(*nested)) {
  614. expected("Binary Expression");
  615. return create_ast_node<ErrorExpression>();
  616. }
  617. const auto& binary_expression = static_cast<const BinaryOperatorExpression&>(*nested);
  618. if (binary_expression.type() != BinaryOperator::And) {
  619. expected("AND Expression");
  620. return create_ast_node<ErrorExpression>();
  621. }
  622. return create_ast_node<BetweenExpression>(move(expression), binary_expression.lhs(), binary_expression.rhs(), invert_expression);
  623. }
  624. Optional<NonnullRefPtr<Expression>> Parser::parse_in_expression(NonnullRefPtr<Expression> expression, bool invert_expression)
  625. {
  626. if (!match(TokenType::In))
  627. return {};
  628. consume();
  629. if (consume_if(TokenType::ParenOpen)) {
  630. if (match(TokenType::Select)) {
  631. auto select_statement = parse_select_statement({});
  632. return create_ast_node<InSelectionExpression>(move(expression), move(select_statement), invert_expression);
  633. }
  634. // FIXME: Consolidate this with parse_chained_expression(). That method consumes the opening paren as
  635. // well, and also requires at least one expression (whereas this allows for an empty chain).
  636. NonnullRefPtrVector<Expression> expressions;
  637. if (!match(TokenType::ParenClose))
  638. parse_comma_separated_list(false, [&]() { expressions.append(parse_expression()); });
  639. consume(TokenType::ParenClose);
  640. auto chain = create_ast_node<ChainedExpression>(move(expressions));
  641. return create_ast_node<InChainedExpression>(move(expression), move(chain), invert_expression);
  642. }
  643. String schema_name;
  644. String table_name;
  645. parse_schema_and_table_name(schema_name, table_name);
  646. if (match(TokenType::ParenOpen)) {
  647. // FIXME: Parse "table-function".
  648. return {};
  649. }
  650. return create_ast_node<InTableExpression>(move(expression), move(schema_name), move(table_name), invert_expression);
  651. }
  652. NonnullRefPtr<ColumnDefinition> Parser::parse_column_definition()
  653. {
  654. // https://sqlite.org/syntax/column-def.html
  655. auto name = consume(TokenType::Identifier).value();
  656. auto type_name = match(TokenType::Identifier)
  657. ? parse_type_name()
  658. // https://www.sqlite.org/datatype3.html: If no type is specified then the column has affinity BLOB.
  659. : create_ast_node<TypeName>("BLOB", NonnullRefPtrVector<SignedNumber> {});
  660. // FIXME: Parse "column-constraint".
  661. return create_ast_node<ColumnDefinition>(move(name), move(type_name));
  662. }
  663. NonnullRefPtr<TypeName> Parser::parse_type_name()
  664. {
  665. // https: //sqlite.org/syntax/type-name.html
  666. auto name = consume(TokenType::Identifier).value();
  667. NonnullRefPtrVector<SignedNumber> signed_numbers;
  668. if (consume_if(TokenType::ParenOpen)) {
  669. signed_numbers.append(parse_signed_number());
  670. if (consume_if(TokenType::Comma))
  671. signed_numbers.append(parse_signed_number());
  672. consume(TokenType::ParenClose);
  673. }
  674. return create_ast_node<TypeName>(move(name), move(signed_numbers));
  675. }
  676. NonnullRefPtr<SignedNumber> Parser::parse_signed_number()
  677. {
  678. // https://sqlite.org/syntax/signed-number.html
  679. bool is_positive = true;
  680. if (consume_if(TokenType::Plus))
  681. is_positive = true;
  682. else if (consume_if(TokenType::Minus))
  683. is_positive = false;
  684. if (match(TokenType::NumericLiteral)) {
  685. auto number = consume(TokenType::NumericLiteral).double_value();
  686. return create_ast_node<SignedNumber>(is_positive ? number : (number * -1));
  687. }
  688. expected("NumericLiteral");
  689. return create_ast_node<SignedNumber>(0);
  690. }
  691. NonnullRefPtr<CommonTableExpression> Parser::parse_common_table_expression()
  692. {
  693. // https://sqlite.org/syntax/common-table-expression.html
  694. auto table_name = consume(TokenType::Identifier).value();
  695. Vector<String> column_names;
  696. if (match(TokenType::ParenOpen))
  697. parse_comma_separated_list(true, [&]() { column_names.append(consume(TokenType::Identifier).value()); });
  698. consume(TokenType::As);
  699. consume(TokenType::ParenOpen);
  700. auto select_statement = parse_select_statement({});
  701. consume(TokenType::ParenClose);
  702. return create_ast_node<CommonTableExpression>(move(table_name), move(column_names), move(select_statement));
  703. }
  704. NonnullRefPtr<QualifiedTableName> Parser::parse_qualified_table_name()
  705. {
  706. // https://sqlite.org/syntax/qualified-table-name.html
  707. String schema_name;
  708. String table_name;
  709. parse_schema_and_table_name(schema_name, table_name);
  710. String alias;
  711. if (consume_if(TokenType::As))
  712. alias = consume(TokenType::Identifier).value();
  713. // Note: The qualified-table-name spec may include an "INDEXED BY index-name" or "NOT INDEXED" clause. This is a SQLite extension
  714. // "designed to help detect undesirable query plan changes during regression testing", and "application developers are admonished
  715. // to omit all use of INDEXED BY during application design, implementation, testing, and tuning". Our implementation purposefully
  716. // omits parsing INDEXED BY for now until there is good reason to add support.
  717. return create_ast_node<QualifiedTableName>(move(schema_name), move(table_name), move(alias));
  718. }
  719. NonnullRefPtr<ReturningClause> Parser::parse_returning_clause()
  720. {
  721. // https://sqlite.org/syntax/returning-clause.html
  722. consume(TokenType::Returning);
  723. if (consume_if(TokenType::Asterisk))
  724. return create_ast_node<ReturningClause>();
  725. Vector<ReturningClause::ColumnClause> columns;
  726. parse_comma_separated_list(false, [&]() {
  727. auto expression = parse_expression();
  728. String column_alias;
  729. if (consume_if(TokenType::As) || match(TokenType::Identifier))
  730. column_alias = consume(TokenType::Identifier).value();
  731. columns.append({ move(expression), move(column_alias) });
  732. });
  733. return create_ast_node<ReturningClause>(move(columns));
  734. }
  735. NonnullRefPtr<ResultColumn> Parser::parse_result_column()
  736. {
  737. // https://sqlite.org/syntax/result-column.html
  738. if (consume_if(TokenType::Asterisk))
  739. return create_ast_node<ResultColumn>();
  740. // If we match an identifier now, we don't know whether it is a table-name of the form "table-name.*", or if it is the start of a
  741. // column-name-expression, until we try to parse the asterisk. So if we consume an identifier and a period, but don't find an
  742. // asterisk, hold onto that information to form a column-name-expression later.
  743. String table_name;
  744. bool parsed_period = false;
  745. if (match(TokenType::Identifier)) {
  746. table_name = consume().value();
  747. parsed_period = consume_if(TokenType::Period);
  748. if (parsed_period && consume_if(TokenType::Asterisk))
  749. return create_ast_node<ResultColumn>(move(table_name));
  750. }
  751. auto expression = table_name.is_null()
  752. ? parse_expression()
  753. : static_cast<NonnullRefPtr<Expression>>(*parse_column_name_expression(move(table_name), parsed_period));
  754. String column_alias;
  755. if (consume_if(TokenType::As) || match(TokenType::Identifier))
  756. column_alias = consume(TokenType::Identifier).value();
  757. return create_ast_node<ResultColumn>(move(expression), move(column_alias));
  758. }
  759. NonnullRefPtr<TableOrSubquery> Parser::parse_table_or_subquery()
  760. {
  761. if (++m_parser_state.m_current_subquery_depth > Limits::maximum_subquery_depth)
  762. syntax_error(String::formatted("Exceeded maximum subquery depth of {}", Limits::maximum_subquery_depth));
  763. ScopeGuard guard([&]() { --m_parser_state.m_current_subquery_depth; });
  764. // https://sqlite.org/syntax/table-or-subquery.html
  765. if (match(TokenType::Identifier)) {
  766. String schema_name;
  767. String table_name;
  768. parse_schema_and_table_name(schema_name, table_name);
  769. String table_alias;
  770. if (consume_if(TokenType::As) || match(TokenType::Identifier))
  771. table_alias = consume(TokenType::Identifier).value();
  772. return create_ast_node<TableOrSubquery>(move(schema_name), move(table_name), move(table_alias));
  773. }
  774. // FIXME: Parse join-clause.
  775. NonnullRefPtrVector<TableOrSubquery> subqueries;
  776. parse_comma_separated_list(true, [&]() { subqueries.append(parse_table_or_subquery()); });
  777. return create_ast_node<TableOrSubquery>(move(subqueries));
  778. }
  779. NonnullRefPtr<OrderingTerm> Parser::parse_ordering_term()
  780. {
  781. // https://sqlite.org/syntax/ordering-term.html
  782. auto expression = parse_expression();
  783. String collation_name;
  784. if (is<CollateExpression>(*expression)) {
  785. const auto& collate = static_cast<const CollateExpression&>(*expression);
  786. collation_name = collate.collation_name();
  787. expression = collate.expression();
  788. } else if (consume_if(TokenType::Collate)) {
  789. collation_name = consume(TokenType::Identifier).value();
  790. }
  791. Order order = consume_if(TokenType::Desc) ? Order::Descending : Order::Ascending;
  792. consume_if(TokenType::Asc); // ASC is the default, so ignore it if specified.
  793. Nulls nulls = order == Order::Ascending ? Nulls::First : Nulls::Last;
  794. if (consume_if(TokenType::Nulls)) {
  795. if (consume_if(TokenType::First))
  796. nulls = Nulls::First;
  797. else if (consume_if(TokenType::Last))
  798. nulls = Nulls::Last;
  799. else
  800. expected("FIRST or LAST");
  801. }
  802. return create_ast_node<OrderingTerm>(move(expression), move(collation_name), order, nulls);
  803. }
  804. void Parser::parse_schema_and_table_name(String& schema_name, String& table_name)
  805. {
  806. String schema_or_table_name = consume(TokenType::Identifier).value();
  807. if (consume_if(TokenType::Period)) {
  808. schema_name = move(schema_or_table_name);
  809. table_name = consume(TokenType::Identifier).value();
  810. } else {
  811. table_name = move(schema_or_table_name);
  812. }
  813. }
  814. ConflictResolution Parser::parse_conflict_resolution()
  815. {
  816. // https://sqlite.org/lang_conflict.html
  817. if (consume_if(TokenType::Or)) {
  818. if (consume_if(TokenType::Abort))
  819. return ConflictResolution::Abort;
  820. if (consume_if(TokenType::Fail))
  821. return ConflictResolution::Fail;
  822. if (consume_if(TokenType::Ignore))
  823. return ConflictResolution::Ignore;
  824. if (consume_if(TokenType::Replace))
  825. return ConflictResolution::Replace;
  826. if (consume_if(TokenType::Rollback))
  827. return ConflictResolution::Rollback;
  828. expected("ABORT, FAIL, IGNORE, REPLACE, or ROLLBACK");
  829. }
  830. return ConflictResolution::Abort;
  831. }
  832. Token Parser::consume()
  833. {
  834. auto old_token = m_parser_state.m_token;
  835. m_parser_state.m_token = m_parser_state.m_lexer.next();
  836. return old_token;
  837. }
  838. Token Parser::consume(TokenType expected_type)
  839. {
  840. if (!match(expected_type)) {
  841. expected(Token::name(expected_type));
  842. }
  843. return consume();
  844. }
  845. bool Parser::consume_if(TokenType expected_type)
  846. {
  847. if (!match(expected_type))
  848. return false;
  849. consume();
  850. return true;
  851. }
  852. bool Parser::match(TokenType type) const
  853. {
  854. return m_parser_state.m_token.type() == type;
  855. }
  856. void Parser::expected(StringView what)
  857. {
  858. syntax_error(String::formatted("Unexpected token {}, expected {}", m_parser_state.m_token.name(), what));
  859. }
  860. void Parser::syntax_error(String message)
  861. {
  862. m_parser_state.m_errors.append({ move(message), position() });
  863. }
  864. SourcePosition Parser::position() const
  865. {
  866. return m_parser_state.m_token.start_position();
  867. }
  868. Parser::ParserState::ParserState(Lexer lexer)
  869. : m_lexer(move(lexer))
  870. , m_token(m_lexer.next())
  871. {
  872. }
  873. }