𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bounds on the size of LR(k) parsers

✍ Scribed by Esko Ukkonen

Book ID
113162799
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
337 KB
Volume
20
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the size of parsers and LR(k)-grammar
On the size of parsers and LR(k)-grammars
✍ Hing Leung; Detlef Wotschke πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 122 KB

In this paper, we consider two tradeo results regarding the economy of description in parsing. One result is on the tradeo between the size of a parser and its ability to detect an error early. The other result is on the tradeo between the size of an LR(k)-grammar and the length k of the lookahead.

On the reduction of LR(k) parsers
On the reduction of LR(k) parsers
✍ Woo-Jun Park; Myung-Joon Lee; Kwang-Moo Choe πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 595 KB
Upper Bounds on the Size of Obstructions
Upper Bounds on the Size of Obstructions and Intertwines
✍ Jens Lagergren πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 417 KB

We give an exponential upper bound in p 4 on the size of any obstruction for path-width at most p. We give a doubly exponential upper bound in k 5 on the size of any obstruction for tree-width at most k. We also give an upper bound on the size of any intertwine of two given trees T and T $. The boun

New upper bounds on the minimum size of
New upper bounds on the minimum size of covering designs
✍ Iliya Bluskov; Heikki HΓ€mΓ€lΓ€inen πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 310 KB πŸ‘ 1 views

Let D = {B1 , B2 , . . . , B b } be a finite family of k-subsets (called blocks) of a vset X(v) = {1, 2, . . . , v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size