About: Maximal munch

An Entity of Type: agent, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org:8891

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.

Property Value
dbo:abstract
  • 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. (en)
  • In informatica si definisce maximal munch (in lingua inglese può tradursi come massima ingestione) o longest match (corrispondenza più lunga) un procedimento che ad ogni iterazione, tra diverse alternative possibili, sceglie quella che consuma la maggior quantità di input. Un riferimento alla locuzione si trova già in una tesi di dottorato del 1978 presso l'Università Carnegie Mellon riguardante la generazione di codice macchina da parte dei compilatori. (it)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 3945803 (xsd:integer)
dbo:wikiPageLength
  • 6734 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1121845043 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • 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. (en)
  • In informatica si definisce maximal munch (in lingua inglese può tradursi come massima ingestione) o longest match (corrispondenza più lunga) un procedimento che ad ogni iterazione, tra diverse alternative possibili, sceglie quella che consuma la maggior quantità di input. Un riferimento alla locuzione si trova già in una tesi di dottorato del 1978 presso l'Università Carnegie Mellon riguardante la generazione di codice macchina da parte dei compilatori. (it)
rdfs:label
  • Maximal munch (it)
  • Maximal munch (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License