Barham's implementation simply looks for relatively short, disjoint sequences of characters in a small set (alphanumeric plus a few others).

Barham的实现仅在一个小的集合中(字母数字加一些其它字符)查看相对较短和不相交(disjoint)的字符序列。

youdao

Yes, but it isn't immediately obvious as the set of possible MPL sequences isn't inherently disjoint from the set of callable builtin types.

是的，但这不是非常明显，因为可能的MPL序列集不是从可调用内建类型集中自然地分解出来的。

youdao

Yes, but it isn't immediately obvious as the set of possible MPL sequences isn't inherently disjoint from the set of callable builtin types.

是的，但这不是非常明显，因为可能的MPL序列集不是从可调用内建类型集中自然地分解出来的。

youdao