✦ LIBER ✦

Boundedness testing for unambiguous context-free grammars

✍ Scribed by Erkki Mäkinen

Book ID: 113162541
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 253 KB
Volume: 17
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90037-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity and unambiguity of context-fr

Complexity and unambiguity of context-free grammars and languages

✍ J. Gruska 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 754 KB

An undecidable problem for context-free

An undecidable problem for context-free grammars

✍ Erkki Mäkinen 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 137 KB

Some restrictive devices for context-fre

Some restrictive devices for context-free grammars

✍ O. Mayer 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 914 KB

A method for inferring context-free gram

A method for inferring context-free grammars

✍ Bruce Knobe; Kathleen Knobe 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 661 KB

Inferring Context-Free Grammars for Doma

Inferring Context-Free Grammars for Domain-Specific Languages

✍ Matej Črepinšek; Marjan Mernik; Barrett R. Bryant; Faizan Javed; Alan Sprague 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 368 KB

A homomorphism theorem for weighted cont

A homomorphism theorem for weighted context-free grammars

✍ Donald F. Stanat 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Productions of a context-free grammar can be given coefficients from semirings, inducing weights for both derivations in the grammar and strings over the terminal alphabet. For a weighted context-free grammar in Greibach normal form, the weight of any string, as well as the set of derivations of the