Result Details

General Top-Down Parsers Based On Deep Pushdown Expansions

KŘIVKA, Z.; MEDUNA, A. General Top-Down Parsers Based On Deep Pushdown Expansions. Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava: Marq software s.r.o., 2006. p. 11-18. ISBN: 80-86840-20-4.
Type
conference paper
Language
English
Authors
Křivka Zbyněk, Ing., Ph.D., FIT (FIT), DIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., DIFS (FIT)
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.

Keywords

parsing, pushdown automata, state grammars, infinite hierarchy

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)
ISBN
80-86840-20-4
Publisher
Marq software s.r.o.
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",
  publisher="Marq software s.r.o.",
  address="Ostrava",
  isbn="80-86840-20-4"
}
Projects
Optimally Integrated Models of Modern Information Technologies, GACR, Standardní projekty, GA201/04/0441, start: 2004-01-01, end: 2006-12-31, completed
Research groups
Formal Model Research Group (RG FM)
Departments
Department of Information Systems (DIFS)
Back to top