[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
can s-exprs represent a graph without eval?
S-exprs can represent trees of data easily. I am wondering if s-exprs,
or some other syntax, can be used to represent a graph just on reading,
I assume something simple could be done where you have a syntax to bind
symbols, and then access their bindings. Does Lisp do this already? or
is graph data just written as Lisp code and eval'ed?
--- james mccartney
--- james mccartney email@example.com <http://www.audiosynth.com>
SuperCollider - a real time audio synthesis programming language for