GNU bug report logs - #62238
30.0.50; Unusual interpretation of "S-expressions" in c-ts-mode

Previous Next

Package: emacs;

Reported by: Philip Kaludercic <philipk <at> posteo.net>

Date: Fri, 17 Mar 2023 09:53:01 UTC

Severity: normal

Found in version 30.0.50

Full log


Message #56 received at 62238 <at> debbugs.gnu.org (full text, mbox):

From: Eli Zaretskii <eliz <at> gnu.org>
To: Juri Linkov <juri <at> linkov.net>
Cc: 62238 <at> debbugs.gnu.org, casouri <at> gmail.com, theo <at> thornhill.no,
 philipk <at> posteo.net, mardani29 <at> yahoo.es
Subject: Re: bug#62238: 30.0.50; Unusual interpretation of "S-expressions"
 in c-ts-mode
Date: Sun, 19 Mar 2023 20:17:46 +0200
> From: Juri Linkov <juri <at> linkov.net>
> Cc: Daniel Martín <mardani29 <at> yahoo.es>,
>   62238 <at> debbugs.gnu.org,
>   casouri <at> gmail.com,  theo <at> thornhill.no,  philipk <at> posteo.net
> Date: Sun, 19 Mar 2023 19:28:58 +0200
> 
> After trying to tweak treesit-sexp-type-regexp a few times
> I become convinced it is not up to the task of properly handling
> all sexp operations.  It seems the existing functions that
> implement C-M-f (forward-sexp), C-M-u (backward-up-list), etc.
> should remain in place, and the role of the tree-sitter would be
> only to provide syntax information for them, i.e. just to replace
> syntax tables with tree-sitter wrappers.

It would be good if you could tell more about what you tried and what
you saw, and how you reached this quite radical conclusion.  Maybe you
are right, but without knowing the details, how can we possibly
discuss it and try to reach a common conclusion?  Up front, the
conclusion sounds almost incredible: after all, how can a compiler
recognize blocks and defuns if not by parsing the program source?  If
the compiler does it, why cannot we do the same using the parsing
products?

So please consider making the discussion more useful by telling more.
(Perhaps on emacs-devel, not here.)




This bug report was last modified 2 years and 80 days ago.

Previous Next


GNU bug tracking system
Copyright (C) 1999 Darren O. Benham, 1997,2003 nCipher Corporation Ltd, 1994-97 Ian Jackson.