WG211/M3Swierstra2 - Revision history

Walid at 13:30, 16 December 2011

2011-12-16T13:30:36Z

← Older revision		Revision as of 15:30, 16 December 2011
Line 7:		Line 7:
	<p>		<p>
	Slides: [[Media:PermParsers2002.pdf\| PermParsers2002.pdf]]		Slides: [[Media:PermParsers2002.pdf\| PermParsers2002.pdf]]
	<p>		<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.

Walid at 13:30, 16 December 2011

2011-12-16T13:30:07Z

← Older revision		Revision as of 15:30, 16 December 2011
Line 1:		Line 1:
	[[Category:WG211]]		[[Category:WG211]]

			Doaitse Swierstra
	~~<HTML>~~
	~~<HEAD>~~
	~~<title>~~Doaitse Swierstra~~/title>~~
	~~</head>~~

	~~<body bgcolor="white">~~

	Title: Implicit Program Generation		Title: Implicit Program Generation
	<br>Speaker: Doaitse Swierstra		<br>Speaker: Doaitse Swierstra
	<p>		<p>
	Slides: [[~~http~~:~~//pub.smart-generators.org/M3Schedule/~~PermParsers2002.pdf .pdf]]		Slides: [[Media:PermParsers2002.pdf\| PermParsers2002.pdf]]
	<p>		<p>
	Abstract:<br>		Abstract:<br>
Line 31:		Line 25:
	<br> }		<br> }

	~~</BODY>~~
	~~</HTML>~~
	-- Main.DoaitseSwierstra - 29 Jan 2006		-- Main.DoaitseSwierstra - 29 Jan 2006

Admin: 1 revision

2011-12-12T10:06:26Z

1 revision

New page

[[Category:WG211]]

<HTML>
<HEAD>
<title>Doaitse Swierstra/title>
</head>

<body bgcolor="white">

Title: Implicit Program Generation
 Speaker: Doaitse Swierstra

Slides: [[http://pub.smart-generators.org/M3Schedule/PermParsers2002.pdf .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},
 }

</BODY>
</HTML>
-- Main.DoaitseSwierstra - 29 Jan 2006