A New Look at LR (k)
Dr. William McKeeman
February 20, 2004
11 a.m. - 12 noon
Fuller Labs 320
Abstract
Knuth offered LR (k) as an algorithm for parsing computer languages (Information and Control, November 1965). Most work since then has concentrated on parser usability and space/time optimization. This talk presents LR (k) from first principles, teasing apart some complex formalisms applied by Knuth into simpler components.
Assumptions: The audience is comfortable with mathematical notation and computer programming.
You can obtain slides for Dr. William McKeeman's presentation
Host
Prof. Gary Pollice
Refreshments will be served.
Maintained by webmaster@cs.wpi.eduLast modified: September 26, 2006 13:21:42