Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
422149 | Electronic Notes in Theoretical Computer Science | 2009 | 17 Pages |
Abstract
We have implemented intraprocedural control-flow and data-flow analysis of Java source code in a declarative manner, using reference attribute grammars augmented with circular attributes and collection attributes. Our implementation is built on top of the JastAdd Extensible Java Compiler and we have run the analyses on medium-sized Java programs. We show how the analyses can be built using small concise composable modules, and how they provide extensible frameworks for further source code analyses. Preliminary measurements indicate that there is little difference in execution time between our declarative data-flow analysis and an imperative implementation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics