A general function which can be used for string parsing is shown below. It takes the start and stop strings as inputs, and those inputs tell the function from where and until when to start searching . It can search from some specific occurrences of start/stop strings, or from the beginning/end of start/stop strings.It can also search and return a specific string if used correctly.If the substring doesn’t exist, it returns as an empty string.

Take a look at this EDA playground example for more clarity.