The language, where a machine starts with a list of symbols +.<>],[!- and accepts two instructions p and q which apply the permutations (+-)(,.)([])(<>)

The language, where a machine starts with a list of symbols +.<>],[!- and accepts two instructions p and q which apply the permutations (+-)(,.)([])(<>) or (!.<[+>],-) respectively and executes the brainfuck instruction given by the second symbol whenever the first symbol is !, doesn't even have a name.