What is, approximately, the size of the flow graphs created by
compilers with respect to the parse tree, or to the size of the input
program? Does the time taken to create the graphs dominate most uses
of the graph?