From: Jurgen Vinju
To:
Date: Fri, 5 Nov 2004 13:09:53 +0100
Subject: PEM: Tobias Kuipers | A Parse Tree Format for Every Occasion | 12.11.98

 
From: pem (PEM moderator)
To: pem-noreply
Subject: PEM meeting | 12.11.98 | M2.80, CWI 
Precedence: bulk
X-url: http://www.cwi.nl/~pem
Mime-Version: 1.0
Content-Type: text/plain;
        charset="iso-8859-1"

   Dear Environmentalists,

   This  week  your  friendly PEM organizer himself will give a talk. See
   below for details.

   This announcement can be found at <http://www.cwi.nl/~pem>

                   A Parse Tree Format for Every Occasion

   Date:    12.11.98
   Time:    10:00
   Venue:   M2.80, CWI
   Speaker: Tobias Kuipers
   Title:   A Parse Tree Format for Every Occasion

   [joint work with Merijn de Jonge]

   The  parse  tree  format  that  is  currently  used  in  our group for
   exchanging parse trees between tools, is rather complex. It contains a
   lot  of  redundancy.  This  redundancy can be very nice at some points
   (e.g.  when  writing  a  compiler), but can also be rather messy (e.g.
   when  writing  a  pretty  printer). Furthermore, the redundancy causes
   parse tree representations to be very large.

   Currently,  the  redundancy  is  addressed  partly  by  having library
   routines  operate  on  the  parse  tree,  thus  giving  some  level of
   abstraction  from  the  actual  format.  The  size  of  the parse tree
   representations  is  addressed  by  using  maximal  term  sharing when
   storing a parse tree.

   Because  these  parse  trees  were ment to be used in a heterogeneous,
   multi-language  environment,  it  is neither practical nor feasible to
   have  a library with abstraction routines availabe for every language.
   (In some languages this would prove very hard to write).

   The  same  holds  for  maximal  term sharing. That is implemented as a
   library of datastructures and routines operating on them, so again, it
   is not feasible to have a library for every language.

   Particularly  when using "small" domain specific languages, it may not
   be worth the trouble of implementing two (rather complex) libraries.

   We propose a Parse Tree Format Generator, which, taking a full, large,
   redundant,  parse  tree  as its input, returns a user specified, small
   and concise representation of the same tree.

   In  our  talk we will describe how to translate from one parse tree to
   another,  how  a  user  specifies  which  format he wants, and we will
   discuss a number if uses of particular parse tree formats.
     _________________________________________________________________

   The  programming environment meetings are a forum for the presentation
   and  discussion  of  new  ideas,  ongoing and finished work. A typical
   meeting  addresses  a subject in the area of programming environments,
   program  generation, algebraic specification, term rewriting, parsing,
   etc.  A presentation ideally takes between 45 and 90 minutes. Meetings
   taking  longer  than 45 minutes are interrupted by a coffeebreak. Most
   Thursdays,  a  meeting is held which starts at 10:00 am. in one of the
   rooms at CWI/WINS. Exceptionally, dates or times may change.

   The    program    of    the    meetings    is    available   on   WWW:
   http://www.cwi.nl/~pem
     _________________________________________________________________