For analysis/support, I would find it useful to have a search for a string in a BRFplus application: It should return all expressions containing the given search string (or pattern) as a direct value (wherever in the application a string can be entered directly).
I started such a search function on the generated class: It looks for literals in the generated code. From there, it could scan backwards to the comment line containing the GUID and ID of the BRF+ expression which uses it.
But instead, it would be more straightforward - and better defined - to propagate the tree of expressions from the entry points (which are the application's functions), and to look in each expression for the occurence of a string. Doing it this way, one knows the structure of each expression and the places where strings can be entered directly according to their syntax.
My question: Is there already an implementation of string search in BRF+ applications? If not, what would be the idea to implement it using the BRF+ API?