A NOTE has been added to this issue. ====================================================================== https://www.austingroupbugs.net/view.php?id=1857 ====================================================================== Reported By: dannyniu Assigned To: ====================================================================== Project: 1003.1(2024)/Issue8 Issue ID: 1857 Category: Base Definitions and Headers Type: Error Severity: Objection Priority: normal Status: New Name: DannyNiu/NJF Organization: Individual User Reference: Section: 9.1 Regular Expression Definitions # and others. Page Number: 179-180 and others Line Number: 6366-6368 and others. Interp Status: --- Final Accepted Text: ====================================================================== Date Submitted: 2024-09-14 12:54 UTC Last Modified: 2024-09-20 08:05 UTC ====================================================================== Summary: Several problems with the new "lazy" regex quantifier. ======================================================================
---------------------------------------------------------------------- (0006879) dannyniu (reporter) - 2024-09-20 08:05 https://www.austingroupbugs.net/view.php?id=1857#c6879 ---------------------------------------------------------------------- My first attempt at a proposed wording. Section 9.1, term definition **matched** 3rd para: Change: > ... If the pattern permits a variable number of matching characters and thus there is more than one such sequence starting at that point, the longest such sequence is matched. ... To > ... If the pattern permits a variable number of matching characters and thus there is more than one such sequence starting at that point, the length-fittest such sequence is matched. ... (Examples adapts accordingly) (I'll define length-fittest soon). 4th para: Change: > Consistent with the whole match being the longest of the leftmost matches, each subpattern, from left to right, shall match the longest possible string. To: Within the entire match, where there's quantifier in the entire pattern and any and all of its subpatterns, for 2 adjacent quantifiers (in the sense that there's no other quantifier exists on any segment between the 2 quantifiers) that would result in multiple valid matches, the length-fittest rule applies to the former quantifiers in preference - in other word, the latter quantifier yields to the former when applying the length-fittest rule. Add a term definition **length-fittest**: A concept defined for quantifiers for the purpose of determining the region and sub-regions of match. For quantifiers without the `?` lazy quantifier, the most number of possible repetition is the fittest in terms of length; likewise, for quantifiers with the `?` lazy quantifier, the least number of possible repetition is the fittest in terms of length. Issue History Date Modified Username Field Change ====================================================================== 2024-09-14 12:54 dannyniu New Issue 2024-09-14 12:54 dannyniu Name => DannyNiu/NJF 2024-09-14 12:54 dannyniu Organization => Individual 2024-09-14 12:54 dannyniu Section => 9.1 Regular Expression Definitions # and others. 2024-09-14 12:54 dannyniu Page Number => 179-180 and others 2024-09-14 12:54 dannyniu Line Number => 6366-6368 and others. 2024-09-20 08:05 dannyniu Note Added: 0006879 ======================================================================
