WG211/M3Swierstra2: Difference between revisions
No edit summary |
No edit summary |
||
| Line 7: | Line 7: | ||
<p> | <p> | ||
Slides: [[Media:PermParsers2002.pdf| PermParsers2002.pdf]] | Slides: [[Media:PermParsers2002.pdf| PermParsers2002.pdf]] | ||
< | <br> | ||
Abstract:<br> | Abstract:<br> | ||
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 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. | ||
Latest revision as of 15:30, 16 December 2011
Doaitse Swierstra
Title: Implicit Program Generation
Speaker: Doaitse Swierstra
Slides: PermParsers2002.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
