Publication Details

General Top-Down Parsers Based On Deep Pushdown Expansions

KŘIVKA, Z.; MEDUNA, A. General Top-Down Parsers Based On Deep Pushdown Expansions. In Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava: 2006. p. 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)
Meduna Alexandr, prof. RNDr., CSc. (DIFS)

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)

ISBN

80-86840-20-4

Place

Ostrava

BibTeX

@inproceedings{BUT22190,
  author="Zbyněk {Křivka} and Alexandr {Meduna}",
  title="General Top-Down Parsers Based On Deep Pushdown Expansions",
  booktitle="Proceedings of 1st International Workshop on Formal Models (WFM'06)",
  year="2006",
  pages="11--18",
  address="Ostrava",
  isbn="80-86840-20-4"
}