> I was wonderring if there's some way to retrieve the tree-structured data in > a format which is easy to parse (the ASCII style is too difficult for a > computer program to parse), something like an XML format maybe?
Rivest (of RSA fame) came up with an S-expression solution that is much more compact and the code for handling it is much smaller than an XML solution. It might fit this problem better than XML. I've included the links to Rivest's sources as well as another project on Source Forge. http://theory.lcs.mit.edu/~rivest/sexp.txt http://theory.lcs.mit.edu/~rivest/sexp.html http://sexpr.sourceforge.net/ _______________________________________________ PersianComputing mailing list [EMAIL PROTECTED] http://lists.sharif.edu/mailman/listinfo/persiancomputing
