Could this also have been fixed by changingoneOf(list(tex2uni)) tooneOf(list(tex2uni), asKeyword=True) and removing the FollowedBy altogether? This has the benefit of reducing the number of pyparsing terms to be matched, which should translate to faster parsing.

Ithink the problem of asKeyword is that "word boundary" needs a custom definition here (e.g. underscores and digits also separate words). I this this is configurable on pyparsing's side, but I'd rather just write our own regex (something like(?![a-zA-Z])) and be done with it.

This sounds like a better approach than trying to do custom keywords.

If youreally want to collapse this down to a singleRegex, then you could useoneOfto build aRegexfor you of just the word choices, but then extract the generated regex pattern into a newRegex, something likeRegex(r"\\(" + oneOf(text2uni).pattern + ")(?![a-zA-Z])"). (untested, ymmv, etc.)

tex symbols should not have any metacharacters, so the middle part is probably even just"|".join(tex2uni).

Beware of this -oneOf also takes care of reordering longer entries before shorter in the event the shorter entry is a leading subset, and also deduping. Youcould just reverse sort the keys intex2uni by length, but if there are known frequencies to some symbols vs others, and more frequent entries were placed first,oneOf would only reorder them to avoid masking entries, whereas sorting by longest-to-shortest would lose some of this priority ordering.

You can test this for yourself:

re.match(r"ab|abb", "abb")

will return "ab", not the longer and more desirable match "abb". And thereare several cases in tex2uni of these kind of masking pairs.

Maybe keep it simple first, just do"|".join(sorted(set(tex2uni), key=len, reverse=True)) and then get clever with the frequency-based ordering as a later experiment.

Ah, good point, thanks for mentioning that.