Talk:Maximal munch

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
Low	This article has been rated as Low-importance on the project's importance scale.
	This article is supported by WikiProject Software (assessed as Mid-importance).

How goofy. I suppose calling it the "longest possible match" rule would have been too boring, or something.

It is now commonly called "greedy match" also. -- SasQ —Preceding unsigned comment added by Sasq777 (talk • contribs) 15:06, 11 June 2008 (UTC)[reply]

Is there another method that does things differently than "maximal munch"? Because if there is, it should definitely be linked here. Something feels missing. 134.102.206.230 (talk) 12:31, 4 July 2008 (UTC)[reply]

The obvious alternative is to accept the minimal match. There are a lot of situations where this is undesirable (if we see "23" we usually want one token, "23", and not two tokens, "2" and "3") so this is less popular and to my knowledge doesn't have a snappy name like "maximal munch". If there's an article on the topic, though, I agree that it should be linked. 67.160.227.245 (talk) 06:55, 12 March 2009 (UTC) swift[reply]

Why is there a code example present in the article with no text to explain it? I assume it was put there to illustrate the kind of situation where maximal munch can lead to problems, but there's no longer an explanation in the article. 67.160.227.245 (talk) 06:55, 12 March 2009 (UTC) swift[reply]