✦ LIBER ✦

Generalized context-free grammar of algorithmic language algol 68

✍ Scribed by V. V. Bublik

Publisher: Springer US
Year: 1976
Tongue: English
Weight: 638 KB
Volume: 11
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01074229

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On permutative grammars generating conte

On permutative grammars generating context-free languages

✍ Erkki Mäkinen 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 439 KB

PC grammar systems with five context-fre

PC grammar systems with five context-free components generate all recursively enumerable languages

✍ Erzsébet Csuhaj-Varjú; Gheorghe Păun; György Vaszil 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven component

A generalization of the concept of a con

A generalization of the concept of a context-free grammar

✍ A. A. Letichevskii 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 278 KB

Ann2algorithm for recognition of context

Ann2algorithm for recognition of context-free languages

✍ K. Iordzhev 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 366 KB

There does not exist an enumerable famil

There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages

✍ K. Yu. Gorbunov 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 458 KB

On the complexity of parallel parsing of

On the complexity of parallel parsing of general context-free languages

✍ Wojciech Rytter 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 409 KB