Publication Details

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

ZEMEK, P. An Infinite Hierarchy of Language Families Resulting from n-limited Programmed Grammars. Proceedings of the 14th Conference STUDENT EEICT 2008. Volume 1. Brno: Faculty of Electrical Engineering and Communication BUT, 2008. p. 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., Ph.D.
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, FEKT VUT v Brně, CZ
ISBN
978-80-214-3614-5
Publisher
Faculty of Electrical Engineering and Communication BUT
Place
Brno
BibTeX 
@inproceedings{BUT91248,
  author="Petr {Zemek}",
  title="An Infinite Hierarchy of Language Families Resulting from n-limited Programmed Grammars",
  booktitle="Proceedings of the 14th Conference STUDENT EEICT 2008",
  year="2008",
  series="Volume 1",
  pages="164--166",
  publisher="Faculty of Electrical Engineering and Communication BUT",
  address="Brno",
  isbn="978-80-214-3614-5",
  url="http://www.feec.vutbr.cz/EEICT/2008/sbornik/01-Bakalarske%20projekty/07-Informacni%20systemy/05-xzemek02.pdf"
}
Back to top