July 31, 1998 Updated by Ms. Jade Y.S. Hsu
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.


  1. A Semantic-Syntactic Approach to Image Analysis
  2. Imprecise Database, Imprecise Queries and View Navigation
  3. A New Thinning Algorithm for Removing Noise-Spurs and Retaining End-points
  4. The Optimality of the Number of k-Sorters of a Parallel Merging Algorithm
  5. On Properties of Extended LL(k) Grammars
  6. Pattern Recognition by Dynamic Look-up-Table Programming -The Dynamic Pyramid Approach