We could have regular variable names be fixed, and then have special placeholders like *ANY_CALL or *ANY_SYM, *ANY_STR, which might have a regular express as an arg (applied to caller for *ANY_CALL).
*N_ARGS might be use to simulate several args (or lines in {). it might have a n arg to limit those (where n might be 0)
*ANY can really be anything but has a function arg to limit the scope, all other functions are wrapped around it.
Maybe we don't need N_ARGS, n is just a parameter of ANY.
It's easy enough to define new helpers, the detecting function considers as matching functions those that obey a certain fixed pattern. e.g. :
Can we have a generalised regex for code ?
We could have regular variable names be fixed, and then have special placeholders like
*ANY_CALLor*ANY_SYM,*ANY_STR, which might have a regular express as an arg (applied to caller for*ANY_CALL).*N_ARGSmight be use to simulate several args (or lines in{). it might have anarg to limit those (where n might be 0)*ANYcan really be anything but has a function arg to limit the scope, all other functions are wrapped around it.Maybe we don't need
N_ARGS, n is just a parameter ofANY.It's easy enough to define new helpers, the detecting function considers as matching functions those that obey a certain fixed pattern. e.g. :
We might provide a min and max depth to look for a match, the most useful besides might be max = 0 for top level only.
We'd use source markers to spot those but we might also output as data.