Maximal munch
id:
maximal-munch-277-11620985
title:
Maximal munch
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
Longest-match principle in parsing
original url:
https://en.wikipedia.org/wiki/Maximal_munch
date created:
date modified:
2024-04-23T08:06:37Z
main entity:
{"identifier":"Q6795641","url":"https://www.wikidata.org/entity/Q6795641"}
image:
fields total:
13
integrity:
14