✦ LIBER ✦

Bounded context parsable grammars

✍ Scribed by John H. Williams

Book ID: 114037159
Publisher: Elsevier Science
Year: 1975
Weight: 904 KB
Volume: 28
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(75)90330-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Concerning bounded-right-context grammar

Concerning bounded-right-context grammars

✍ Thomas G. Szymanski 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 441 KB

Uniquely Parsable Unification Grammars a

Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog

✍ Jia Lee; Kenichi Morita; Hiroki Asou; Katsunobu Imai 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 129 KB

Uniquely parsable array grammars for gen

Uniquely parsable array grammars for generating and parsing connected patterns

✍ Kenichi Morita; Katsunobu Imai 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Simulation of one-dimensional cellular a

Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars

✍ Jia Lee; Katsunobu Imai; Kenichi Morita 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 260 KB

A uniquely parsable grammar (UPG) introduced by Morita et al. (Acta Inform. 34 (1997) ) is a special kind of generative grammar where parsing can be performed without backtracking. By extending a UPG, a uniquely parallel parsable grammar (UPPG) was proposed and its unique parallel parsability has be

Generalized context-free grammars and mu

Generalized context-free grammars and multiple context-free grammars

✍ Tadao Kasami; Hiroyuki Seki; Mamoru Fujii 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 808 KB

A hierarchy of uniquely parsable grammar

A hierarchy of uniquely parsable grammar classes and deterministic acceptors

✍ Kenichi Morita; Noritaka Nishihara; Yasunori Yamamoto; Zhiguo Zhang 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 232 KB