cl-ppcre-devel July 2004

cl-ppcre-devel@common-lisp.net

2 participants
4 discussions

[cl-ppcre-devel] empty line matches with cl-ppcre
by Jan Rychter 14 Jul '04

14 Jul '04

I'm confused. I must be doing something wrong. I have a string: CL-USER> *str* "1 2 3 4 " Just to make sure it's really what it seems: CL-USER> (loop for c across *str* do (format t "~S " c)) #\1 #\Newline #\2 #\Newline #\3 #\Newline #\Newline #\4 #\Newline NIL I wanted to match empty lines, so I did: CL-USER> (cl-ppcre:regex-replace-all (cl-ppcre:create-scanner "^$" :multi-line-mode t) *str* "!") "1 2 3 !! 4 !!" Now, I would normally expect this: "1 2 3 ! 4 " Playing with regex-coach indeed produces the result I'd normally expect. What am I doing wrong? (using CMUCL 19a, the testing version, and CL-PPCRE-0.7.7) many thanks, --J.

2 5

[cl-ppcre-devel] New version 0.7.9
by Edi Weitz 13 Jul '04

13 Jul '04

Hi! A new release is available from <http://weitz.de/files/cl-ppcre.tgz>. Here's the relevant part from the changelog: Version 0.7.9 2004-07-13 Fixed bug in DO-SCANS (caught by Jan Rychter) Have fun, Edi

1 0

[cl-ppcre-devel] New version 0.7.8
by Edi Weitz 13 Jul '04

13 Jul '04

Hi! A new release is available from <http://weitz.de/files/cl-ppcre.tgz>. Here's the relevant part from the changelog: Version 0.7.8 2004-07-13 New SIMPLE-CALLS keyword argument for REGEX-REPLACE(-ALL) Added environment parameter to compiler macros (thanks to c.l.l article <aczhx5hj.fsf(a)ccs.neu.edu> by Joe Marshall) Added compiler macros for SCAN-TO-STRINGS and REGEX-REPLACE(-ALL) (they somehow got lost) Have fun, Edi

1 0

[cl-ppcre-devel] Re: cl-ppcre
by Edi Weitz 07 Jul '04

07 Jul '04

Sorry for the delay, I had moved this email into the wrong IMAP folder... :( On Sun, 20 Jun 2004 12:07:08 +0200, Daniel Skarda <0rfelyus(a)ucw.cz> wrote: > After more regexp experiments I found that the main difference > between Perl and GNU Regexp is not the syntax of regexps (as I > naively thought), but the definition of "the best match" (especially > for `|' alt node). > > One can agree with Perl man pages, that Perl definition could be > better (and more comprehensible) for handwritten regexps. Is "first > match" strategy also better for writing lexers? I doubt. > > Consider languages where some word (token) can be prefix of > another word. This is not unusual: remember that in Lisp `12345' is > number and `12345a' is symbol :) > > While writing "first match" lexer (and your deflexer macro is > "first match" lexer) one has to be careful with rules ordering and > think about possible prefix ambiguity: Yes. But if you prefer not to be careful you'll definitely sacrifice performance... > My conclusion is, that 'success node is meaningful only for > "longest match" regexps engines, because one can expect, that such > engine could do better than match all 'alt nodes in sequence and > return the longest match. > > My new question is: how hard it would be to add :longest-match > option to create-scanner? Pretty hard. This is not going to be done by me. However, if you manage to add this yourself without breaking the rest of CL-PPCRE (and without making it slower) I'll gladly accept your patches. > ps: I am not subscribed to cl-ppcre-devel mailing list. Please "Cc:" > me your replies. Subscribing to the list is easy and the list is low-volume. If you'd like to continue this discussion please either subscribe to the list or use it via nntp: <http://common-lisp.net/nntp.shtml> Cheers, Edi.

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

cl-ppcre-devel July 2004