Re: Graphical Depiction of Parse Trees

pradipkar@my-deja.com
18 Jan 2001 01:15:55 -0500

          From comp.compilers
Related articles
[3 earlier articles]
Re: Graphical Depiction of Parse Trees christl@oberon.fmi.uni-passau.de (2001-01-11)
Re: Graphical Depiction of Parse Trees chase@naturalbridge.com (David Chase) (2001-01-11)
Re: Graphical Depiction of Parse Trees nr@labrador.eecs.harvard.edu (2001-01-11)
Re: Graphical Depiction of Parse Trees jacobs@darwin.epbi.cwru.edu (Kevin Jacobs) (2001-01-11)
Re: Graphical Depiction of Parse Trees Sid-Ahmed-Ali.TOUATI@inria.fr (Sid Ahmed Ali TOUATI) (2001-01-11)
Re: Graphical Depiction of Parse Trees Joachim.Pimiskern@de.bosch.com (Joachim Pimiskern) (2001-01-11)
Re: Graphical Depiction of Parse Trees pradipkar@my-deja.com (2001-01-18)
Re: Graphical Depiction of Parse Trees dewd@aracnet.com (David Wohlford) (2001-03-22)
| List of all articles for this month |
From: pradipkar@my-deja.com
Newsgroups: comp.compilers
Date: 18 Jan 2001 01:15:55 -0500
Organization: Deja.com
References: 01-01-051
Keywords: parse, graphics
Posted-Date: 18 Jan 2001 01:15:55 EST

If you work for an organization and if you can afford to get a
commercial license, I feel, one of the best tool is LEDA-AGD libraries.
LEDA: Library of Efficient Datatypes and Algorithms
AGD: Algorithms for Graph Drawing.
We are using these for our project (Veiwing CDFG (control-data-flow-
graph).
http://www.algorithmic-solutions.com


Else, xvcg is pretty good.


But you need to customize little bit. You have to write littlebit of
code to avoid node overlapping.
Regards
        Pradip Kar
        Sasken Communication Technologies Limited.
        Bangalore, India.


    "David Pereira" <davidpereira@home.com> wrote:
> Hi,
> I've written a parser for a language (which one is not really
> important) that builds a parse tree. I, however, want to browse this
> tree [graphically].

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.