Context-free multilanguages
| dc.creator | Knuth, Donald E. | |
| dc.date | 1991-12-01 | |
| dc.date.accessioned | 2026-07-07T09:12:16Z | |
| dc.date.available | 2026-07-07T09:12:16Z | |
| dc.description | This article is a sketch of ideas that were once intended to appear in the author's famous series, "The Art of Computer Programming". He generalizes the notion of a context-free language from a set to a multiset of words over an alphabet. The idea is to keep track of the number of ways to parse a string. For example, "fruit flies like a banana" can famously be parsed in two ways; analogous examples in the setting of programming languages may yet be important in the future. The treatment is informal but essentially rigorous. | |
| dc.description | Abstract added by Greg Kuperberg | |
| dc.identifier | https://arxiv.org/abs/cs/9301115 | |
| dc.identifier | http://arxiv.org/abs/cs/9301115 | |
| dc.identifier | Theoretical Studies in Computer Science, Ginsburg Festschrift | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151969 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Context-free multilanguages | |
| dc.type | text |