From: Jurgen Vinju
To:
Date: Fri, 5 Nov 2004 13:09:51 +0100
Subject: PEM: Eelco Visser | A Case Study in Optimizing Parsing Schemata by Disambiguation Filters | 11.09.97

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

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

   A Case Study in Optimizing Parsing Schemata by Disambiguation Filters

   Date:    11.09.97
   Time:    10:00
   Venue:   F013, UvA WINS
   Speaker: Eelco Visser
   Title:   A Case Study in Optimizing Parsing Schemata by Disambiguation Filte
rs

   Disambiguation   methods  for  context-free  grammars  enable  concise
   specification  of  programming  languages  by  ambiguous  grammars.  A
   disambiguation  filter  is a function that selects a subset from a set
   of  parse  trees---the possible parse trees for an ambiguous sentence.
   The  framework  of  filters  provides  a  declarative  description  of
   disambiguation methods independent of parsing. Although filters can be
   implemented straightforwardly as functions that prune the parse forest
   produced  by  some generalized parser, this can be too inefficient for
   practical applications.

   In  the  paper  the  optimization of parsing schemata, a framework for
   high-level   description  of  parsing  algorithms,  by  disambiguation
   filters  is  considered  in order to find efficient parsing algorithms
   for  declaratively  specified  disambiguation methods. As a case study
   the  optimization  of the parsing schema of Earley's parsing algorithm
   by  two  filters  is  investigated. The main result is a technique for
   generation   of  efficient  LR-like  parsers  for  ambiguous  grammars
   disambiguated by means of priorities.
     _________________________________________________________________

   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
     _________________________________________________________________