Detail publikace

General Top-Down Parsers Based On Deep Pushdown Expansions

KŘIVKA, Z. MEDUNA, A.

Originální název

General Top-Down Parsers Based On Deep Pushdown Expansions

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální 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

Autoři

KŘIVKA, Z.; MEDUNA, A.

Rok RIV

2006

Vydáno

25. 4. 2006

Místo

Ostrava

ISBN

80-86840-20-4

Kniha

Proceedings of 1st International Workshop on Formal Models (WFM'06)

Strany od

11

Strany do

18

Strany počet

8

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"
}