Maximal munch

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.

The earliest known use of this term is by R.G.G. Cattell in his PhD thesis on automatic derivation of code generators for compilers.

单词	Maximal munch
释义	Maximal munch 英语百科 Maximal munch 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. The earliest known use of this term is by R.G.G. Cattell in his PhD thesis on automatic derivation of code generators for compilers.
随便看	Lohāchāla的意思 Lohālia的意思 Lohārdaga的意思 Lohāru的意思 Lohāwat的意思 L.O.I.的意思 LOI的意思 loiacano的意思 loiacono的意思 Loial的意思 loially的意思 loialties的意思 loialty的意思 Loiano的意思 Loiases的意思 loiasis的意思 loibl的意思 loibls的意思 Loibnal的意思 LOIC的意思 loicadre的意思 Loiching的意思 loid的意思 loida的意思 loid的意思