control-flow-graph

问题 int main() { int i, grade = 0; printf (" Enter points: \n"); scanf ("%d", &i); if (i >= 50 && i <= 60) grade = 5; else if (i > 50 && i <= 60) grade = 6; else if (i > 60 && i <= 70) grade = 7; else if (i > 70 && i <= 80) grade = 8; else if (i > 80 && i <= 90) grade = 9; else if (i > 90 && i <= 100) grade = 10; char sign = ' '; if (grade) { int p = i % 10; if (grade != 5) { if (p >= 1 && p <= 3) sign = '-'; else if (grade != 10 && (p >= 8 || p == 0)) sign = '+'; } printf (" The grade is %d%c.

问题 I've been learning about ssa (static single assignment form), and I was given the following graph with phi functions inserted, but the graph hasn't been renamed: I had to rename the variables, and this is what I got: I am very unsure that this is correct. Did I rename the variables correctly? Is this minimal ssa? I am using this algorithm from here (Cytron, et. al's paper) to rename the variables. Please help! :) 回答1: No, your graph is not correct. The phi-functions and renaming for x and y

问题 I've been learning about ssa (static single assignment form), and I was given the following graph with phi functions inserted, but the graph hasn't been renamed: I had to rename the variables, and this is what I got: I am very unsure that this is correct. Did I rename the variables correctly? Is this minimal ssa? I am using this algorithm from here (Cytron, et. al's paper) to rename the variables. Please help! :) 回答1: No, your graph is not correct. The phi-functions and renaming for x and y

问题 I want to know how will it affect to the Cyclomatic Complexity when having multiple start or stop nodes in a control flow diagram.If you could explain the relationship between Cyclomatic Complexity and Start/Stop nodes it will be a great help. 回答1: • A control flow graph can consist of many starts and stops. But according to McCabe's theory, if it is consist of multiple starts and stops it doesn't satisfy the formula. 来源： https://stackoverflow.com/questions/60485378/what-would-happen-if-a

问题 I want to know how will it affect to the Cyclomatic Complexity when having multiple start or stop nodes in a control flow diagram.If you could explain the relationship between Cyclomatic Complexity and Start/Stop nodes it will be a great help. 回答1: • A control flow graph can consist of many starts and stops. But according to McCabe's theory, if it is consist of multiple starts and stops it doesn't satisfy the formula. 来源： https://stackoverflow.com/questions/60485378/what-would-happen-if-a

问题 I am drawing control-flow graphs for Python programs and would like to influence which kind of edges should not be crossed over. Is there a way to do this? Consider this simple Python program: try: a += 1 except: a += 2 else: a = 3 And a dot program to represent the control flow for that generated via https://github.com/rocky/python-control-flow/ digraph G { mclimit=1.5; rankdir=TD; ordering=out; graph[fontsize=10 fontname="Verdana"]; color="#efefef"; node[shape=box style=filled fontsize=8

问题 I am trying to find any possible path in my program by LLVM. Right now I can find paths from entry to exit BB of all functions in my code. However that's not what I need. What I need is extending CFG (maybe by inlining function calls?!) to have a CFG for entire source code and find paths in this extended CFG. I was thinking of using -inline pass first to inline all functions first and then run my pathfinder pass but as I observed -inline works only for functions which are explicitly mentioned

问题 I am trying to analyse Java code sturcture. So, I generated a Java parser and lexer by using ANTLRv3 and java grammar code... but I don't know how could I generate Context Flow Graph using the generated parser and lexer. I tried to learn how to do this through tutorial page, but the tutorial page has already disappeared. Could you give me a way how to do this? or tutorial page? Thank you. 回答1: AFAIK, ANTLR provides no specific help in building a control flow graph. You can build one yourself

问题 For a while I have been struggling with creating a control-flow graph with Soot and I kinda got lost in its tutorials. Rather than using Soot as an Eclipse plugin, I have been trying to use Soot as a library or API. What I want to do is, I have a bunch of Java projects and I want to create/generate a control-flow graph of these projects. I also saw that there is a feature in Soot that I can generate control-flow graphs in "DOT" format, which is quite acceptable for me as well. Any guide or

问题 For a while I have been struggling with creating a control-flow graph with Soot and I kinda got lost in its tutorials. Rather than using Soot as an Eclipse plugin, I have been trying to use Soot as a library or API. What I want to do is, I have a bunch of Java projects and I want to create/generate a control-flow graph of these projects. I also saw that there is a feature in Soot that I can generate control-flow graphs in "DOT" format, which is quite acceptable for me as well. Any guide or