Ch(k) grammars: A characterization of LL(k) languages


Nijholt, A. and Soisalon-Soininen, E. (1979) Ch(k) grammars: A characterization of LL(k) languages. In: Mathematical Foundations of Computer Science 1979, 3-7 Sept 1979, Olomouc, Czechoslovakia (pp. pp. 390-397).

open access
Abstract:In this paper we introduce the class of so called Ch(k) grammars [pronounced "chain k grammars"]. This class of grammars is properly contained in the class of LR(k) grammars and it properly contains the LL(k) grammars. However, the family of Ch[k) languages coincides with the family of LL(k) languages. Nevertheless, the parsing properties of Ch(k) grammars are quite different from the parsing properties of LL(k) grammars. The class of Ch(k) grammars can be considered as a generalization of the class of simple chain grammars in the same sense as the class of LL(k) grammars is a generalization of the class of simple LL(1) grammars.
Item Type:Conference or Workshop Item
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page