The dataflow graph to conduct the slicing on.
The normalized AST of the code (used to get static nesting information of the lexemes in case of control flow dependencies that may have no effect on the slicing scope).
The criteras to slice on.
The maximum number of nodes to visit in the graph. If the threshold is reached, the slice will side with inclusion and drop its minimal guarantee. The limit ensures that the algorithm halts.
This returns the ids to include in the static backward slice, when slicing with the given seed id's (must be at least one).
The returned ids can be used to reconstructToCode|reconstruct the slice to R code.