Simple chain grammars


Share/Save/Bookmark

Nijholt, Anton (1977) Simple chain grammars. In: Fourth Conference on Automata, Languages and Programming, 18-22 July 1977, Turku, Finland (pp. pp. 352-364).

open access
[img]
Preview
PDF
724kB
Abstract:A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there exist simple chain grammars which are not LL(k) for any k, this new class of grammars is very close related to the class of LL(1) and simple LL(1) grammars. In fact it can be proved (not in this paper) that each simple chain grammar has an equivalent simple LL(1) grammar. A very simple (bottom-up) parsing method is provided. This method follows directly from the definition of a simple chain grammar and can easily be given in terms of the well-known LR(0) parsing method.
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/66788
Official URL:http://dx.doi.org/10.1007/3-540-08342-1_27
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page