ブラウザの設定でJava Scriptの使用を有効にしてご利用ください。
出典:Wiktionary
出典:『Wiktionary』 (2026/05/27 16:07 UTC 版)
maximal munch (uncountable)
出典:Wikipedia
出典:『Wikipedia』 (2011/05/19 04:43 UTC 版)
In computer programming and computer science, "maximal munch" or "longest match" is the principle that when creating some construct, as much of the available input as possible should be consumed. It is similar, though not entirely identical, to the concept of a greedy algorithm.
maximal munch