In Common Lisp, there's a notation both for input and output of recursive
data structures (I think you must activate it explicitly for printing). I
don't remember the exact notation for sure, but it's somewhat like
(a #1=(b c #1) e)
where #1= is a label for the following object and #1 references it.
(Of course, "#" wouldn't be reasonable for Python ;-)
------------------------------------------------------------------------------
* wonder everyday * nothing in particular * all is special *
Marc Wachowitz <mw@ipx2.rz.uni-mannheim.de>