Approximate call graph construction for JavaScript, based on the algorithm in this paper, using straightforward depth-first search as its transitive closure.
This implementation is intended for demonstration and reference purposes.
It also serves as an example of how to use parsejs.
git checkout https://github.com/asgerf/callgraphjs.dart
cd callgraphjs.dart
pub get
cd bin
dart main.dart ../benchmarks/deltablue.js