BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A Typed\, Algebraic Approach to Parsing - Neel Krishnaswami (Unive
 rsity of Cambridge) 
DTSTART:20250317T130000Z
DTEND:20250317T140000Z
UID:TALK229108@talks.cam.ac.uk
CONTACT:Ariadne Si Suo
DESCRIPTION:In this talk\, we recall the definition of the context-free ex
 pressions (or µ-regular expressions)\, an algebraic presentation of the c
 ontext-free languages. Then\, we define a core type system for the context
 -free expressions which gives a compositional criterion for identifying th
 ose context-free expressions which can be parsed unambiguously by predicti
 ve algorithms in the style of recursive descent or LL(1). Next\, we show h
 ow these typed grammar expressions can be used to derive a parser combinat
 or library which both guarantees linear-time parsing with no backtracking 
 and single-token lookahead\, and which respects the natural denotational s
 emantics of context-free expressions.\n\nThis was joint work with Jeremy Y
 allop.
LOCATION:FS07\, Computer Laboratory
END:VEVENT
END:VCALENDAR