On 22/07/2016 17:01, Malcolm Greene wrote:
..
Here's an example of expressions and their full list of dependencies:
a = b + b + b + c + c > b, c, d, e, s, t, x
b = c + d + e > c, d, e, s, t, x
c = s + 3 > s, x
d = t + 1 > t
e = t + 2 > t
s = x + 100 > x
t = 10 > None
x = 1 > None
y = 2
Hi Tim,
> I think that what you're looking for is a topological sort
BINGO! That's *exactly* what I was searching for.
Thank you very much,
Malcolm
--
https://mail.python.org/mailman/listinfo/python-list
On 22/07/2016 17:01, Malcolm Greene wrote:
We're working on a DSL (domain specific language) that we translate into
a list of tokenized expressions. My challenge is to figure out how to
sequence evaluation of these expressions so that we evaluate these
expressions in the proper order given that e
We're working on a DSL (domain specific language) that we translate into
a list of tokenized expressions. My challenge is to figure out how to
sequence evaluation of these expressions so that we evaluate these
expressions in the proper order given that expressions have dependencies
on other express
