def bits.plain
import bend-kit-regex@0.8.0.0/regex.bend as Regeximport Base
864# Word boundaries depend on the chars on both sides, which one mask per set cannot track.
865def bits.plain(xs: List<&2, Inst>) -> Bool:
866 match xs:
867 case Nil{}:
868 True{}
869 case Con{IAssert{+k}, t}:
870 U32.is_lt(k, 2) && bits.plain(t)
871 case Con{i, t}:
872 bits.plain(t)