R. Farrow, K. Kennedy, and L. Zucconi. Graph grammars and global program data flow analysis. In Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pages 42-56, Houston, Texas, 1976. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Transformation of Shaped Nested Graphs and Diagrams - Hoffmann, Minas (2001) (2 citations) (Correct)
....procedure calls, by sequential composition, condi tional statement, pre checked and post checked loop. Edges labelled by shape names are drawn in grey. Fig. 5. The shape of structured control flow graphs We have chosen a quite restrictive kind of flow graphs. The semi structured flow graphs of [8], which are useful for data flow analysis in compilers, can be defined in a similar way [4] Shape grammars generate a class of graph languages that seems to be one of the largest classes that can be called context free. See [4, section 2.5] for details. In particular, they allow to define the ....
R. Farrow, K. Kennedy, and L. Zucconi. Graph grammars and global program data flow analysis. In Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pages 42-56, Houston, Texas, 1976.
Tree-Based Code Optimization - McConnell (1992) (3 citations) (Correct)
....algorithm is written (at define time ) other kinds of graphs must undergo more complex analysis (at compile time) Sharir [Sha80] proposes parsing a program s CFG into sub graphs representing IF THEN ELSE, WHILE DO, and so on, and then applying techniques similar to Rosen s. Farrow et al. [FKZ76] propose an approach similar to Sharir s, although for a more restricted class of CFGs. The approach most similar in spirit to mine is Babich s method of attributes [Bab77] which associates data flow values ( attributes ) with each node in the AST, and then iterates over the AST re computing ....
R. Farrow, K. Kennedy, and L. Zucconi. Graph grammars and global program data flow analysis. In Proceedings of the Seventeenth Annual IEEE Symposium on Foundations of Computer Science, pages 42--56, 1976.
Tree-Based Code Optimization - Mcconnell (1993) (3 citations) (Correct)
....programs are exactly those that can be written using only downward passed, statement level continuations. This observation, made with regard to the Smalltalk programming language, was the inspiration for this dissertation, although we will not make use of it. ffl Semi structured programs [FKZ76] are composed only of looping, conditional, sequencing, and single level loop exiting constructs. 1 This is just one of several possible characterizations of reducible programs. Control structure cortl equivalent if E then S 1 else S 2 region R f if E then f S 1 ; depart R; g S 2 ; g ....
....is written (at define time ) other kinds of graphs must undergo a dynamic analysis (at compile time) Sharir [Sha80] proposes parsing a program s CFG into sub graphs representing conventional control structures like IF THEN ELSE, and then applying techniques similar to Rosen s. Farrow et al. FKZ76] propose an approach similar to Sharir s, although only for the CFGs of semi structured pro5 grams. Because it uses the AST directly, the approach most similar in spirit to the one taken in this dissertation is Babich s method of attributes [BJ78] which associates data flow values ....
R. Farrow, K. Kennedy, and L. Zucconi. Graph grammars and global program data flow analysis. In Proceedings of the Seventeenth Annual IEEE Symposium on Foundations of Computer Science, pages 42--56, 1976.
Using Attributed Flow Graph Parsing to Recognize Clichés in .. - Wills (1996) (6 citations) (Correct)
....fewer partial analyses, which is advantageous in terms of efficiency, but is a drawback in terms of generating partial results when the graph contains unrecognizable sections. Efficient parsers for control flow graphs have also been developed and applied to problems in global dataflow analysis [6] and program restructuring [14] These parsers are able to take advantage of the fact that their reduction rules have the finite Church Rosser property, which gives rise to a linear time parsing process. These parsers also aim for a single full parse of the entire control flow graph. GRASPR, on ....
R. Farrow, K. Kennedy, and L. Zucconi. Graph grammars and global program data flow analysis. In Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pages 42--56, Houston, Texas, 1976.
Program Timing Analysis - Chapman (1994) (Correct)
No context found.
Far75. Farrow, R., Kennedy, K. and Zucconi, L., "Graph Grammars and Global Program Data Flow Analysis", in Proceedings of the 17th Annual IEEE Symposium on the Foundations of Computer Science (1975).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC