Publication Details

An Infinite Hierarchy of Language Families Resulting from n-limited Programmed Grammars

ZEMEK Petr. An Infinite Hierarchy of Language Families Resulting from n-limited Programmed Grammars. In: Proceedings of the 14th Conference STUDENT EEICT 2008. Volume 1. Brno: Faculty of Electrical Engineering and Communication BUT, 2008, pp. 164-166. ISBN 978-80-214-3614-5.
Czech title
Nekonečná hierarchie jazykových rodin daná n-limitovanými programovanými gramatikami
Type
conference paper
Language
english
Authors
Zemek Petr, Ing. (DIFS FIT BUT)
URL
Keywords

state grammar, programmed grammar, n-limited derivations, infinite hierarchy of language families

Abstract

This paper establishes an equivalence between n-limited state grammars and n-limited programmed grammars. This equivalence results into an infinite hierarchy of language families resulting from n-limited programmed grammars, which can be considered in syntactical analysis, when writing a parser based on programmed grammars.

Published
2008
Pages
164-166
Proceedings
Proceedings of the 14th Conference STUDENT EEICT 2008
Series
Volume 1
Conference
Student EEICT 2008, Brno, CZ
ISBN
978-80-214-3614-5
Publisher
Faculty of Electrical Engineering and Communication BUT
Place
Brno, CZ
BibTeX 
@INPROCEEDINGS{FITPUB9258,
   author = "Petr Zemek",
   title = "An Infinite Hierarchy of Language Families Resulting from n-limited Programmed Grammars",
   pages = "164--166",
   booktitle = "Proceedings of the 14th Conference STUDENT EEICT 2008",
   series = "Volume 1",
   year = 2008,
   location = "Brno, CZ",
   publisher = "Faculty of Electrical Engineering and Communication BUT",
   ISBN = "978-80-214-3614-5",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/9258"
}
Back to top