RegexParser.cpp 61 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761
  1. /*
  2. * Copyright (c) 2020, Emanuel Sprung <emanuel.sprung@gmail.com>
  3. * Copyright (c) 2020-2021, the SerenityOS developers.
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include "RegexParser.h"
  8. #include "RegexDebug.h"
  9. #include <AK/String.h>
  10. #include <AK/StringBuilder.h>
  11. #include <AK/StringUtils.h>
  12. namespace regex {
  13. ALWAYS_INLINE bool Parser::set_error(Error error)
  14. {
  15. if (m_parser_state.error == Error::NoError) {
  16. m_parser_state.error = error;
  17. m_parser_state.error_token = m_parser_state.current_token;
  18. }
  19. return false; // always return false, that eases the API usage (return set_error(...)) :^)
  20. }
  21. ALWAYS_INLINE bool Parser::done() const
  22. {
  23. return match(TokenType::Eof);
  24. }
  25. ALWAYS_INLINE bool Parser::match(TokenType type) const
  26. {
  27. return m_parser_state.current_token.type() == type;
  28. }
  29. ALWAYS_INLINE bool Parser::match(char ch) const
  30. {
  31. return m_parser_state.current_token.type() == TokenType::Char && m_parser_state.current_token.value().length() == 1 && m_parser_state.current_token.value()[0] == ch;
  32. }
  33. ALWAYS_INLINE Token Parser::consume()
  34. {
  35. auto old_token = m_parser_state.current_token;
  36. m_parser_state.current_token = m_parser_state.lexer.next();
  37. return old_token;
  38. }
  39. ALWAYS_INLINE Token Parser::consume(TokenType type, Error error)
  40. {
  41. if (m_parser_state.current_token.type() != type) {
  42. set_error(error);
  43. dbgln_if(REGEX_DEBUG, "[PARSER] Error: Unexpected token {}. Expected: {}", m_parser_state.current_token.name(), Token::name(type));
  44. }
  45. return consume();
  46. }
  47. ALWAYS_INLINE bool Parser::consume(const String& str)
  48. {
  49. size_t potentially_go_back { 1 };
  50. for (auto ch : str) {
  51. if (match(TokenType::Char)) {
  52. if (m_parser_state.current_token.value()[0] != ch) {
  53. m_parser_state.lexer.back(potentially_go_back);
  54. m_parser_state.current_token = m_parser_state.lexer.next();
  55. return false;
  56. }
  57. } else {
  58. m_parser_state.lexer.back(potentially_go_back);
  59. m_parser_state.current_token = m_parser_state.lexer.next();
  60. return false;
  61. }
  62. consume(TokenType::Char, Error::NoError);
  63. ++potentially_go_back;
  64. }
  65. return true;
  66. }
  67. ALWAYS_INLINE bool Parser::try_skip(StringView str)
  68. {
  69. if (str.starts_with(m_parser_state.current_token.value()))
  70. str = str.substring_view(m_parser_state.current_token.value().length(), str.length() - m_parser_state.current_token.value().length());
  71. else
  72. return false;
  73. size_t potentially_go_back { 0 };
  74. for (auto ch : str) {
  75. if (!m_parser_state.lexer.try_skip(ch)) {
  76. m_parser_state.lexer.back(potentially_go_back);
  77. return false;
  78. }
  79. ++potentially_go_back;
  80. }
  81. m_parser_state.current_token = m_parser_state.lexer.next();
  82. return true;
  83. }
  84. ALWAYS_INLINE bool Parser::lookahead_any(StringView str)
  85. {
  86. for (auto ch : str) {
  87. if (match(ch))
  88. return true;
  89. }
  90. return false;
  91. }
  92. ALWAYS_INLINE char Parser::skip()
  93. {
  94. char ch;
  95. if (m_parser_state.current_token.value().length() == 1) {
  96. ch = m_parser_state.current_token.value()[0];
  97. } else {
  98. m_parser_state.lexer.back(m_parser_state.current_token.value().length());
  99. ch = m_parser_state.lexer.skip();
  100. }
  101. m_parser_state.current_token = m_parser_state.lexer.next();
  102. return ch;
  103. }
  104. ALWAYS_INLINE void Parser::back(size_t count)
  105. {
  106. m_parser_state.lexer.back(count);
  107. m_parser_state.current_token = m_parser_state.lexer.next();
  108. }
  109. ALWAYS_INLINE void Parser::reset()
  110. {
  111. m_parser_state.bytecode.clear();
  112. m_parser_state.lexer.reset();
  113. m_parser_state.current_token = m_parser_state.lexer.next();
  114. m_parser_state.error = Error::NoError;
  115. m_parser_state.error_token = { TokenType::Eof, 0, StringView(nullptr) };
  116. m_parser_state.capture_group_minimum_lengths.clear();
  117. m_parser_state.capture_groups_count = 0;
  118. m_parser_state.named_capture_groups_count = 0;
  119. m_parser_state.named_capture_group_minimum_lengths.clear();
  120. m_parser_state.named_capture_groups.clear();
  121. }
  122. Parser::Result Parser::parse(Optional<AllOptions> regex_options)
  123. {
  124. reset();
  125. if (regex_options.has_value())
  126. m_parser_state.regex_options = regex_options.value();
  127. if (parse_internal(m_parser_state.bytecode, m_parser_state.match_length_minimum))
  128. consume(TokenType::Eof, Error::InvalidPattern);
  129. else
  130. set_error(Error::InvalidPattern);
  131. dbgln_if(REGEX_DEBUG, "[PARSER] Produced bytecode with {} entries (opcodes + arguments)", m_parser_state.bytecode.size());
  132. return {
  133. move(m_parser_state.bytecode),
  134. move(m_parser_state.capture_groups_count),
  135. move(m_parser_state.named_capture_groups_count),
  136. move(m_parser_state.match_length_minimum),
  137. move(m_parser_state.error),
  138. move(m_parser_state.error_token)
  139. };
  140. }
  141. ALWAYS_INLINE bool Parser::match_ordinary_characters()
  142. {
  143. // NOTE: This method must not be called during bracket and repetition parsing!
  144. // FIXME: Add assertion for that?
  145. auto type = m_parser_state.current_token.type();
  146. return (type == TokenType::Char
  147. || type == TokenType::Comma
  148. || type == TokenType::Slash
  149. || type == TokenType::EqualSign
  150. || type == TokenType::HyphenMinus
  151. || type == TokenType::Colon);
  152. }
  153. // =============================
  154. // PosixExtended Parser
  155. // =============================
  156. bool PosixExtendedParser::parse_internal(ByteCode& stack, size_t& match_length_minimum)
  157. {
  158. return parse_root(stack, match_length_minimum);
  159. }
  160. ALWAYS_INLINE bool PosixExtendedParser::match_repetition_symbol()
  161. {
  162. auto type = m_parser_state.current_token.type();
  163. return (type == TokenType::Asterisk
  164. || type == TokenType::Plus
  165. || type == TokenType::Questionmark
  166. || type == TokenType::LeftCurly);
  167. }
  168. ALWAYS_INLINE bool PosixExtendedParser::parse_repetition_symbol(ByteCode& bytecode_to_repeat, size_t& match_length_minimum)
  169. {
  170. if (match(TokenType::LeftCurly)) {
  171. consume();
  172. StringBuilder number_builder;
  173. while (match(TokenType::Char)) {
  174. number_builder.append(consume().value());
  175. }
  176. auto maybe_minimum = number_builder.build().to_uint();
  177. if (!maybe_minimum.has_value())
  178. return set_error(Error::InvalidBraceContent);
  179. auto minimum = maybe_minimum.value();
  180. match_length_minimum *= minimum;
  181. if (match(TokenType::Comma)) {
  182. consume();
  183. } else {
  184. ByteCode bytecode;
  185. bytecode.insert_bytecode_repetition_n(bytecode_to_repeat, minimum);
  186. bytecode_to_repeat = move(bytecode);
  187. consume(TokenType::RightCurly, Error::MismatchingBrace);
  188. return !has_error();
  189. }
  190. Optional<size_t> maybe_maximum {};
  191. number_builder.clear();
  192. while (match(TokenType::Char)) {
  193. number_builder.append(consume().value());
  194. }
  195. if (!number_builder.is_empty()) {
  196. auto value = number_builder.build().to_uint();
  197. if (!value.has_value() || minimum > value.value())
  198. return set_error(Error::InvalidBraceContent);
  199. maybe_maximum = value.value();
  200. }
  201. ByteCode::transform_bytecode_repetition_min_max(bytecode_to_repeat, minimum, maybe_maximum);
  202. consume(TokenType::RightCurly, Error::MismatchingBrace);
  203. return !has_error();
  204. } else if (match(TokenType::Plus)) {
  205. consume();
  206. bool nongreedy = match(TokenType::Questionmark);
  207. if (nongreedy)
  208. consume();
  209. // Note: don't touch match_length_minimum, it's already correct
  210. ByteCode::transform_bytecode_repetition_min_one(bytecode_to_repeat, !nongreedy);
  211. return !has_error();
  212. } else if (match(TokenType::Asterisk)) {
  213. consume();
  214. match_length_minimum = 0;
  215. bool nongreedy = match(TokenType::Questionmark);
  216. if (nongreedy)
  217. consume();
  218. ByteCode::transform_bytecode_repetition_any(bytecode_to_repeat, !nongreedy);
  219. return !has_error();
  220. } else if (match(TokenType::Questionmark)) {
  221. consume();
  222. match_length_minimum = 0;
  223. bool nongreedy = match(TokenType::Questionmark);
  224. if (nongreedy)
  225. consume();
  226. ByteCode::transform_bytecode_repetition_zero_or_one(bytecode_to_repeat, !nongreedy);
  227. return !has_error();
  228. }
  229. return false;
  230. }
  231. ALWAYS_INLINE bool PosixExtendedParser::parse_bracket_expression(ByteCode& stack, size_t& match_length_minimum)
  232. {
  233. Vector<CompareTypeAndValuePair> values;
  234. for (;;) {
  235. if (match(TokenType::HyphenMinus)) {
  236. consume();
  237. if (values.is_empty() || (values.size() == 1 && values.last().type == CharacterCompareType::Inverse)) {
  238. // first in the bracket expression
  239. values.append({ CharacterCompareType::Char, (ByteCodeValueType)'-' });
  240. } else if (match(TokenType::RightBracket)) {
  241. // Last in the bracket expression
  242. values.append({ CharacterCompareType::Char, (ByteCodeValueType)'-' });
  243. } else if (values.last().type == CharacterCompareType::Char) {
  244. values.append({ CharacterCompareType::RangeExpressionDummy, 0 });
  245. if (match(TokenType::HyphenMinus)) {
  246. consume();
  247. // Valid range, add ordinary character
  248. values.append({ CharacterCompareType::Char, (ByteCodeValueType)'-' });
  249. }
  250. } else {
  251. return set_error(Error::InvalidRange);
  252. }
  253. } else if (match(TokenType::Circumflex)) {
  254. auto t = consume();
  255. if (values.is_empty())
  256. values.append({ CharacterCompareType::Inverse, 0 });
  257. else
  258. values.append({ CharacterCompareType::Char, (ByteCodeValueType)*t.value().characters_without_null_termination() });
  259. } else if (match(TokenType::LeftBracket)) {
  260. consume();
  261. if (match(TokenType::Period)) {
  262. consume();
  263. // FIXME: Parse collating element, this is needed when we have locale support
  264. // This could have impact on length parameter, I guess.
  265. VERIFY_NOT_REACHED();
  266. consume(TokenType::Period, Error::InvalidCollationElement);
  267. consume(TokenType::RightBracket, Error::MismatchingBracket);
  268. } else if (match(TokenType::EqualSign)) {
  269. consume();
  270. // FIXME: Parse collating element, this is needed when we have locale support
  271. // This could have impact on length parameter, I guess.
  272. VERIFY_NOT_REACHED();
  273. consume(TokenType::EqualSign, Error::InvalidCollationElement);
  274. consume(TokenType::RightBracket, Error::MismatchingBracket);
  275. } else if (match(TokenType::Colon)) {
  276. consume();
  277. CharClass ch_class;
  278. // parse character class
  279. if (match(TokenType::Char)) {
  280. if (consume("alnum"))
  281. ch_class = CharClass::Alnum;
  282. else if (consume("alpha"))
  283. ch_class = CharClass::Alpha;
  284. else if (consume("blank"))
  285. ch_class = CharClass::Blank;
  286. else if (consume("cntrl"))
  287. ch_class = CharClass::Cntrl;
  288. else if (consume("digit"))
  289. ch_class = CharClass::Digit;
  290. else if (consume("graph"))
  291. ch_class = CharClass::Graph;
  292. else if (consume("lower"))
  293. ch_class = CharClass::Lower;
  294. else if (consume("print"))
  295. ch_class = CharClass::Print;
  296. else if (consume("punct"))
  297. ch_class = CharClass::Punct;
  298. else if (consume("space"))
  299. ch_class = CharClass::Space;
  300. else if (consume("upper"))
  301. ch_class = CharClass::Upper;
  302. else if (consume("xdigit"))
  303. ch_class = CharClass::Xdigit;
  304. else
  305. return set_error(Error::InvalidCharacterClass);
  306. values.append({ CharacterCompareType::CharClass, (ByteCodeValueType)ch_class });
  307. } else
  308. return set_error(Error::InvalidCharacterClass);
  309. // FIXME: we do not support locale specific character classes until locales are implemented
  310. consume(TokenType::Colon, Error::InvalidCharacterClass);
  311. consume(TokenType::RightBracket, Error::MismatchingBracket);
  312. } else {
  313. return set_error(Error::MismatchingBracket);
  314. }
  315. } else if (match(TokenType::RightBracket)) {
  316. if (values.is_empty() || (values.size() == 1 && values.last().type == CharacterCompareType::Inverse)) {
  317. // handle bracket as ordinary character
  318. values.append({ CharacterCompareType::Char, (ByteCodeValueType)*consume().value().characters_without_null_termination() });
  319. } else {
  320. // closing bracket expression
  321. break;
  322. }
  323. } else {
  324. values.append({ CharacterCompareType::Char, (ByteCodeValueType)skip() });
  325. }
  326. // check if range expression has to be completed...
  327. if (values.size() >= 3 && values.at(values.size() - 2).type == CharacterCompareType::RangeExpressionDummy) {
  328. if (values.last().type != CharacterCompareType::Char)
  329. return set_error(Error::InvalidRange);
  330. auto value2 = values.take_last();
  331. values.take_last(); // RangeExpressionDummy
  332. auto value1 = values.take_last();
  333. values.append({ CharacterCompareType::CharRange, static_cast<ByteCodeValueType>(CharRange { (u32)value1.value, (u32)value2.value }) });
  334. }
  335. }
  336. if (values.size())
  337. match_length_minimum = 1;
  338. if (values.first().type == CharacterCompareType::Inverse)
  339. match_length_minimum = 0;
  340. stack.insert_bytecode_compare_values(move(values));
  341. return !has_error();
  342. }
  343. ALWAYS_INLINE bool PosixExtendedParser::parse_sub_expression(ByteCode& stack, size_t& match_length_minimum)
  344. {
  345. ByteCode bytecode;
  346. size_t length = 0;
  347. bool should_parse_repetition_symbol { false };
  348. for (;;) {
  349. if (match_ordinary_characters()) {
  350. Token start_token = m_parser_state.current_token;
  351. Token last_token = m_parser_state.current_token;
  352. for (;;) {
  353. if (!match_ordinary_characters())
  354. break;
  355. ++length;
  356. last_token = consume();
  357. }
  358. if (length > 1) {
  359. // last character is inserted into 'bytecode' for duplication symbol handling
  360. auto new_length = length - ((match_repetition_symbol() && length > 1) ? 1 : 0);
  361. stack.insert_bytecode_compare_string({ start_token.value().characters_without_null_termination(), new_length });
  362. }
  363. if ((match_repetition_symbol() && length > 1) || length == 1) // Create own compare opcode for last character before duplication symbol
  364. bytecode.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)last_token.value().characters_without_null_termination()[0] } });
  365. should_parse_repetition_symbol = true;
  366. break;
  367. }
  368. if (match_repetition_symbol())
  369. return set_error(Error::InvalidRepetitionMarker);
  370. if (match(TokenType::Period)) {
  371. length = 1;
  372. consume();
  373. bytecode.insert_bytecode_compare_values({ { CharacterCompareType::AnyChar, 0 } });
  374. should_parse_repetition_symbol = true;
  375. break;
  376. }
  377. if (match(TokenType::EscapeSequence)) {
  378. length = 1;
  379. Token t = consume();
  380. dbgln_if(REGEX_DEBUG, "[PARSER] EscapeSequence with substring {}", t.value());
  381. bytecode.insert_bytecode_compare_values({ { CharacterCompareType::Char, (u32)t.value().characters_without_null_termination()[1] } });
  382. should_parse_repetition_symbol = true;
  383. break;
  384. }
  385. if (match(TokenType::LeftBracket)) {
  386. consume();
  387. ByteCode sub_ops;
  388. if (!parse_bracket_expression(sub_ops, length) || !sub_ops.size())
  389. return set_error(Error::InvalidBracketContent);
  390. bytecode.extend(move(sub_ops));
  391. consume(TokenType::RightBracket, Error::MismatchingBracket);
  392. should_parse_repetition_symbol = true;
  393. break;
  394. }
  395. if (match(TokenType::RightBracket)) {
  396. return set_error(Error::MismatchingBracket);
  397. }
  398. if (match(TokenType::RightCurly)) {
  399. return set_error(Error::MismatchingBrace);
  400. }
  401. if (match(TokenType::Circumflex)) {
  402. consume();
  403. bytecode.empend((ByteCodeValueType)OpCodeId::CheckBegin);
  404. break;
  405. }
  406. if (match(TokenType::Dollar)) {
  407. consume();
  408. bytecode.empend((ByteCodeValueType)OpCodeId::CheckEnd);
  409. break;
  410. }
  411. if (match(TokenType::RightParen))
  412. return false;
  413. if (match(TokenType::LeftParen)) {
  414. consume();
  415. Optional<StringView> capture_group_name;
  416. bool prevent_capture_group = false;
  417. if (match(TokenType::Questionmark)) {
  418. consume();
  419. if (match(TokenType::Colon)) {
  420. consume();
  421. prevent_capture_group = true;
  422. } else if (consume("<")) { // named capturing group
  423. Token start_token = m_parser_state.current_token;
  424. Token last_token = m_parser_state.current_token;
  425. size_t capture_group_name_length = 0;
  426. for (;;) {
  427. if (!match_ordinary_characters())
  428. return set_error(Error::InvalidNameForCaptureGroup);
  429. if (match(TokenType::Char) && m_parser_state.current_token.value()[0] == '>') {
  430. consume();
  431. break;
  432. }
  433. ++capture_group_name_length;
  434. last_token = consume();
  435. }
  436. capture_group_name = StringView(start_token.value().characters_without_null_termination(), capture_group_name_length);
  437. } else if (match(TokenType::EqualSign)) { // positive lookahead
  438. consume();
  439. VERIFY_NOT_REACHED();
  440. } else if (consume("!")) { // negative lookahead
  441. VERIFY_NOT_REACHED();
  442. } else if (consume("<")) {
  443. if (match(TokenType::EqualSign)) { // positive lookbehind
  444. consume();
  445. VERIFY_NOT_REACHED();
  446. }
  447. if (consume("!")) // negative lookbehind
  448. VERIFY_NOT_REACHED();
  449. } else {
  450. return set_error(Error::InvalidRepetitionMarker);
  451. }
  452. }
  453. if (!(m_parser_state.regex_options & AllFlags::SkipSubExprResults || prevent_capture_group)) {
  454. if (capture_group_name.has_value())
  455. bytecode.insert_bytecode_group_capture_left(capture_group_name.value());
  456. else
  457. bytecode.insert_bytecode_group_capture_left(m_parser_state.capture_groups_count);
  458. }
  459. ByteCode capture_group_bytecode;
  460. if (!parse_root(capture_group_bytecode, length))
  461. return set_error(Error::InvalidPattern);
  462. bytecode.extend(move(capture_group_bytecode));
  463. consume(TokenType::RightParen, Error::MismatchingParen);
  464. if (!(m_parser_state.regex_options & AllFlags::SkipSubExprResults || prevent_capture_group)) {
  465. if (capture_group_name.has_value()) {
  466. bytecode.insert_bytecode_group_capture_right(capture_group_name.value());
  467. ++m_parser_state.named_capture_groups_count;
  468. } else {
  469. bytecode.insert_bytecode_group_capture_right(m_parser_state.capture_groups_count);
  470. ++m_parser_state.capture_groups_count;
  471. }
  472. }
  473. should_parse_repetition_symbol = true;
  474. break;
  475. }
  476. return false;
  477. }
  478. if (match_repetition_symbol()) {
  479. if (should_parse_repetition_symbol)
  480. parse_repetition_symbol(bytecode, length);
  481. else
  482. return set_error(Error::InvalidRepetitionMarker);
  483. }
  484. stack.extend(move(bytecode));
  485. match_length_minimum += length;
  486. return true;
  487. }
  488. bool PosixExtendedParser::parse_root(ByteCode& stack, size_t& match_length_minimum)
  489. {
  490. ByteCode bytecode_left;
  491. size_t match_length_minimum_left { 0 };
  492. if (match_repetition_symbol())
  493. return set_error(Error::InvalidRepetitionMarker);
  494. for (;;) {
  495. if (!parse_sub_expression(bytecode_left, match_length_minimum_left))
  496. break;
  497. if (match(TokenType::Pipe)) {
  498. consume();
  499. ByteCode bytecode_right;
  500. size_t match_length_minimum_right { 0 };
  501. if (!parse_root(bytecode_right, match_length_minimum_right) || bytecode_right.is_empty())
  502. return set_error(Error::InvalidPattern);
  503. ByteCode new_bytecode;
  504. new_bytecode.insert_bytecode_alternation(move(bytecode_left), move(bytecode_right));
  505. bytecode_left = move(new_bytecode);
  506. match_length_minimum_left = min(match_length_minimum_right, match_length_minimum_left);
  507. }
  508. }
  509. if (bytecode_left.is_empty())
  510. set_error(Error::EmptySubExpression);
  511. stack.extend(move(bytecode_left));
  512. match_length_minimum = match_length_minimum_left;
  513. return !has_error();
  514. }
  515. // =============================
  516. // ECMA262 Parser
  517. // =============================
  518. bool ECMA262Parser::parse_internal(ByteCode& stack, size_t& match_length_minimum)
  519. {
  520. if (m_parser_state.regex_options.has_flag_set(AllFlags::Unicode)) {
  521. return parse_pattern(stack, match_length_minimum, true, true);
  522. } else {
  523. ByteCode new_stack;
  524. size_t new_match_length = 0;
  525. auto res = parse_pattern(new_stack, new_match_length, false, false);
  526. if (m_parser_state.named_capture_groups_count > 0) {
  527. reset();
  528. return parse_pattern(stack, match_length_minimum, false, true);
  529. }
  530. if (!res)
  531. return false;
  532. stack.extend(new_stack);
  533. match_length_minimum = new_match_length;
  534. return res;
  535. }
  536. }
  537. bool ECMA262Parser::parse_pattern(ByteCode& stack, size_t& match_length_minimum, bool unicode, bool named)
  538. {
  539. return parse_disjunction(stack, match_length_minimum, unicode, named);
  540. }
  541. bool ECMA262Parser::parse_disjunction(ByteCode& stack, size_t& match_length_minimum, bool unicode, bool named)
  542. {
  543. ByteCode left_alternative_stack;
  544. size_t left_alternative_min_length = 0;
  545. auto alt_ok = parse_alternative(left_alternative_stack, left_alternative_min_length, unicode, named);
  546. if (!alt_ok)
  547. return false;
  548. if (!match(TokenType::Pipe)) {
  549. stack.extend(left_alternative_stack);
  550. match_length_minimum = left_alternative_min_length;
  551. return alt_ok;
  552. }
  553. consume();
  554. ByteCode right_alternative_stack;
  555. size_t right_alternative_min_length = 0;
  556. auto continuation_ok = parse_disjunction(right_alternative_stack, right_alternative_min_length, unicode, named);
  557. if (!continuation_ok)
  558. return false;
  559. stack.insert_bytecode_alternation(move(left_alternative_stack), move(right_alternative_stack));
  560. match_length_minimum = min(left_alternative_min_length, right_alternative_min_length);
  561. return continuation_ok;
  562. }
  563. bool ECMA262Parser::parse_alternative(ByteCode& stack, size_t& match_length_minimum, bool unicode, bool named)
  564. {
  565. for (;;) {
  566. if (match(TokenType::Eof))
  567. return true;
  568. if (parse_term(stack, match_length_minimum, unicode, named))
  569. continue;
  570. return !has_error();
  571. }
  572. }
  573. bool ECMA262Parser::parse_term(ByteCode& stack, size_t& match_length_minimum, bool unicode, bool named)
  574. {
  575. if (parse_assertion(stack, match_length_minimum, unicode, named))
  576. return true;
  577. ByteCode atom_stack;
  578. size_t minimum_atom_length = 0;
  579. auto parse_with_quantifier = [&] {
  580. bool did_parse_one = false;
  581. if (m_should_use_browser_extended_grammar)
  582. did_parse_one = parse_extended_atom(atom_stack, minimum_atom_length, named);
  583. if (!did_parse_one)
  584. did_parse_one = parse_atom(atom_stack, minimum_atom_length, unicode, named);
  585. if (!did_parse_one)
  586. return false;
  587. VERIFY(did_parse_one);
  588. if (!parse_quantifier(atom_stack, minimum_atom_length, unicode, named))
  589. return false;
  590. return true;
  591. };
  592. if (!parse_with_quantifier())
  593. return false;
  594. stack.extend(move(atom_stack));
  595. match_length_minimum += minimum_atom_length;
  596. return true;
  597. }
  598. bool ECMA262Parser::parse_assertion(ByteCode& stack, [[maybe_unused]] size_t& match_length_minimum, bool unicode, bool named)
  599. {
  600. if (match(TokenType::Circumflex)) {
  601. consume();
  602. stack.empend((ByteCodeValueType)OpCodeId::CheckBegin);
  603. return true;
  604. }
  605. if (match(TokenType::Dollar)) {
  606. consume();
  607. stack.empend((ByteCodeValueType)OpCodeId::CheckEnd);
  608. return true;
  609. }
  610. if (try_skip("\\b")) {
  611. stack.insert_bytecode_check_boundary(BoundaryCheckType::Word);
  612. return true;
  613. }
  614. if (try_skip("\\B")) {
  615. stack.insert_bytecode_check_boundary(BoundaryCheckType::NonWord);
  616. return true;
  617. }
  618. if (match(TokenType::LeftParen)) {
  619. if (!try_skip("(?"))
  620. return false;
  621. if (done()) {
  622. set_error(Error::InvalidCaptureGroup);
  623. return false;
  624. }
  625. ByteCode assertion_stack;
  626. size_t length_dummy = 0;
  627. bool should_parse_forward_assertion = m_should_use_browser_extended_grammar ? unicode : true;
  628. if (should_parse_forward_assertion && try_skip("=")) {
  629. if (!parse_inner_disjunction(assertion_stack, length_dummy, unicode, named))
  630. return false;
  631. stack.insert_bytecode_lookaround(move(assertion_stack), ByteCode::LookAroundType::LookAhead);
  632. return true;
  633. }
  634. if (should_parse_forward_assertion && try_skip("!")) {
  635. if (!parse_inner_disjunction(assertion_stack, length_dummy, unicode, named))
  636. return false;
  637. stack.insert_bytecode_lookaround(move(assertion_stack), ByteCode::LookAroundType::NegatedLookAhead);
  638. return true;
  639. }
  640. if (m_should_use_browser_extended_grammar) {
  641. if (!unicode) {
  642. if (parse_quantifiable_assertion(assertion_stack, match_length_minimum, named)) {
  643. stack.extend(move(assertion_stack));
  644. return true;
  645. }
  646. }
  647. }
  648. if (try_skip("<=")) {
  649. if (!parse_inner_disjunction(assertion_stack, length_dummy, unicode, named))
  650. return false;
  651. // FIXME: Somehow ensure that this assertion regexp has a fixed length.
  652. stack.insert_bytecode_lookaround(move(assertion_stack), ByteCode::LookAroundType::LookBehind, length_dummy);
  653. return true;
  654. }
  655. if (try_skip("<!")) {
  656. if (!parse_inner_disjunction(assertion_stack, length_dummy, unicode, named))
  657. return false;
  658. stack.insert_bytecode_lookaround(move(assertion_stack), ByteCode::LookAroundType::NegatedLookBehind, length_dummy);
  659. return true;
  660. }
  661. // If none of these matched, put the '(?' back.
  662. m_parser_state.lexer.back(3);
  663. m_parser_state.current_token = m_parser_state.lexer.next();
  664. return false;
  665. }
  666. return false;
  667. }
  668. bool ECMA262Parser::parse_inner_disjunction(ByteCode& bytecode_stack, size_t& length, bool unicode, bool named)
  669. {
  670. auto disjunction_ok = parse_disjunction(bytecode_stack, length, unicode, named);
  671. if (!disjunction_ok)
  672. return false;
  673. consume(TokenType::RightParen, Error::MismatchingParen);
  674. return true;
  675. }
  676. bool ECMA262Parser::parse_quantifiable_assertion(ByteCode& stack, size_t&, bool named)
  677. {
  678. VERIFY(m_should_use_browser_extended_grammar);
  679. ByteCode assertion_stack;
  680. size_t match_length_minimum = 0;
  681. if (try_skip("=")) {
  682. if (!parse_inner_disjunction(assertion_stack, match_length_minimum, false, named))
  683. return false;
  684. stack.insert_bytecode_lookaround(move(assertion_stack), ByteCode::LookAroundType::LookAhead);
  685. return true;
  686. }
  687. if (try_skip("!")) {
  688. if (!parse_inner_disjunction(assertion_stack, match_length_minimum, false, named))
  689. return false;
  690. stack.insert_bytecode_lookaround(move(assertion_stack), ByteCode::LookAroundType::NegatedLookAhead);
  691. return true;
  692. }
  693. return false;
  694. }
  695. StringView ECMA262Parser::read_digits_as_string(ReadDigitsInitialZeroState initial_zero, bool hex, int max_count)
  696. {
  697. if (!match(TokenType::Char))
  698. return {};
  699. if (initial_zero == ReadDigitsInitialZeroState::Disallow && m_parser_state.current_token.value() == "0")
  700. return {};
  701. int count = 0;
  702. size_t offset = 0;
  703. auto start_token = m_parser_state.current_token;
  704. while (match(TokenType::Char)) {
  705. auto& c = m_parser_state.current_token.value();
  706. if (max_count > 0 && count >= max_count)
  707. break;
  708. if (hex && !AK::StringUtils::convert_to_uint_from_hex(c).has_value())
  709. break;
  710. if (!hex && !c.to_uint().has_value())
  711. break;
  712. offset += consume().value().length();
  713. ++count;
  714. }
  715. return StringView { start_token.value().characters_without_null_termination(), offset };
  716. }
  717. Optional<unsigned> ECMA262Parser::read_digits(ECMA262Parser::ReadDigitsInitialZeroState initial_zero, bool hex, int max_count)
  718. {
  719. auto str = read_digits_as_string(initial_zero, hex, max_count);
  720. if (str.is_empty())
  721. return {};
  722. if (hex)
  723. return AK::StringUtils::convert_to_uint_from_hex(str);
  724. return str.to_uint();
  725. }
  726. bool ECMA262Parser::parse_quantifier(ByteCode& stack, size_t& match_length_minimum, bool, bool)
  727. {
  728. enum class Repetition {
  729. OneOrMore,
  730. ZeroOrMore,
  731. Optional,
  732. Explicit,
  733. None,
  734. } repetition_mark { Repetition::None };
  735. bool ungreedy = false;
  736. Optional<size_t> repeat_min, repeat_max;
  737. if (match(TokenType::Asterisk)) {
  738. consume();
  739. repetition_mark = Repetition::ZeroOrMore;
  740. } else if (match(TokenType::Plus)) {
  741. consume();
  742. repetition_mark = Repetition::OneOrMore;
  743. } else if (match(TokenType::Questionmark)) {
  744. consume();
  745. repetition_mark = Repetition::Optional;
  746. } else if (match(TokenType::LeftCurly)) {
  747. consume();
  748. auto chars_consumed = 1;
  749. repetition_mark = Repetition::Explicit;
  750. auto low_bound_string = read_digits_as_string();
  751. chars_consumed += low_bound_string.length();
  752. auto low_bound = low_bound_string.to_uint();
  753. if (!low_bound.has_value()) {
  754. back(chars_consumed + 1);
  755. return true;
  756. }
  757. repeat_min = low_bound.value();
  758. if (match(TokenType::Comma)) {
  759. consume();
  760. ++chars_consumed;
  761. auto high_bound_string = read_digits_as_string();
  762. auto high_bound = high_bound_string.to_uint();
  763. if (high_bound.has_value()) {
  764. repeat_max = high_bound.value();
  765. chars_consumed += high_bound_string.length();
  766. }
  767. } else {
  768. repeat_max = repeat_min;
  769. }
  770. if (!match(TokenType::RightCurly)) {
  771. back(chars_consumed + 1);
  772. return true;
  773. }
  774. consume();
  775. ++chars_consumed;
  776. if (repeat_max.has_value()) {
  777. if (repeat_min.value() > repeat_max.value())
  778. set_error(Error::InvalidBraceContent);
  779. }
  780. } else {
  781. return true;
  782. }
  783. if (match(TokenType::Questionmark)) {
  784. consume();
  785. ungreedy = true;
  786. }
  787. switch (repetition_mark) {
  788. case Repetition::OneOrMore:
  789. ByteCode::transform_bytecode_repetition_min_one(stack, !ungreedy);
  790. break;
  791. case Repetition::ZeroOrMore:
  792. ByteCode::transform_bytecode_repetition_any(stack, !ungreedy);
  793. match_length_minimum = 0;
  794. break;
  795. case Repetition::Optional:
  796. ByteCode::transform_bytecode_repetition_zero_or_one(stack, !ungreedy);
  797. match_length_minimum = 0;
  798. break;
  799. case Repetition::Explicit:
  800. ByteCode::transform_bytecode_repetition_min_max(stack, repeat_min.value(), repeat_max, !ungreedy);
  801. match_length_minimum *= repeat_min.value();
  802. break;
  803. case Repetition::None:
  804. VERIFY_NOT_REACHED();
  805. }
  806. return true;
  807. }
  808. bool ECMA262Parser::parse_atom(ByteCode& stack, size_t& match_length_minimum, bool unicode, bool named)
  809. {
  810. if (match(TokenType::EscapeSequence)) {
  811. // Also part of AtomEscape.
  812. auto token = consume();
  813. match_length_minimum += 1;
  814. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)token.value()[1] } });
  815. return true;
  816. }
  817. if (try_skip("\\")) {
  818. // AtomEscape.
  819. return parse_atom_escape(stack, match_length_minimum, unicode, named);
  820. }
  821. if (match(TokenType::LeftBracket)) {
  822. // Character class.
  823. return parse_character_class(stack, match_length_minimum, unicode && !m_should_use_browser_extended_grammar, named);
  824. }
  825. if (match(TokenType::LeftParen)) {
  826. // Non-capturing group, or a capture group.
  827. return parse_capture_group(stack, match_length_minimum, unicode && !m_should_use_browser_extended_grammar, named);
  828. }
  829. if (match(TokenType::Period)) {
  830. consume();
  831. match_length_minimum += 1;
  832. stack.insert_bytecode_compare_values({ { CharacterCompareType::AnyChar, 0 } });
  833. return true;
  834. }
  835. if (match(TokenType::Circumflex) || match(TokenType::Dollar) || match(TokenType::RightParen)
  836. || match(TokenType::Pipe) || match(TokenType::Plus) || match(TokenType::Asterisk)
  837. || match(TokenType::Questionmark)) {
  838. return false;
  839. }
  840. if (match(TokenType::RightBracket) || match(TokenType::RightCurly) || match(TokenType::LeftCurly)) {
  841. if (m_should_use_browser_extended_grammar) {
  842. auto token = consume();
  843. match_length_minimum += 1;
  844. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)token.value()[0] } });
  845. return true;
  846. } else {
  847. return false;
  848. }
  849. }
  850. if (match_ordinary_characters()) {
  851. auto token = consume().value();
  852. match_length_minimum += 1;
  853. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)token[0] } });
  854. return true;
  855. }
  856. set_error(Error::InvalidPattern);
  857. return false;
  858. }
  859. bool ECMA262Parser::parse_extended_atom(ByteCode&, size_t&, bool)
  860. {
  861. // Note: This includes only rules *not* present in parse_atom()
  862. VERIFY(m_should_use_browser_extended_grammar);
  863. if (parse_invalid_braced_quantifier())
  864. return true; // FAIL FAIL FAIL
  865. return false;
  866. }
  867. bool ECMA262Parser::parse_invalid_braced_quantifier()
  868. {
  869. if (!match(TokenType::LeftCurly))
  870. return false;
  871. consume();
  872. size_t chars_consumed = 1;
  873. auto low_bound = read_digits_as_string();
  874. StringView high_bound;
  875. if (low_bound.is_empty()) {
  876. back(chars_consumed + 1);
  877. return false;
  878. }
  879. chars_consumed += low_bound.length();
  880. if (match(TokenType::Comma)) {
  881. consume();
  882. ++chars_consumed;
  883. high_bound = read_digits_as_string();
  884. chars_consumed += high_bound.length();
  885. }
  886. if (!match(TokenType::RightCurly)) {
  887. back(chars_consumed + 1);
  888. return false;
  889. }
  890. consume();
  891. set_error(Error::InvalidPattern);
  892. return true;
  893. }
  894. bool ECMA262Parser::parse_atom_escape(ByteCode& stack, size_t& match_length_minimum, bool unicode, bool named)
  895. {
  896. if (auto escape_str = read_digits_as_string(ReadDigitsInitialZeroState::Disallow); !escape_str.is_empty()) {
  897. if (auto escape = escape_str.to_uint(); escape.has_value()) {
  898. // See if this is a "back"-reference (we've already parsed the group it refers to)
  899. auto maybe_length = m_parser_state.capture_group_minimum_lengths.get(escape.value());
  900. if (maybe_length.has_value()) {
  901. match_length_minimum += maybe_length.value();
  902. stack.insert_bytecode_compare_values({ { CharacterCompareType::Reference, (ByteCodeValueType)escape.value() } });
  903. return true;
  904. }
  905. // It's not a pattern seen before, so we have to see if it's a valid reference to a future group.
  906. if (escape.value() <= ensure_total_number_of_capturing_parenthesis()) {
  907. // This refers to a future group, and it will _always_ be matching an empty string
  908. // So just match nothing and move on.
  909. return true;
  910. }
  911. if (!m_should_use_browser_extended_grammar) {
  912. set_error(Error::InvalidNumber);
  913. return false;
  914. }
  915. }
  916. // If not, put the characters back.
  917. back(escape_str.length());
  918. }
  919. // CharacterEscape > ControlEscape
  920. if (try_skip("f")) {
  921. match_length_minimum += 1;
  922. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'\f' } });
  923. return true;
  924. }
  925. if (try_skip("n")) {
  926. match_length_minimum += 1;
  927. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'\n' } });
  928. return true;
  929. }
  930. if (try_skip("r")) {
  931. match_length_minimum += 1;
  932. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'\r' } });
  933. return true;
  934. }
  935. if (try_skip("t")) {
  936. match_length_minimum += 1;
  937. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'\t' } });
  938. return true;
  939. }
  940. if (try_skip("v")) {
  941. match_length_minimum += 1;
  942. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'\v' } });
  943. return true;
  944. }
  945. // CharacterEscape > ControlLetter
  946. if (try_skip("c")) {
  947. for (auto c = 'A'; c <= 'z'; ++c) {
  948. if (try_skip({ &c, 1 })) {
  949. match_length_minimum += 1;
  950. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)(c % 32) } });
  951. return true;
  952. }
  953. }
  954. if (m_should_use_browser_extended_grammar) {
  955. back(2);
  956. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'\\' } });
  957. match_length_minimum += 1;
  958. return true;
  959. }
  960. if (unicode) {
  961. set_error(Error::InvalidPattern);
  962. return false;
  963. }
  964. // Allow '\c' in non-unicode mode, just matches 'c'.
  965. match_length_minimum += 1;
  966. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'c' } });
  967. return true;
  968. }
  969. // LegacyOctalEscapeSequence
  970. if (m_should_use_browser_extended_grammar) {
  971. if (!unicode) {
  972. if (auto escape = parse_legacy_octal_escape(); escape.has_value()) {
  973. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)escape.value() } });
  974. match_length_minimum += 1;
  975. return true;
  976. }
  977. }
  978. }
  979. // '\0'
  980. if (try_skip("0")) {
  981. match_length_minimum += 1;
  982. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)0 } });
  983. return true;
  984. }
  985. // HexEscape
  986. if (try_skip("x")) {
  987. if (auto hex_escape = read_digits(ReadDigitsInitialZeroState::Allow, true, 2); hex_escape.has_value()) {
  988. match_length_minimum += 1;
  989. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)hex_escape.value() } });
  990. return true;
  991. } else if (!unicode) {
  992. // '\x' is allowed in non-unicode mode, just matches 'x'.
  993. match_length_minimum += 1;
  994. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'x' } });
  995. return true;
  996. } else {
  997. set_error(Error::InvalidPattern);
  998. return false;
  999. }
  1000. }
  1001. if (try_skip("u")) {
  1002. if (auto code_point = read_digits(ReadDigitsInitialZeroState::Allow, true, 4); code_point.has_value()) {
  1003. // FIXME: The minimum length depends on the mode - should be utf8-length in u8 mode.
  1004. match_length_minimum += 1;
  1005. StringBuilder builder;
  1006. builder.append_code_point(code_point.value());
  1007. // FIXME: This isn't actually correct for ECMAScript.
  1008. auto u8_encoded = builder.string_view();
  1009. stack.insert_bytecode_compare_string(u8_encoded);
  1010. return true;
  1011. } else if (!unicode) {
  1012. // '\u' is allowed in non-unicode mode, just matches 'u'.
  1013. match_length_minimum += 1;
  1014. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'u' } });
  1015. return true;
  1016. } else {
  1017. set_error(Error::InvalidPattern);
  1018. return false;
  1019. }
  1020. }
  1021. // IdentityEscape
  1022. auto source_characters = m_should_use_browser_extended_grammar ? "^$\\.*+?()[|"sv : "^$\\.*+?()[]{}|"sv;
  1023. for (auto ch : source_characters) {
  1024. if (try_skip({ &ch, 1 })) {
  1025. match_length_minimum += 1;
  1026. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)ch } });
  1027. return true;
  1028. }
  1029. }
  1030. if (unicode) {
  1031. if (try_skip("/")) {
  1032. match_length_minimum += 1;
  1033. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)'/' } });
  1034. return true;
  1035. }
  1036. }
  1037. if (named && try_skip("k")) {
  1038. auto name = read_capture_group_specifier(true);
  1039. if (name.is_empty()) {
  1040. set_error(Error::InvalidNameForCaptureGroup);
  1041. return false;
  1042. }
  1043. auto maybe_length = m_parser_state.named_capture_group_minimum_lengths.get(name);
  1044. if (!maybe_length.has_value()) {
  1045. set_error(Error::InvalidNameForCaptureGroup);
  1046. return false;
  1047. }
  1048. match_length_minimum += maybe_length.value();
  1049. stack.insert_bytecode_compare_named_reference(name);
  1050. return true;
  1051. }
  1052. if (unicode) {
  1053. if (try_skip("p{")) {
  1054. // FIXME: Implement this path, Unicode property match.
  1055. TODO();
  1056. }
  1057. if (try_skip("P{")) {
  1058. // FIXME: Implement this path, Unicode property match.
  1059. TODO();
  1060. }
  1061. }
  1062. if (done())
  1063. return set_error(Error::InvalidTrailingEscape);
  1064. bool negate = false;
  1065. auto ch = parse_character_class_escape(negate);
  1066. if (!ch.has_value()) {
  1067. if (!unicode) {
  1068. // Allow all SourceCharacter's as escapes here.
  1069. auto token = consume();
  1070. match_length_minimum += 1;
  1071. stack.insert_bytecode_compare_values({ { CharacterCompareType::Char, (ByteCodeValueType)token.value()[0] } });
  1072. return true;
  1073. }
  1074. set_error(Error::InvalidCharacterClass);
  1075. return false;
  1076. }
  1077. Vector<CompareTypeAndValuePair> compares;
  1078. if (negate)
  1079. compares.empend(CompareTypeAndValuePair { CharacterCompareType::Inverse, 0 });
  1080. compares.empend(CompareTypeAndValuePair { CharacterCompareType::CharClass, (ByteCodeValueType)ch.value() });
  1081. match_length_minimum += 1;
  1082. stack.insert_bytecode_compare_values(move(compares));
  1083. return true;
  1084. }
  1085. Optional<u8> ECMA262Parser::parse_legacy_octal_escape()
  1086. {
  1087. constexpr auto all_octal_digits = "01234567";
  1088. auto read_octal_digit = [&](auto start, auto end, bool should_ensure_no_following_octal_digit) -> Optional<u8> {
  1089. for (char c = '0' + start; c <= '0' + end; ++c) {
  1090. if (try_skip({ &c, 1 })) {
  1091. if (!should_ensure_no_following_octal_digit || !lookahead_any(all_octal_digits))
  1092. return c - '0';
  1093. back(2);
  1094. return {};
  1095. }
  1096. }
  1097. return {};
  1098. };
  1099. // OctalDigit(1)
  1100. if (auto digit = read_octal_digit(0, 7, true); digit.has_value()) {
  1101. return digit.value();
  1102. }
  1103. // OctalDigit(2)
  1104. if (auto left_digit = read_octal_digit(0, 3, false); left_digit.has_value()) {
  1105. if (auto right_digit = read_octal_digit(0, 7, true); right_digit.has_value()) {
  1106. return left_digit.value() * 8 + right_digit.value();
  1107. }
  1108. back(2);
  1109. }
  1110. // OctalDigit(2)
  1111. if (auto left_digit = read_octal_digit(4, 7, false); left_digit.has_value()) {
  1112. if (auto right_digit = read_octal_digit(0, 7, false); right_digit.has_value()) {
  1113. return left_digit.value() * 8 + right_digit.value();
  1114. }
  1115. back(2);
  1116. }
  1117. // OctalDigit(3)
  1118. if (auto left_digit = read_octal_digit(0, 3, false); left_digit.has_value()) {
  1119. size_t chars_consumed = 1;
  1120. if (auto mid_digit = read_octal_digit(0, 7, false); mid_digit.has_value()) {
  1121. ++chars_consumed;
  1122. if (auto right_digit = read_octal_digit(0, 7, false); right_digit.has_value()) {
  1123. return left_digit.value() * 64 + mid_digit.value() * 8 + right_digit.value();
  1124. }
  1125. }
  1126. back(chars_consumed);
  1127. }
  1128. return {};
  1129. }
  1130. Optional<CharClass> ECMA262Parser::parse_character_class_escape(bool& negate, bool expect_backslash)
  1131. {
  1132. if (expect_backslash && !try_skip("\\"))
  1133. return {};
  1134. // CharacterClassEscape
  1135. CharClass ch_class;
  1136. if (try_skip("d")) {
  1137. ch_class = CharClass::Digit;
  1138. } else if (try_skip("D")) {
  1139. ch_class = CharClass::Digit;
  1140. negate = true;
  1141. } else if (try_skip("s")) {
  1142. ch_class = CharClass::Space;
  1143. } else if (try_skip("S")) {
  1144. ch_class = CharClass::Space;
  1145. negate = true;
  1146. } else if (try_skip("w")) {
  1147. ch_class = CharClass::Word;
  1148. } else if (try_skip("W")) {
  1149. ch_class = CharClass::Word;
  1150. negate = true;
  1151. } else {
  1152. return {};
  1153. }
  1154. return ch_class;
  1155. }
  1156. bool ECMA262Parser::parse_character_class(ByteCode& stack, size_t& match_length_minimum, bool unicode, bool)
  1157. {
  1158. consume(TokenType::LeftBracket, Error::InvalidPattern);
  1159. Vector<CompareTypeAndValuePair> compares;
  1160. if (match(TokenType::Circumflex)) {
  1161. // Negated charclass
  1162. consume();
  1163. compares.empend(CompareTypeAndValuePair { CharacterCompareType::Inverse, 0 });
  1164. }
  1165. if (match(TokenType::RightBracket)) {
  1166. consume();
  1167. // Should only have at most an 'Inverse'
  1168. VERIFY(compares.size() <= 1);
  1169. stack.insert_bytecode_compare_values(move(compares));
  1170. return true;
  1171. }
  1172. if (!parse_nonempty_class_ranges(compares, unicode))
  1173. return false;
  1174. match_length_minimum += 1;
  1175. stack.insert_bytecode_compare_values(move(compares));
  1176. return true;
  1177. }
  1178. struct CharClassRangeElement {
  1179. union {
  1180. CharClass character_class;
  1181. u32 code_point { 0 };
  1182. };
  1183. bool is_negated { false };
  1184. bool is_character_class { false };
  1185. };
  1186. bool ECMA262Parser::parse_nonempty_class_ranges(Vector<CompareTypeAndValuePair>& ranges, bool unicode)
  1187. {
  1188. auto read_class_atom_no_dash = [&]() -> Optional<CharClassRangeElement> {
  1189. if (match(TokenType::EscapeSequence)) {
  1190. auto token = consume().value();
  1191. return { CharClassRangeElement { .code_point = (u32)token[1], .is_character_class = false } };
  1192. }
  1193. if (try_skip("\\")) {
  1194. if (done()) {
  1195. set_error(Error::InvalidTrailingEscape);
  1196. return {};
  1197. }
  1198. if (try_skip("f"))
  1199. return { CharClassRangeElement { .code_point = '\f', .is_character_class = false } };
  1200. if (try_skip("n"))
  1201. return { CharClassRangeElement { .code_point = '\n', .is_character_class = false } };
  1202. if (try_skip("r"))
  1203. return { CharClassRangeElement { .code_point = '\r', .is_character_class = false } };
  1204. if (try_skip("t"))
  1205. return { CharClassRangeElement { .code_point = '\t', .is_character_class = false } };
  1206. if (try_skip("v"))
  1207. return { CharClassRangeElement { .code_point = '\v', .is_character_class = false } };
  1208. if (try_skip("b"))
  1209. return { CharClassRangeElement { .code_point = '\b', .is_character_class = false } };
  1210. if (try_skip("/"))
  1211. return { CharClassRangeElement { .code_point = '/', .is_character_class = false } };
  1212. // CharacterEscape > ControlLetter
  1213. if (try_skip("c")) {
  1214. for (auto c = 'A'; c <= 'z'; ++c) {
  1215. if (try_skip({ &c, 1 }))
  1216. return { CharClassRangeElement { .code_point = (u32)(c % 32), .is_character_class = false } };
  1217. }
  1218. if (m_should_use_browser_extended_grammar) {
  1219. for (auto c = '0'; c <= '9'; ++c) {
  1220. if (try_skip({ &c, 1 }))
  1221. return { CharClassRangeElement { .code_point = (u32)(c % 32), .is_character_class = false } };
  1222. }
  1223. if (try_skip("_"))
  1224. return { CharClassRangeElement { .code_point = (u32)('_' % 32), .is_character_class = false } };
  1225. back(2);
  1226. return { CharClassRangeElement { .code_point = '\\', .is_character_class = false } };
  1227. }
  1228. }
  1229. // '\0'
  1230. if (try_skip("0"))
  1231. return { CharClassRangeElement { .code_point = 0, .is_character_class = false } };
  1232. // HexEscape
  1233. if (try_skip("x")) {
  1234. if (auto hex_escape = read_digits(ReadDigitsInitialZeroState::Allow, true, 2); hex_escape.has_value()) {
  1235. return { CharClassRangeElement { .code_point = hex_escape.value(), .is_character_class = false } };
  1236. } else if (!unicode) {
  1237. // '\x' is allowed in non-unicode mode, just matches 'x'.
  1238. return { CharClassRangeElement { .code_point = 'x', .is_character_class = false } };
  1239. } else {
  1240. set_error(Error::InvalidPattern);
  1241. return {};
  1242. }
  1243. }
  1244. if (try_skip("u")) {
  1245. if (auto code_point = read_digits(ReadDigitsInitialZeroState::Allow, true, 4); code_point.has_value()) {
  1246. // FIXME: While code point ranges are supported, code point matches as "Char" are not!
  1247. return { CharClassRangeElement { .code_point = code_point.value(), .is_character_class = false } };
  1248. } else if (!unicode) {
  1249. // '\u' is allowed in non-unicode mode, just matches 'u'.
  1250. return { CharClassRangeElement { .code_point = 'u', .is_character_class = false } };
  1251. } else {
  1252. set_error(Error::InvalidPattern);
  1253. return {};
  1254. }
  1255. }
  1256. if (unicode) {
  1257. if (try_skip("-"))
  1258. return { CharClassRangeElement { .code_point = '-', .is_character_class = false } };
  1259. }
  1260. if (try_skip("p{") || try_skip("P{")) {
  1261. // FIXME: Implement these; unicode properties.
  1262. TODO();
  1263. }
  1264. if (try_skip("d"))
  1265. return { CharClassRangeElement { .character_class = CharClass::Digit, .is_character_class = true } };
  1266. if (try_skip("s"))
  1267. return { CharClassRangeElement { .character_class = CharClass::Space, .is_character_class = true } };
  1268. if (try_skip("w"))
  1269. return { CharClassRangeElement { .character_class = CharClass::Word, .is_character_class = true } };
  1270. if (try_skip("D"))
  1271. return { CharClassRangeElement { .character_class = CharClass::Digit, .is_negated = true, .is_character_class = true } };
  1272. if (try_skip("S"))
  1273. return { CharClassRangeElement { .character_class = CharClass::Space, .is_negated = true, .is_character_class = true } };
  1274. if (try_skip("W"))
  1275. return { CharClassRangeElement { .character_class = CharClass::Word, .is_negated = true, .is_character_class = true } };
  1276. if (!unicode) {
  1277. // Any unrecognised escape is allowed in non-unicode mode.
  1278. return { CharClassRangeElement { .code_point = (u32)skip(), .is_character_class = false } };
  1279. }
  1280. }
  1281. if (match(TokenType::RightBracket) || match(TokenType::HyphenMinus))
  1282. return {};
  1283. // Allow any (other) SourceCharacter.
  1284. return { CharClassRangeElement { .code_point = (u32)skip(), .is_character_class = false } };
  1285. };
  1286. auto read_class_atom = [&]() -> Optional<CharClassRangeElement> {
  1287. if (match(TokenType::HyphenMinus)) {
  1288. consume();
  1289. return { CharClassRangeElement { .code_point = '-', .is_character_class = false } };
  1290. }
  1291. return read_class_atom_no_dash();
  1292. };
  1293. while (!match(TokenType::RightBracket)) {
  1294. if (match(TokenType::Eof)) {
  1295. set_error(Error::MismatchingBracket);
  1296. return false;
  1297. }
  1298. auto first_atom = read_class_atom();
  1299. if (!first_atom.has_value())
  1300. return false;
  1301. if (match(TokenType::HyphenMinus)) {
  1302. consume();
  1303. if (match(TokenType::RightBracket)) {
  1304. // Allow '-' as the last element in a charclass, even after an atom.
  1305. m_parser_state.lexer.back(2); // -]
  1306. m_parser_state.current_token = m_parser_state.lexer.next();
  1307. goto read_as_single_atom;
  1308. }
  1309. auto second_atom = read_class_atom();
  1310. if (!second_atom.has_value())
  1311. return false;
  1312. if (first_atom.value().is_character_class || second_atom.value().is_character_class) {
  1313. if (m_should_use_browser_extended_grammar) {
  1314. if (unicode) {
  1315. set_error(Error::InvalidRange);
  1316. return false;
  1317. }
  1318. // CharacterRangeOrUnion > !Unicode > CharClass
  1319. if (first_atom->is_character_class)
  1320. ranges.empend(CompareTypeAndValuePair { CharacterCompareType::CharClass, (ByteCodeValueType)first_atom->character_class });
  1321. else
  1322. ranges.empend(CompareTypeAndValuePair { CharacterCompareType::Char, (ByteCodeValueType)first_atom->code_point });
  1323. ranges.empend(CompareTypeAndValuePair { CharacterCompareType::Char, (ByteCodeValueType)'-' });
  1324. if (second_atom->is_character_class)
  1325. ranges.empend(CompareTypeAndValuePair { CharacterCompareType::CharClass, (ByteCodeValueType)second_atom->character_class });
  1326. else
  1327. ranges.empend(CompareTypeAndValuePair { CharacterCompareType::Char, (ByteCodeValueType)second_atom->code_point });
  1328. continue;
  1329. } else {
  1330. set_error(Error::InvalidRange);
  1331. return false;
  1332. }
  1333. }
  1334. if (first_atom.value().code_point > second_atom.value().code_point) {
  1335. set_error(Error::InvalidRange);
  1336. return false;
  1337. }
  1338. VERIFY(!first_atom.value().is_negated);
  1339. VERIFY(!second_atom.value().is_negated);
  1340. ranges.empend(CompareTypeAndValuePair { CharacterCompareType::CharRange, CharRange { first_atom.value().code_point, second_atom.value().code_point } });
  1341. continue;
  1342. }
  1343. read_as_single_atom:;
  1344. auto atom = first_atom.value();
  1345. if (atom.is_character_class) {
  1346. if (atom.is_negated)
  1347. ranges.empend(CompareTypeAndValuePair { CharacterCompareType::TemporaryInverse, 0 });
  1348. ranges.empend(CompareTypeAndValuePair { CharacterCompareType::CharClass, (ByteCodeValueType)first_atom.value().character_class });
  1349. } else {
  1350. VERIFY(!atom.is_negated);
  1351. ranges.empend(CompareTypeAndValuePair { CharacterCompareType::Char, first_atom.value().code_point });
  1352. }
  1353. }
  1354. consume(TokenType::RightBracket, Error::MismatchingBracket);
  1355. return true;
  1356. }
  1357. StringView ECMA262Parser::read_capture_group_specifier(bool take_starting_angle_bracket)
  1358. {
  1359. if (take_starting_angle_bracket && !consume("<"))
  1360. return {};
  1361. auto start_token = m_parser_state.current_token;
  1362. size_t offset = 0;
  1363. while (match(TokenType::Char) || match(TokenType::Dollar)) {
  1364. auto c = m_parser_state.current_token.value();
  1365. if (c == ">")
  1366. break;
  1367. offset += consume().value().length();
  1368. }
  1369. StringView name { start_token.value().characters_without_null_termination(), offset };
  1370. if (!consume(">") || name.is_empty())
  1371. set_error(Error::InvalidNameForCaptureGroup);
  1372. return name;
  1373. }
  1374. bool ECMA262Parser::parse_capture_group(ByteCode& stack, size_t& match_length_minimum, bool unicode, bool named)
  1375. {
  1376. consume(TokenType::LeftParen, Error::InvalidPattern);
  1377. if (match(TokenType::Questionmark)) {
  1378. // Non-capturing group or group with specifier.
  1379. consume();
  1380. if (match(TokenType::Colon)) {
  1381. consume();
  1382. ByteCode noncapture_group_bytecode;
  1383. size_t length = 0;
  1384. if (!parse_disjunction(noncapture_group_bytecode, length, unicode, named))
  1385. return set_error(Error::InvalidPattern);
  1386. consume(TokenType::RightParen, Error::MismatchingParen);
  1387. stack.extend(move(noncapture_group_bytecode));
  1388. match_length_minimum += length;
  1389. return true;
  1390. }
  1391. if (consume("<")) {
  1392. ++m_parser_state.named_capture_groups_count;
  1393. auto group_index = ++m_parser_state.capture_groups_count; // Named capture groups count as normal capture groups too.
  1394. auto name = read_capture_group_specifier();
  1395. if (name.is_empty()) {
  1396. set_error(Error::InvalidNameForCaptureGroup);
  1397. return false;
  1398. }
  1399. ByteCode capture_group_bytecode;
  1400. size_t length = 0;
  1401. if (!parse_disjunction(capture_group_bytecode, length, unicode, named))
  1402. return set_error(Error::InvalidPattern);
  1403. consume(TokenType::RightParen, Error::MismatchingParen);
  1404. stack.insert_bytecode_group_capture_left(name);
  1405. stack.insert_bytecode_group_capture_left(group_index);
  1406. stack.extend(move(capture_group_bytecode));
  1407. stack.insert_bytecode_group_capture_right(name);
  1408. stack.insert_bytecode_group_capture_right(group_index);
  1409. match_length_minimum += length;
  1410. m_parser_state.named_capture_group_minimum_lengths.set(name, length);
  1411. m_parser_state.capture_group_minimum_lengths.set(group_index, length);
  1412. return true;
  1413. }
  1414. set_error(Error::InvalidCaptureGroup);
  1415. return false;
  1416. }
  1417. auto group_index = ++m_parser_state.capture_groups_count;
  1418. stack.insert_bytecode_group_capture_left(group_index);
  1419. ByteCode capture_group_bytecode;
  1420. size_t length = 0;
  1421. if (!parse_disjunction(capture_group_bytecode, length, unicode, named))
  1422. return set_error(Error::InvalidPattern);
  1423. stack.extend(move(capture_group_bytecode));
  1424. m_parser_state.capture_group_minimum_lengths.set(group_index, length);
  1425. consume(TokenType::RightParen, Error::MismatchingParen);
  1426. stack.insert_bytecode_group_capture_right(group_index);
  1427. match_length_minimum += length;
  1428. return true;
  1429. }
  1430. size_t ECMA262Parser::ensure_total_number_of_capturing_parenthesis()
  1431. {
  1432. if (m_total_number_of_capturing_parenthesis.has_value())
  1433. return m_total_number_of_capturing_parenthesis.value();
  1434. GenericLexer lexer { m_parser_state.lexer.source() };
  1435. size_t count = 0;
  1436. while (!lexer.is_eof()) {
  1437. switch (lexer.peek()) {
  1438. case '\\':
  1439. lexer.consume(2);
  1440. continue;
  1441. case '[':
  1442. while (!lexer.is_eof()) {
  1443. if (lexer.consume_specific('\\'))
  1444. lexer.consume();
  1445. else if (lexer.consume_specific(']'))
  1446. break;
  1447. lexer.consume();
  1448. }
  1449. break;
  1450. case '(':
  1451. if (lexer.consume_specific('?')) {
  1452. // non-capturing group '(?:', lookaround '(?<='/'(?<!', or named capture '(?<'
  1453. if (!lexer.consume_specific('<'))
  1454. break;
  1455. if (lexer.next_is(is_any_of("=!")))
  1456. break;
  1457. ++count;
  1458. } else {
  1459. ++count;
  1460. }
  1461. break;
  1462. }
  1463. lexer.consume();
  1464. }
  1465. m_total_number_of_capturing_parenthesis = count;
  1466. return count;
  1467. }
  1468. }