𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Concerning bounded-right-context grammars

✍ Scribed by Thomas G. Szymanski

Book ID
107947443
Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
441 KB
Volume
3
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Unilateral context sensitive grammars an
Unilateral context sensitive grammars and left-to-right parsing
✍ GyΓΆrgy RΓ©vΓ©sz πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 682 KB

Classes of languages between context-free and context-sensitive ones may be of theoretical interest. From the practical point of view they might be useful also for the parsing of context-free languages. For example, a left-to-right parser for an LR(k) context-free grammar [1] has to look k symbols a

Unary Context-Free Grammars and Pushdown
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds
✍ Giovanni Pighizzini; Jeffrey Shallit; Ming-wei Wang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 240 KB

It is well known that a context-free language defined over a one-letter alphabet is regular. This implies that unary context-free grammars and unary pushdown automata can be transformed into equivalent finite automata. In this paper, we study these transformations from a descriptional complexity poi