Interface PartiallyBalancedTabulationProblem<T,P,F>
- Type Parameters:
T
- type of node in the supergraphP
- type of a procedure (like a box in an RSM)F
- type of factoids propagated when solving this problem
- All Superinterfaces:
TabulationProblem<T,
P, F>
- All Known Implementing Classes:
Slicer.SliceProblem
A
TabulationProblem
with additional support for computing with partially balanced
parentheses.-
Method Summary
Modifier and TypeMethodDescriptiongetFakeEntry
(T n) If n is reached by a partially balanced parenthesis, what is the entry node we should use as the root of thePathEdge
to n? Note that the result must in fact be an entry node of the procedure containing n.Methods inherited from interface com.ibm.wala.dataflow.IFDS.TabulationProblem
getDomain, getMergeFunction, getSupergraph, initialSeeds
-
Method Details
-
getFunctionMap
IPartiallyBalancedFlowFunctions<T> getFunctionMap()- Specified by:
getFunctionMap
in interfaceTabulationProblem<T,
P, F>
-
getFakeEntry
-