BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A Verifiable\, Executable SLR Parser - Aditi Barthwal (The Austral
 ian National University)
DTSTART:20090319T123000Z
DTEND:20090319T133000Z
UID:TALK17135@talks.cam.ac.uk
CONTACT:Thomas Tuerk
DESCRIPTION:This talk is based on one I will be presenting at the ESOP con
 ference.  In this talk\, I will describe the mechanisation of an SLR parse
 r produced by a parser generator. I will present the main properties prove
 d about the parser\, in particular\, soundness: if the\nparser results in 
 a parse tree on a given input\, then the parse tree is valid with respect 
 to the grammar\, and the leaves of the parse tree match the input\; comple
 teness: if the input is in the language of the grammar then the parser con
 structs the correct parse tree for the\ninput with respect to the grammar\
 ; and non-ambiguity: grammars successfully converted to SLR automata are u
 nambiguous. We will also briefly have a look at the complexity introduced 
 when providing executable versions of the algorithms involved.\n
LOCATION:Computer Laboratory\, William Gates Building\, Room SS03
END:VEVENT
END:VCALENDAR