Language B is computable.

Write a program that takes parameter p and scans p for a string of the form static int frog, with arbitrary white space (at least one character) between static and int, and between int and frog.

If such a string is found in p, answer yes. If not, answer no.