Re^2: perl language

Being a little fussy, the final data structure used on the execution stage is not a tree but a directed graph that represents the program flow.

The tree is only an intermediate result.

Comment on Re^2: perl language

Replies are listed 'Best First'.
Re^3: perl language by diotalevi (Canon) on Nov 12, 2007 at 23:42 UTC
The tree form is the natural representation of perl code. That representation is never lost either. It's only an optimization that the program flow is superimposed on top of the nodes to make another DAG. ⠤⠤ ⠙⠊⠕⠞⠁⠇⠑⠧⠊	[reply]
Re^3: perl language by ikegami (Patriarch) on Nov 12, 2007 at 17:29 UTC
Yeah, I suppose it's not really a tree, it's only represented as one. You can even see from the B::Concise output (`->##`) that it's really a graph.	[reply] [d/l]