Simple chain grammars and languages

Share/Save/Bookmark

Nijholt, Anton (1979) Simple chain grammars and languages. Theoretical Computer Science, 9 (3). pp. 287-309. ISSN 0304-3975

[img]
Preview
PDF
2296Kb
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>0, this new class of grammars is very closely related to the LL(1) and simple LL(1) grammars. In fact it can be shown that every simple chain grammar has an equivalent simple LL(1) grammar. Cover properties for simple chain grammars are investigated and a deterministic pushdown transducer which acts as a right parser for simple chain grammars is presented.
Item Type:Article
Copyright:© 1979 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66914
Official URL:http://dx.doi.org/10.1016/0304-3975(79)90032-X
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page