Title: Implicit Program Generation
Speaker: Doaitse Swierstra

Slides: .pdf

Abstract:
I show how by creating parsers on the fly we can create parsers that recognise permutations of a collection of elements. This is done by dynamically creating parsers on the fly, based on the information recognised thus far. The technique relies heavily on lazy evaluation in order to limit the size of the generated parsers.

I challenge others to solve the problem using their favorite program generator

@article{BaLoSw04,
year = {2004},
author = {Arthur I. Baars and Andres L\"oh and S. Doaitse Swierstra},
title = {Parsing Permutation Phrases},
journal = {14},
volume = {6},
month = {November},
urlpdf = {http://www.cs.uu.nl/people/doaitse/papers/2004/perms.pdf},
pubcat = {journal},
}

-- Main.DoaitseSwierstra - 29 Jan 2006