✦ LIBER ✦

A parallel parsing algorithm for arbitrary context-free grammars

✍ Scribed by Ra Dong-Yul; Kim Jong-Hyun

Book ID: 107766301
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 836 KB
Volume: 58
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00023-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A recognition and parsing algorithm for

A recognition and parsing algorithm for arbitrary conjunctive grammars

✍ Alexander Okhotin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Conjunctive grammars are basically context-free grammars with an explicit set intersection operation added to the formalism of rules. This paper presents a cubic-time recognition and parsing algorithm for this family of grammars, which is applicable to an arbitrary conjunctive grammar without any in

An LR parsing technique for extended con

An LR parsing technique for extended context-free grammars

✍ Augusto Celentano 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 749 KB

An efficient context-free parsing algori

An efficient context-free parsing algorithm

✍ Earley, Jay 📂 Article 📅 1983 🏛 Association for Computing Machinery 🌐 English ⚖ 552 KB

An efficient context-free parsing algori

An efficient context-free parsing algorithm

✍ Earley, Jay 📂 Article 📅 1970 🏛 Association for Computing Machinery 🌐 English ⚖ 895 KB

Dynamic programming parsing for context-

Dynamic programming parsing for context-free grammars in continuous speech recognition

✍ Ney, H. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 541 KB

A new algorithm for regularizing one-let

A new algorithm for regularizing one-letter context-free grammars

✍ Ştefan Andrei; Salvador Valerio Cavadini; Wei-Ngan Chin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 249 KB