Thanks Arthur! On Thu, Oct 24, 2024 at 6:18 AM Arthur A. Gleckler <s...@speechcode.com> wrote:
> On Sun, Oct 20, 2024 at 6:06 PM Alex Shinn <alexsh...@gmail.com> wrote: > >> Proposed finalization note: >> >> The design of this SRFI intends to allow implementors to compile SREs to >> their native regexp libraries. >> As such, the submatch semantics are left unspecified. The preferred >> semantics is leftmost-longest, >> i.e. if multiple submatches are possible the leftmost is preferred, >> choosing the longest submatch as the >> tie-breaker among those starting at the same position. The reference >> implementation, IrRegex, and the >> cited Re implementations provide this semantics, however most >> backtracking algorithms only approximate >> this behavior. Similarly, the non-greedy-* patterns should provide >> leftmost-shortest semantics. >> >>> > Thanks. I've added this note, with tiny copy edits, to the SRFI, and have > changed the library name to regexp. >
