Qi Xiao 04173ee8ab Actually fix the O(2^n) code path. ... With the previous fix, the parsing algorithm could still backtrack without making progress given slightly more sophisticated input (see added testdata for an example). Instead of trying to parse a temporary assignment when it *could* be one, only parse it when we are sure that it is. This should now truly fix the issue.		2022-01-01 22:52:56 +00:00
..
20ffbed79ec93b4b3f5872e6a329fee708da4b901c1b9c9ac10912ea7e862c9c	parse: Fix a O(2^n) code path when input is "(" repeated n times.	2022-01-01 22:20:03 +00:00
cfd8d7d9847d47d7fa94af306484de70f8952db8250aa6ebbf7b1c84afb13a91	Actually fix the O(2^n) code path.	2022-01-01 22:52:56 +00:00