reduce keyword capture

corpus/main.txt

@@ -154,6 +154,7 @@ Expressions
     (code))
   (content)
   (tag
+    (keyword)
     (code))
   (content)
   (tag

grammar.js

@@ -32,7 +32,7 @@ module.exports = grammar({
     // General rule for keyword tags
     // It just tries to match the first word in a tag block,
     // plus any other special characters that might be present
-    keyword: $ => /[a-zA-Z0-9\(\)\.>]+/,
+    keyword: $ => /[a-zA-Z>]+/,
     close_keyword: $ => /\/[a-zA-Z]+/,
 
     filter: $ => repeat1(seq(

src/grammar.json

@@ -122,7 +122,7 @@
     },
     "keyword": {
       "type": "PATTERN",
-      "value": "[a-zA-Z0-9\\(\\)\\.>]+"
+      "value": "[a-zA-Z>]+"
     },
     "close_keyword": {
       "type": "PATTERN",

src/parser.c

@@ -202,10 +202,7 @@ static bool ts_lex(TSLexer *lexer, TSStateId state) {
           lookahead == '\n' ||
           lookahead == '\r' ||
           lookahead == ' ') SKIP(0)
-      if (lookahead == '(' ||
-          lookahead == ')' ||
-          ('.' <= lookahead && lookahead <= '9') ||
-          lookahead == '>' ||
+      if (lookahead == '>' ||
           ('A' <= lookahead && lookahead <= 'Z') ||
           ('a' <= lookahead && lookahead <= 'z')) ADVANCE(17);
       END_STATE();
@@ -283,11 +280,7 @@ static bool ts_lex(TSLexer *lexer, TSStateId state) {
       END_STATE();
     case 17:
       ACCEPT_TOKEN(sym_keyword);
-      if (lookahead == '(' ||
-          lookahead == ')' ||
-          lookahead == '.' ||
-          ('0' <= lookahead && lookahead <= '9') ||
-          lookahead == '>' ||
+      if (lookahead == '>' ||
           ('A' <= lookahead && lookahead <= 'Z') ||
           ('a' <= lookahead && lookahead <= 'z')) ADVANCE(17);
       END_STATE();