𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On efficient implementation of LR-attributed grammars

✍ Scribed by Petr Pavlů

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
777 KB
Volume
41
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.

Efficient Implementation of Image Warpin
Efficient Implementation of Image Warping on a Multimedia Processor
✍ O.D. Evans; Y. Kim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 114 KB

he spatial transformation of images, commonly known as image warping, is fundamental to many applications, e.g. remote sensing, medical imaging, computer vision, and computer Tgr aphics. Computational demands in image warping are high, requiring a geometric transformation, address and coefficient ge

A note on the efficient implementation o
A note on the efficient implementation of implicit methods for ODEs
✍ Pierluigi Amodio; Luigi Brugnano 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 383 KB

The use of implicit methods for ODEs, e.g. implicit Runge-Kutta schemes, requires the solution of nonlinear systems of algebraic equations of dimension s • m, where m is the size of the continuous differential problem to be approximated. Usually, the solution of this system represents the most time-

Efficient implementation of multidimensi
Efficient implementation of multidimensional fast fourier transforms on a Cray X-MP
✍ A Nobile; V Roberto 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 849 KB

We review briefly computational methods for Discrete Fourier Transforms (DFT) and present new techniques which are especially efficient for 2-and 3-dimensional DFT implemented on a Cray X-MP. Comparative timings are given.