Javascript – Is it possible to recursively capture a FINITE number of matches (all of the same format) using ECMA RegEx?
For instance, say we're looking at a query string, all-lowercase, all non-numeric, no special character (just [a-z] and =): ?some=querystring&ssembly=containing&n=indeterminate&mount=of&ll=potentially&ccordant=matches Let us take as a given we know there will be three key-value pairs we wish to capture, and even…