Parser.cpp 39 KB

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