3 ms·
Broadly speaking, in graph reduction the nodes are functions and values and the edges are steps in the computation that can be taken to apply functions to those
by grblovrflowerrr 10y ago
Broadly speaking, in graph reduction the nodes are functions and values and the edges are steps in the computation that can be taken to apply functions to those values. After application that node becomes a new value, etc. until the program is evaluated or terminated.
https://en.wikipedia.org/wiki/Graph_reduction https://en.wikipedia.org/wiki/Graph_reduction
https://en.wikipedia.org/wiki/Abstract_semantic_graph https://en.wikipedia.org/wiki/Abstract_semantic_graph
Generally they're acyclic but some types of ASGs can represent recursive functions as cycles, so they are distinct from trees.
- catnaroek 10y agoThanks for your actually useful answer.
- jsprogrammer 10y agoWhat did you not find useful about my numerous answers? Basically, everything is in some way equivalent to some graph. Since anything is an example, it's difficult to say much without using an example, which then necessarily constrains the discussion. It would be more useful if you presented an example computation or representation, then I could show you how to make and reverse an equivalent graph. (Which then might show you what information might be associated with nodes and edges.)
- grblovrflowerrr 10y agoI don't think there's any reason to be judgy about the other commenter. I understand you wanted a rigorous definition but there are better ways to ask for it than making unilateral demands and using negative terms like "disappointing" and "annoying". You may be well versed in these subjects but it is possible to be technically correct and gracious at the same time. I think you're capable of doing so and you would probably find more fruitful discussions by taking that path.