From: Eli Zaretskii Date: Mon, 10 Jun 2024 18:24:51 +0000 (+0300) Subject: ; * src/treesit.c (treesit_check_node): Don't use non-ASCII comments. X-Git-Url: http://git.eshelyaron.com/gitweb/?a=commitdiff_plain;h=7ce481b962954c33185b4588a591dca0e277ae75;p=emacs.git ; * src/treesit.c (treesit_check_node): Don't use non-ASCII comments. (cherry picked from commit 2ac85aa6139b151920b08385e7f943e072a1503c) --- diff --git a/src/treesit.c b/src/treesit.c index 9f0eb061056..54b16eb1bb3 100644 --- a/src/treesit.c +++ b/src/treesit.c @@ -433,7 +433,7 @@ static Lisp_Object Vtreesit_str_pred; If we think of programs and AST, it is very rare for any program to have a very deep AST. For example, you would need 1000+ levels of nested if-statements, or a struct somehow nested for 1000+ levels. - It’s hard for me to imagine any hand-written or machine generated + It's hard for me to imagine any hand-written or machine generated program to be like that. So I think 1000 is already generous. If we look at xdisp.c, its AST only have 30 levels. */ #define TREESIT_RECURSION_LIMIT 1000