Re^2: Mapping URLs to code - in search of perlish dispatch schemes

That's too wordy for me. I want to write it like a regex, but expect it to match like smarter Perl code - so my "regex"-like syntax would then be translated into your syntax or diotalevi's elegant Prolog example, nothingmuch's Monju model or maybe even an XML document against which XPath queries are run to determine the matching nodes.

Comment on Re^2: Mapping URLs to code - in search of perlish dispatch schemes

Replies are listed 'Best First'.
Re^3: Mapping URLs to code - in search of perlish dispatch schemes by jaa (Friar) on Jul 21, 2006 at 09:31 UTC
I like both - thought I think the structured args approach will be mucho clearer for perl newbies and casuals. I am worried about the efficiency of matching an actual URL against the parsed definitions. Do you have thoughts on how you are going to make this efficient? Efficiency being memory based for some, and speed based for others?	[reply]
Re^4: Mapping URLs to code - in search of perlish dispatch schemes by Corion (Patriarch) on Jul 21, 2006 at 09:34 UTC
I haven't thought about the speed at all yet, but seeing that the same decision tree is executed in traditional code as well, I don't think this will be much of a problem. Maybe the Prolog approach will be a performance problem, but first I want to get the syntax convenient before I worry about the implementation too much.	[reply]