what do the graphs look like? about tree-sitter-graph HOT 4 CLOSED

I assume graphs for static analysis, like:

• Control-flow Graphs (CFGs) (example on page 6)
• Data-flow Graphs (DFGs) (image)
• Dominator Trees
• Dependence Graphs

These are built from ASTs; but building them is quite complicated [1], and the algorithm is different for programs with different control structures, hence this DSL.

[1] See this guide to constructing a CFG from source code. Constructing a dominator tree and dependence graph requires a CFG first, then you must compute the dominance frontier ("basic block" is a node in the CFG)

from tree-sitter-graph.

That's really up to the rules you make. E.g. an empty set of rules produces an empty graph—not terribly exciting. You can also painstakingly duplicate the AST if you want, or, much more likely, make a more interesting graph (perhaps with sharing or maybe even cycles).

I think beyond that the only really general statements I can make are:

• they're directed
• vertices and edges can have named attributes which can act as labels
• there can be at most one edge between the same (ordered) pair of vertices

Not sure if that answers your question?

from tree-sitter-graph.

do you have some examples?

from tree-sitter-graph.

I think this question has been sufficiently answered, given the generality of the question. (And thanks @Jakobeha for the pointers on possible graph based analyses!)

I'm closing this now. If you want to discuss this further, opening a discussion (instead of an issue) is the best way.

from tree-sitter-graph.