We present simple graphical tools for analyzing a generalization of
simple splicing languages. Our semi-simple splicing languages are
generated by rules of the form (a,1;b,1) where a and b
are alphabet symbols. Our main result is that any such language is strictly
locally testable.