Publication Details

General Top-Down Parsers Based On Deep Pushdown Expansions

KŘIVKA Zbyněk and MEDUNA Alexander. General Top-Down Parsers Based On Deep Pushdown Expansions. In: Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava, 2006, pp. 11-18. ISBN 80-86840-20-4.
Czech title
Obecný analyzátor shora-dolů založený na hlubokých expanzích zásobníku
Type
conference paper
Language
english
Authors
Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT)
Meduna Alexander, prof. RNDr., CSc. (DIFS FIT BUT)
Keywords

parsing, pushdown automata, state grammars, infinite hierarchy

Abstract

This paper  discusses a generalization of the classical general top-down
parsers formalized by pushdown automata.  This generalization consists in
allowing them to make expansions deeper in the pushdown.  Based on the
expansion depth, this paper establishes an infinite hierarchy of language
families between the families of context-free and context-sensitive
languages. The discussion about several modifications, their properties and open problems follows.

Published
2006
Pages
11-18
Proceedings
Proceedings of 1st International Workshop on Formal Models (WFM'06)
Conference
1st International Workshop on Formal Models (WFM'06), Přerov, CZ
ISBN
80-86840-20-4
Place
Ostrava, CZ
BibTeX 
@INPROCEEDINGS{FITPUB8043,
   author = "Zbyn\v{e}k K\v{r}ivka and Alexander Meduna",
   title = "General Top-Down Parsers Based On Deep Pushdown Expansions",
   pages = "11--18",
   booktitle = "Proceedings of 1st International Workshop on Formal Models (WFM'06)",
   year = 2006,
   location = "Ostrava, CZ",
   ISBN = "80-86840-20-4",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/8043"
}
Back to top