On Friday October 17, this site was moved to a new server, https://mw.hh.se. The original address will continue to work. Whithin a week or two this site will return to the original address. /Peo HH IT-dep

WG211/M3Swierstra2: Difference between revisions

From WG 2.11
Jump to navigationJump to search
m 1 revision
(No difference)

Revision as of 12:06, 12 December 2011


Doaitse Swierstra/title> </head> <body bgcolor="white"> Title: Implicit Program Generation <br>Speaker: Doaitse Swierstra <p> Slides: [[http://pub.smart-generators.org/M3Schedule/PermParsers2002.pdf .pdf]] <p> 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 challenge others to solve the problem using their favorite program generator ;-) @article{BaLoSw04, <br> year = {2004}, <br> author = {Arthur I. Baars and Andres L\"oh and S. Doaitse Swierstra}, <br> title = {Parsing Permutation Phrases}, <br> journal = {14}, <br> volume = {6}, <br> month = {November}, <br> urlpdf = {http://www.cs.uu.nl/people/doaitse/papers/2004/perms.pdf}, <br> pubcat = {journal}, <br> } </BODY> -- Main.DoaitseSwierstra - 29 Jan 2006 </p>