Dhruv Manilawala 1e0642fac8 Use re-lexing for normal list parsing (#11871) ... ## Summary This PR is a follow-up on #11845 to add the re-lexing logic for normal list parsing. A normal list parsing is basically parsing elements without any separator in between i.e., there can only be trivia tokens in between the two elements. Currently, this is only being used for parsing **assignment statement** and **f-string elements**. Assignment statements cannot be in a parenthesized context, but f-string can have curly braces so this PR is specifically for them. I don't think this is an ideal recovery but the problem is that both lexer and parser could add an error for f-strings. If the lexer adds an error it'll emit an `Unknown` token instead while the parser adds the error directly. I think we'd need to move all f-string errors to be emitted by the parser instead. This way the parser can correctly inform the lexer that it's out of an f-string and then the lexer can pop the current f-string context out of the stack. ## Test Plan Add test cases, update the snapshots, and run the fuzzer.		2024-06-18 12:14:41 +05:30
..
snapshots	Use re-lexing for normal list parsing (#11871)	2024-06-18 12:14:41 +05:30
fixtures.rs	Rename PreorderVisitor to SourceOrderVisitor (#11798)	2024-06-07 17:01:58 +00:00
generate_inline_tests.rs	Replace LALRPOP parser with hand-written parser (#10036)	2024-04-18 17:57:39 +05:30