It would be good to add a test.

I am wondering if this is the right spot. This code is unfortunately so messy it is hard to tell. I could see pushing it down to where the recursion happens in_get_depend_dict, but maybe@m-weigand thought on improving thename_match = re.compile(r'[A-Za-z][\w$]*').match is actually nicer?

(I haven't fully understood where other type of constants are figured out,_get_depend_dict has a code comment basically admitting to it being wrong? Theisstring doesn't match for some reason, and if the variable name and the text constant have the same content things will recurse infinitely, because it thinks that it depends on itself -- or another variable for that matter.)

Ping@HaoZeke, although I am not sure you have time to look at f2py issues these days.