Parser.cpp 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676
  1. /*
  2. * Copyright (c) 2021, Tim Flynn <trflynn89@pm.me>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include "Parser.h"
  27. #include <AK/TypeCasts.h>
  28. namespace SQL {
  29. Parser::Parser(Lexer lexer)
  30. : m_parser_state(move(lexer))
  31. {
  32. }
  33. NonnullRefPtr<Statement> Parser::next_statement()
  34. {
  35. switch (m_parser_state.m_token.type()) {
  36. case TokenType::Create:
  37. return parse_create_table_statement();
  38. case TokenType::Drop:
  39. return parse_drop_table_statement();
  40. default:
  41. expected("CREATE or DROP");
  42. return create_ast_node<ErrorStatement>();
  43. }
  44. }
  45. NonnullRefPtr<CreateTable> Parser::parse_create_table_statement()
  46. {
  47. // https://sqlite.org/lang_createtable.html
  48. consume(TokenType::Create);
  49. bool is_temporary = false;
  50. if (consume_if(TokenType::Temp) || consume_if(TokenType::Temporary))
  51. is_temporary = true;
  52. consume(TokenType::Table);
  53. bool is_error_if_table_exists = true;
  54. if (consume_if(TokenType::If)) {
  55. consume(TokenType::Not);
  56. consume(TokenType::Exists);
  57. is_error_if_table_exists = false;
  58. }
  59. String schema_or_table_name = consume(TokenType::Identifier).value();
  60. String schema_name;
  61. String table_name;
  62. if (consume_if(TokenType::Period)) {
  63. schema_name = move(schema_or_table_name);
  64. table_name = consume(TokenType::Identifier).value();
  65. } else {
  66. table_name = move(schema_or_table_name);
  67. }
  68. // FIXME: Parse "AS select-stmt".
  69. NonnullRefPtrVector<ColumnDefinition> column_definitions;
  70. consume(TokenType::ParenOpen);
  71. do {
  72. column_definitions.append(parse_column_definition());
  73. if (match(TokenType::ParenClose))
  74. break;
  75. consume(TokenType::Comma);
  76. } while (!match(TokenType::Eof));
  77. // FIXME: Parse "table-constraint".
  78. consume(TokenType::ParenClose);
  79. consume(TokenType::SemiColon);
  80. return create_ast_node<CreateTable>(move(schema_name), move(table_name), move(column_definitions), is_temporary, is_error_if_table_exists);
  81. }
  82. NonnullRefPtr<DropTable> Parser::parse_drop_table_statement()
  83. {
  84. // https://sqlite.org/lang_droptable.html
  85. consume(TokenType::Drop);
  86. consume(TokenType::Table);
  87. bool is_error_if_table_does_not_exist = true;
  88. if (consume_if(TokenType::If)) {
  89. consume(TokenType::Exists);
  90. is_error_if_table_does_not_exist = false;
  91. }
  92. String schema_or_table_name = consume(TokenType::Identifier).value();
  93. String schema_name;
  94. String table_name;
  95. if (consume_if(TokenType::Period)) {
  96. schema_name = move(schema_or_table_name);
  97. table_name = consume(TokenType::Identifier).value();
  98. } else {
  99. table_name = move(schema_or_table_name);
  100. }
  101. consume(TokenType::SemiColon);
  102. return create_ast_node<DropTable>(move(schema_name), move(table_name), is_error_if_table_does_not_exist);
  103. }
  104. NonnullRefPtr<Expression> Parser::parse_expression()
  105. {
  106. // https://sqlite.org/lang_expr.html
  107. auto expression = parse_primary_expression();
  108. if (match_secondary_expression())
  109. expression = parse_secondary_expression(move(expression));
  110. // FIXME: Parse 'bind-parameter'.
  111. // FIXME: Parse 'function-name'.
  112. // FIXME: Parse 'exists'.
  113. // FIXME: Parse 'raise-function'.
  114. return expression;
  115. }
  116. NonnullRefPtr<Expression> Parser::parse_primary_expression()
  117. {
  118. if (auto expression = parse_literal_value_expression(); expression.has_value())
  119. return move(expression.value());
  120. if (auto expression = parse_column_name_expression(); expression.has_value())
  121. return move(expression.value());
  122. if (auto expression = parse_unary_operator_expression(); expression.has_value())
  123. return move(expression.value());
  124. if (auto expression = parse_chained_expression(); expression.has_value())
  125. return move(expression.value());
  126. if (auto expression = parse_cast_expression(); expression.has_value())
  127. return move(expression.value());
  128. if (auto expression = parse_case_expression(); expression.has_value())
  129. return move(expression.value());
  130. expected("Primary Expression");
  131. consume();
  132. return create_ast_node<ErrorExpression>();
  133. }
  134. NonnullRefPtr<Expression> Parser::parse_secondary_expression(NonnullRefPtr<Expression> primary)
  135. {
  136. if (auto expression = parse_binary_operator_expression(primary); expression.has_value())
  137. return move(expression.value());
  138. if (auto expression = parse_collate_expression(primary); expression.has_value())
  139. return move(expression.value());
  140. if (auto expression = parse_is_expression(primary); expression.has_value())
  141. return move(expression.value());
  142. bool invert_expression = false;
  143. if (consume_if(TokenType::Not))
  144. invert_expression = true;
  145. if (auto expression = parse_match_expression(primary, invert_expression); expression.has_value())
  146. return move(expression.value());
  147. if (auto expression = parse_null_expression(primary, invert_expression); expression.has_value())
  148. return move(expression.value());
  149. if (auto expression = parse_between_expression(primary, invert_expression); expression.has_value())
  150. return move(expression.value());
  151. if (auto expression = parse_in_expression(primary, invert_expression); expression.has_value())
  152. return move(expression.value());
  153. expected("Secondary Expression");
  154. consume();
  155. return create_ast_node<ErrorExpression>();
  156. }
  157. bool Parser::match_secondary_expression() const
  158. {
  159. return match(TokenType::Not)
  160. || match(TokenType::DoublePipe)
  161. || match(TokenType::Asterisk)
  162. || match(TokenType::Divide)
  163. || match(TokenType::Modulus)
  164. || match(TokenType::Plus)
  165. || match(TokenType::Minus)
  166. || match(TokenType::ShiftLeft)
  167. || match(TokenType::ShiftRight)
  168. || match(TokenType::Ampersand)
  169. || match(TokenType::Pipe)
  170. || match(TokenType::LessThan)
  171. || match(TokenType::LessThanEquals)
  172. || match(TokenType::GreaterThan)
  173. || match(TokenType::GreaterThanEquals)
  174. || match(TokenType::Equals)
  175. || match(TokenType::EqualsEquals)
  176. || match(TokenType::NotEquals1)
  177. || match(TokenType::NotEquals2)
  178. || match(TokenType::And)
  179. || match(TokenType::Or)
  180. || match(TokenType::Collate)
  181. || match(TokenType::Is)
  182. || match(TokenType::Like)
  183. || match(TokenType::Glob)
  184. || match(TokenType::Match)
  185. || match(TokenType::Regexp)
  186. || match(TokenType::Isnull)
  187. || match(TokenType::Notnull)
  188. || match(TokenType::Between)
  189. || match(TokenType::In);
  190. }
  191. Optional<NonnullRefPtr<Expression>> Parser::parse_literal_value_expression()
  192. {
  193. if (match(TokenType::NumericLiteral)) {
  194. auto value = consume().double_value();
  195. return create_ast_node<NumericLiteral>(value);
  196. }
  197. if (match(TokenType::StringLiteral)) {
  198. // TODO: Should the surrounding ' ' be removed here?
  199. auto value = consume().value();
  200. return create_ast_node<StringLiteral>(value);
  201. }
  202. if (match(TokenType::BlobLiteral)) {
  203. // TODO: Should the surrounding x' ' be removed here?
  204. auto value = consume().value();
  205. return create_ast_node<BlobLiteral>(value);
  206. }
  207. if (consume_if(TokenType::Null))
  208. return create_ast_node<NullLiteral>();
  209. return {};
  210. }
  211. Optional<NonnullRefPtr<Expression>> Parser::parse_column_name_expression()
  212. {
  213. if (!match(TokenType::Identifier))
  214. return {};
  215. String first_identifier = consume(TokenType::Identifier).value();
  216. String schema_name;
  217. String table_name;
  218. String column_name;
  219. if (consume_if(TokenType::Period)) {
  220. String second_identifier = consume(TokenType::Identifier).value();
  221. if (consume_if(TokenType::Period)) {
  222. schema_name = move(first_identifier);
  223. table_name = move(second_identifier);
  224. column_name = consume(TokenType::Identifier).value();
  225. } else {
  226. table_name = move(first_identifier);
  227. column_name = move(second_identifier);
  228. }
  229. } else {
  230. column_name = move(first_identifier);
  231. }
  232. return create_ast_node<ColumnNameExpression>(move(schema_name), move(table_name), move(column_name));
  233. }
  234. Optional<NonnullRefPtr<Expression>> Parser::parse_unary_operator_expression()
  235. {
  236. if (consume_if(TokenType::Minus))
  237. return create_ast_node<UnaryOperatorExpression>(UnaryOperator::Minus, parse_expression());
  238. if (consume_if(TokenType::Plus))
  239. return create_ast_node<UnaryOperatorExpression>(UnaryOperator::Plus, parse_expression());
  240. if (consume_if(TokenType::Tilde))
  241. return create_ast_node<UnaryOperatorExpression>(UnaryOperator::BitwiseNot, parse_expression());
  242. if (consume_if(TokenType::Not))
  243. return create_ast_node<UnaryOperatorExpression>(UnaryOperator::Not, parse_expression());
  244. return {};
  245. }
  246. Optional<NonnullRefPtr<Expression>> Parser::parse_binary_operator_expression(NonnullRefPtr<Expression> lhs)
  247. {
  248. if (consume_if(TokenType::DoublePipe))
  249. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Concatenate, move(lhs), parse_expression());
  250. if (consume_if(TokenType::Asterisk))
  251. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Multiplication, move(lhs), parse_expression());
  252. if (consume_if(TokenType::Divide))
  253. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Division, move(lhs), parse_expression());
  254. if (consume_if(TokenType::Modulus))
  255. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Modulo, move(lhs), parse_expression());
  256. if (consume_if(TokenType::Plus))
  257. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Plus, move(lhs), parse_expression());
  258. if (consume_if(TokenType::Minus))
  259. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Minus, move(lhs), parse_expression());
  260. if (consume_if(TokenType::ShiftLeft))
  261. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::ShiftLeft, move(lhs), parse_expression());
  262. if (consume_if(TokenType::ShiftRight))
  263. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::ShiftRight, move(lhs), parse_expression());
  264. if (consume_if(TokenType::Ampersand))
  265. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::BitwiseAnd, move(lhs), parse_expression());
  266. if (consume_if(TokenType::Pipe))
  267. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::BitwiseOr, move(lhs), parse_expression());
  268. if (consume_if(TokenType::LessThan))
  269. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::LessThan, move(lhs), parse_expression());
  270. if (consume_if(TokenType::LessThanEquals))
  271. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::LessThanEquals, move(lhs), parse_expression());
  272. if (consume_if(TokenType::GreaterThan))
  273. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::GreaterThan, move(lhs), parse_expression());
  274. if (consume_if(TokenType::GreaterThanEquals))
  275. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::GreaterThanEquals, move(lhs), parse_expression());
  276. if (consume_if(TokenType::Equals) || consume_if(TokenType::EqualsEquals))
  277. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Equals, move(lhs), parse_expression());
  278. if (consume_if(TokenType::NotEquals1) || consume_if(TokenType::NotEquals2))
  279. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::NotEquals, move(lhs), parse_expression());
  280. if (consume_if(TokenType::And))
  281. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::And, move(lhs), parse_expression());
  282. if (consume_if(TokenType::Or))
  283. return create_ast_node<BinaryOperatorExpression>(BinaryOperator::Or, move(lhs), parse_expression());
  284. return {};
  285. }
  286. Optional<NonnullRefPtr<Expression>> Parser::parse_chained_expression()
  287. {
  288. if (!match(TokenType::ParenOpen))
  289. return {};
  290. NonnullRefPtrVector<Expression> expressions;
  291. consume(TokenType::ParenOpen);
  292. do {
  293. expressions.append(parse_expression());
  294. if (match(TokenType::ParenClose))
  295. break;
  296. consume(TokenType::Comma);
  297. } while (!match(TokenType::Eof));
  298. consume(TokenType::ParenClose);
  299. return create_ast_node<ChainedExpression>(move(expressions));
  300. }
  301. Optional<NonnullRefPtr<Expression>> Parser::parse_cast_expression()
  302. {
  303. if (!match(TokenType::Cast))
  304. return {};
  305. consume(TokenType::Cast);
  306. consume(TokenType::ParenOpen);
  307. auto expression = parse_expression();
  308. consume(TokenType::As);
  309. auto type_name = parse_type_name();
  310. consume(TokenType::ParenClose);
  311. return create_ast_node<CastExpression>(move(expression), move(type_name));
  312. }
  313. Optional<NonnullRefPtr<Expression>> Parser::parse_case_expression()
  314. {
  315. if (!match(TokenType::Case))
  316. return {};
  317. consume();
  318. RefPtr<Expression> case_expression;
  319. if (!match(TokenType::When)) {
  320. case_expression = parse_expression();
  321. }
  322. Vector<CaseExpression::WhenThenClause> when_then_clauses;
  323. do {
  324. consume(TokenType::When);
  325. auto when = parse_expression();
  326. consume(TokenType::Then);
  327. auto then = parse_expression();
  328. when_then_clauses.append({ move(when), move(then) });
  329. if (!match(TokenType::When))
  330. break;
  331. } while (!match(TokenType::Eof));
  332. RefPtr<Expression> else_expression;
  333. if (consume_if(TokenType::Else))
  334. else_expression = parse_expression();
  335. consume(TokenType::End);
  336. return create_ast_node<CaseExpression>(move(case_expression), move(when_then_clauses), move(else_expression));
  337. }
  338. Optional<NonnullRefPtr<Expression>> Parser::parse_collate_expression(NonnullRefPtr<Expression> expression)
  339. {
  340. if (!match(TokenType::Collate))
  341. return {};
  342. consume();
  343. String collation_name = consume(TokenType::Identifier).value();
  344. return create_ast_node<CollateExpression>(move(expression), move(collation_name));
  345. }
  346. Optional<NonnullRefPtr<Expression>> Parser::parse_is_expression(NonnullRefPtr<Expression> expression)
  347. {
  348. if (!match(TokenType::Is))
  349. return {};
  350. consume();
  351. bool invert_expression = false;
  352. if (match(TokenType::Not)) {
  353. consume();
  354. invert_expression = true;
  355. }
  356. auto rhs = parse_expression();
  357. return create_ast_node<IsExpression>(move(expression), move(rhs), invert_expression);
  358. }
  359. Optional<NonnullRefPtr<Expression>> Parser::parse_match_expression(NonnullRefPtr<Expression> lhs, bool invert_expression)
  360. {
  361. auto parse_escape = [this]() {
  362. RefPtr<Expression> escape;
  363. if (consume_if(TokenType::Escape))
  364. escape = parse_expression();
  365. return escape;
  366. };
  367. if (consume_if(TokenType::Like))
  368. return create_ast_node<MatchExpression>(MatchOperator::Like, move(lhs), parse_expression(), parse_escape(), invert_expression);
  369. if (consume_if(TokenType::Glob))
  370. return create_ast_node<MatchExpression>(MatchOperator::Glob, move(lhs), parse_expression(), parse_escape(), invert_expression);
  371. if (consume_if(TokenType::Match))
  372. return create_ast_node<MatchExpression>(MatchOperator::Match, move(lhs), parse_expression(), parse_escape(), invert_expression);
  373. if (consume_if(TokenType::Regexp))
  374. return create_ast_node<MatchExpression>(MatchOperator::Regexp, move(lhs), parse_expression(), parse_escape(), invert_expression);
  375. return {};
  376. }
  377. Optional<NonnullRefPtr<Expression>> Parser::parse_null_expression(NonnullRefPtr<Expression> expression, bool invert_expression)
  378. {
  379. if (!match(TokenType::Isnull) && !match(TokenType::Notnull) && !(invert_expression && match(TokenType::Null)))
  380. return {};
  381. auto type = consume().type();
  382. invert_expression |= (type == TokenType::Notnull);
  383. return create_ast_node<NullExpression>(move(expression), invert_expression);
  384. }
  385. Optional<NonnullRefPtr<Expression>> Parser::parse_between_expression(NonnullRefPtr<Expression> expression, bool invert_expression)
  386. {
  387. if (!match(TokenType::Between))
  388. return {};
  389. consume();
  390. auto nested = parse_expression();
  391. if (!is<BinaryOperatorExpression>(*nested)) {
  392. expected("Binary Expression");
  393. return create_ast_node<ErrorExpression>();
  394. }
  395. const auto& binary_expression = static_cast<const BinaryOperatorExpression&>(*nested);
  396. if (binary_expression.type() != BinaryOperator::And) {
  397. expected("AND Expression");
  398. return create_ast_node<ErrorExpression>();
  399. }
  400. return create_ast_node<BetweenExpression>(move(expression), binary_expression.lhs(), binary_expression.rhs(), invert_expression);
  401. }
  402. Optional<NonnullRefPtr<Expression>> Parser::parse_in_expression(NonnullRefPtr<Expression> expression, bool invert_expression)
  403. {
  404. if (!match(TokenType::In))
  405. return {};
  406. consume();
  407. if (consume_if(TokenType::ParenOpen)) {
  408. if (match(TokenType::Select)) {
  409. // FIXME: Parse "select-stmt".
  410. return {};
  411. }
  412. // FIXME: Consolidate this with parse_chained_expression(). That method consumes the opening paren as
  413. // well, and also requires at least one expression (whereas this allows for an empty chain).
  414. NonnullRefPtrVector<Expression> expressions;
  415. if (!match(TokenType::ParenClose)) {
  416. do {
  417. expressions.append(parse_expression());
  418. if (match(TokenType::ParenClose))
  419. break;
  420. consume(TokenType::Comma);
  421. } while (!match(TokenType::Eof));
  422. }
  423. consume(TokenType::ParenClose);
  424. auto chain = create_ast_node<ChainedExpression>(move(expressions));
  425. return create_ast_node<InChainedExpression>(move(expression), move(chain), invert_expression);
  426. }
  427. String schema_or_table_name = consume(TokenType::Identifier).value();
  428. String schema_name;
  429. String table_name;
  430. if (consume_if(TokenType::Period)) {
  431. schema_name = move(schema_or_table_name);
  432. table_name = consume(TokenType::Identifier).value();
  433. } else {
  434. table_name = move(schema_or_table_name);
  435. }
  436. if (match(TokenType::ParenOpen)) {
  437. // FIXME: Parse "table-function".
  438. return {};
  439. }
  440. return create_ast_node<InTableExpression>(move(expression), move(schema_name), move(table_name), invert_expression);
  441. }
  442. NonnullRefPtr<ColumnDefinition> Parser::parse_column_definition()
  443. {
  444. // https://sqlite.org/syntax/column-def.html
  445. auto name = consume(TokenType::Identifier).value();
  446. auto type_name = match(TokenType::Identifier)
  447. ? parse_type_name()
  448. // https://www.sqlite.org/datatype3.html: If no type is specified then the column has affinity BLOB.
  449. : create_ast_node<TypeName>("BLOB", NonnullRefPtrVector<SignedNumber> {});
  450. // FIXME: Parse "column-constraint".
  451. return create_ast_node<ColumnDefinition>(move(name), move(type_name));
  452. }
  453. NonnullRefPtr<TypeName> Parser::parse_type_name()
  454. {
  455. // https: //sqlite.org/syntax/type-name.html
  456. auto name = consume(TokenType::Identifier).value();
  457. NonnullRefPtrVector<SignedNumber> signed_numbers;
  458. if (consume_if(TokenType::ParenOpen)) {
  459. signed_numbers.append(parse_signed_number());
  460. if (consume_if(TokenType::Comma))
  461. signed_numbers.append(parse_signed_number());
  462. consume(TokenType::ParenClose);
  463. }
  464. return create_ast_node<TypeName>(move(name), move(signed_numbers));
  465. }
  466. NonnullRefPtr<SignedNumber> Parser::parse_signed_number()
  467. {
  468. // https://sqlite.org/syntax/signed-number.html
  469. bool is_positive = true;
  470. if (consume_if(TokenType::Plus))
  471. is_positive = true;
  472. else if (consume_if(TokenType::Minus))
  473. is_positive = false;
  474. if (match(TokenType::NumericLiteral)) {
  475. auto number = consume(TokenType::NumericLiteral).double_value();
  476. return create_ast_node<SignedNumber>(is_positive ? number : (number * -1));
  477. }
  478. expected("NumericLiteral");
  479. return create_ast_node<SignedNumber>(0);
  480. }
  481. Token Parser::consume()
  482. {
  483. auto old_token = m_parser_state.m_token;
  484. m_parser_state.m_token = m_parser_state.m_lexer.next();
  485. return old_token;
  486. }
  487. Token Parser::consume(TokenType expected_type)
  488. {
  489. if (!match(expected_type)) {
  490. expected(Token::name(expected_type));
  491. }
  492. return consume();
  493. }
  494. bool Parser::consume_if(TokenType expected_type)
  495. {
  496. if (!match(expected_type))
  497. return false;
  498. consume();
  499. return true;
  500. }
  501. bool Parser::match(TokenType type) const
  502. {
  503. return m_parser_state.m_token.type() == type;
  504. }
  505. void Parser::expected(StringView what)
  506. {
  507. syntax_error(String::formatted("Unexpected token {}, expected {}", m_parser_state.m_token.name(), what));
  508. }
  509. void Parser::syntax_error(String message)
  510. {
  511. m_parser_state.m_errors.append({ move(message), position() });
  512. }
  513. Parser::Position Parser::position() const
  514. {
  515. return {
  516. m_parser_state.m_token.line_number(),
  517. m_parser_state.m_token.line_column()
  518. };
  519. }
  520. Parser::ParserState::ParserState(Lexer lexer)
  521. : m_lexer(move(lexer))
  522. , m_token(m_lexer.next())
  523. {
  524. }
  525. }