Vol.1 No.1, pp.73-81 (January 1985)

On Properties of Extended *LL*(*k*) Grammars

I-Peng Lin and Ching-Chi Hsu

* Department of Computer Science and Information Engineering,
National Taiwan University,
Taipei, Taiwan, Republic of China*

A class of context-free grammars, called ELL(k), is investigated. We prove that ELL(k) grammars are LR(k) and show that this class of grammars has the undecidability property.

- A Semantic-Syntactic Approach to Image Analysis

- Imprecise Database, Imprecise Queries and View Navigation

- A New Thinning Algorithm for Removing Noise-Spurs and Retaining End-points

- The Optimality of the Number of
*k*-Sorters of a Parallel Merging Algorithm

- On Properties of Extended
*LL(k)*Grammars

- Pattern Recognition by Dynamic Look-up-Table Programming -The Dynamic Pyramid Approach