Detail výsledku

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.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Abstrakt

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.

Klíčová slova

parsing, pushdown automata, state grammars, infinite hierarchy

Rok
2006
Strany
11–18
Sborník
Proceedings of 1st International Workshop on Formal Models (WFM'06)
Konference
1st International Workshop on Formal Models (WFM'06)
ISBN
80-86840-20-4
Vydavatel
Marq software s.r.o.
Místo
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"
}
Projekty
Optimally Integrated Models of Modern Information Technologies, GAČR, Standardní projekty, GA201/04/0441, zahájení: 2004-01-01, ukončení: 2006-12-31, ukončen
Výzkumné skupiny
Pracoviště
Nahoru