GNU bug report logs -
#24914
24.5; isearch-regexp: wrong error message
Previous Next
Reported by: Drew Adams <drew.adams <at> oracle.com>
Date: Wed, 9 Nov 2016 22:31:01 UTC
Severity: minor
Tags: confirmed, fixed, patch
Found in versions 24.5, 25.2
Fixed in version 27.1
Done: Noam Postavsky <npostavs <at> users.sourceforge.net>
Bug is archived. No further changes may be made.
Full log
Message #18 received at 24914 <at> debbugs.gnu.org (full text, mbox):
Drew Adams <drew.adams <at> oracle.com> writes:
>> > 3. C-M-s \(.\|^J\)\{,40000\}
>> > That shows the error message: [incomplete input],
>> > which is wrong, IMO.
>>
>> The reason it doesn't work is because the number of repitions
>> is limited to 32767 (#x7fff).
>
> Yet another case for adding bignums to Emacs Lisp?
> I imagine someone will answer that there needs to be
> a limit.
>
> In that case, can we not use something larger?
> Could we use the value of `most-positive-fixnum'?
It's not a limit in Lisp, but in regex.c.
>> As to the error message itself, there isn't really a way
>> to distinguish between incomplete and invalid input,
>
> We do that in some places in the code.
What places are those?
> Some code parses the regexp, and that code must know (or be able to
> know) both that the regexp is not incomplete
What does it mean for a regexp to be incomplete or not? As far as I can
tell, the only distinction is that the user means to type more; but the
code doesn't know what will happen in the future...
> and that the numeral
> given for the number of repetitions is too large.
I suppose we could change regex.c to give a different error message for
a repetition number that is too high, and then isearch.el could check
for that specially.
This bug report was last modified 7 years and 119 days ago.
Previous Next
GNU bug tracking system
Copyright (C) 1999 Darren O. Benham,
1997,2003 nCipher Corporation Ltd,
1994-97 Ian Jackson.