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


Share/Save/Bookmark

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.

[img]
Preview
PDF
331Kb
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
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66912
Official URL:http://dx.doi.org/10.1007/3-540-09526-8_38
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page