Detail výsledku

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.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Zemek Petr, Ing., Ph.D., UPGM (FIT)
Abstrakt

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.

Klíčová slova

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

URL
Rok
2008
Strany
164–166
Sborník
Proceedings of the 14th Conference STUDENT EEICT 2008
Řada
Volume 1
Konference
Student EEICT 2008
ISBN
978-80-214-3614-5
Vydavatel
Faculty of Electrical Engineering and Communication BUT
Místo
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"
}
Výzkumné skupiny
Výzkumná skupina formálních modelů (VZ FM)
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru