Minutes of the 9th November 2020 Teleconference Austin-1079 Page 1 of 1 Submitted by Andrew Josey, The Open Group. 10th November 2020 Attendees: Nick Stoughton, USENIX, ISO/IEC JTC 1/SC 22 OR Joerg Schilling, FOKUS Fraunhofer Don Cragun, IEEE PASC OR Andrew Josey, The Open Group Eric Blake, Red Hat, The Open Group OR Geoff Clare, The Open Group Eric Ackermann, HPI, University of Potsdam Mark Ziegast, SHware Systems Dev. Apologies: Richard Hansen Tom Thompson, IEEE * General news None. * Outstanding actions (Please note that this section has been flushed to shorten the minutes - to locate the previous set of outstanding actions, look to the minutes from 13th June 2019 and earlier) Bug 1254: "asynchronous list" description uses "command" instead of "AND-OR list" OPEN https://austingroupbugs.net/view.php?id=1254 Action: Joerg to investigate how his shell behaves. Bug 700 - Nick to raise this issue with the C committee Bug 713 - Nick to raise with the C committee. Bug 739 - Nick to raise with the C committee. * Current Business Bug 1329: Problem in resolution of 0000793: "Regular Expressions: add REG_MINIMAL and a minimum repitition modifier" Accepted as Marked https://austingroupbugs.net/view.php?id=1329 This item is tagged for Issue 8. Draft 1.1 page 163 after line 5700 add: leftmost The characters closest to the beginning of the string. Draft 1.1 page 172 lines 6090-6100 change: Each of the duplication symbols ('+', '*', '?', and intervals) can be suffixed by the minimal repetition modifier '?' (), in which case matching behavior shall be changed from the leftmost longest possible match to the leftmost shortest possible match, including the null match (see Section A.9, on page 3410). For example, the ERE ".*c" matches up to the last character ('c') in the string "abc abc", whereas the ERE ".*?c" matches up to the first character 'c', the third character in the string. If the REG_MINIMAL flag, defined in the header, is used when compiling an ERE via regcomp( ), the leftmost shortest possible match shall be the default, and the minimal repetition modifier '?' can be used to select the leftmost longest possible match. The behavior of multiple adjacent duplication symbols ('+', '*', '?', and intervals, possibly suffixed by the minimal repetition modifier '?') produces undefined results. to: Each of the duplication symbols ('+', '*', '?', and intervals) can be suffixed by the repetition modifier '?' (), in which case matching behavior for that repetition shall be changed from the leftmost longest possible match to the leftmost shortest possible match, including the null match (see Section A.9, on page 3410). For example, the ERE ".*c" matches up to and including the last character ('c') in the string "abc abc", whereas the ERE ".*?c" matches up to and including the first character 'c', the third character in the string. If the REG_MINIMAL flag, defined in the header, is used when compiling an ERE via regcomp( ), the leftmost shortest possible match shall be the default for all duplication symbols, and the repetition modifier '?' can be used to select the leftmost longest possible match for the repetition it modifies. The behavior of multiple adjacent duplication symbols ('+', '*', '?', and intervals, possibly suffixed by the repetition modifier '?') produces undefined results. Draft 1.1 page 163 line 5718-5722 after: Consistent with the whole match being the longest of the leftmost matches, each subpattern, from left to right, shall match the longest possible string. For this purpose, a null string shall be considered to be longer than no match at all. For example, matching the BRE "\(.*\).*" against "abcdef", the subexpression "(\1)" is "abcdef", and matching the BRE "\(a*\)*" against "bc", the subexpression "(\1)" is the null string. add: However, matching the ERE "(.*?).*" against "abcdef", the subpattern "(.*?)" matches the empty string, since that is the longest possible match for the ERE ".*?". Draft 1.1 page 1719 line 56518, change: REG_MINIMAL Change default matching behavior to leftmost shortest possible match. to: REG_MINIMAL Change the matching behavior for duplication symbols to the leftmost shortest possible match, and invert the behavior of the repetition modifier '?' () to match the longest possible match instead of the shortest. Draft 1.1 page 3411 line 116717-116719 change: EREs can optionally use a leftmost-shortest rule (enabled via the REG_MINIMAL flag or the '?' minimal repetition modifier), in which case the shortest possible matching prefix is instead identified as the matching sequence. to: EREs can optionally use a leftmost-shortest rule for repetitions (enabled via the REG_MINIMAL flag or the '?' repetition modifier), in which case the shortest possible matching prefix is instead identified as the matching sequence for the affected repetition(s). Gettext draft. We will return to this on a future call. The gettext draft in the etherpad is at https://posix.rhansen.org/p/gettext_draft https://posix.rhansen.org/p/gettext_split Next Steps ---------- The next calls are on: November 12th 2020 (Thursday) This call will be for 90 minutes. November 16th 2020 (Monday) This call will be for 60 minutes. Calls are anchored on US time. (8am Pacific) Apologies in advance: Tom Thompson, 2020-11-12 Eric Ackermann, 2020-11-12 Please check the calendar invites for dial in details. Bugs are at: https://austingroupbugs.net An etherpad is usually up for the meeting, with a URL using the date format as below: https://posix.rhansen.org/p/20xx-mm-dd (For write access this uses The Open Group single sign on, for those individuals with gitlab.opengroup.org accounts. Please contact Andrew if you need to be setup)